On a poset of quantum exact promise problems

DOI10.1007/s11128-021-03156-3OpenAlexW3175597358MaRDI QIDQ2690501

Sofia Vallecorsa, Alberto Di Meglio, Elías F. Combarro, Alejandro Piñera, Ignacio F. Rúa

Publication date: 17 March 2023

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11128-021-03156-3

zbMATH Keywords

quantum algorithmsposetsquery complexityDeutsch-Jozsa algorithmBernstein-Vazirani algorithm

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites Work

• Unnamed Item
• Unnamed Item
• Szegedy's quantum walk with queries
• Faster search by lackadaisical quantum walk
• Quantum walks for the determination of commutativity of finite dimensional algebras
• Quantum abstract detecting systems
• Quantum Computation and Quantum Information
• Rapid solution of problems by quantum computation
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Quantum Complexity Theory

This page was built for publication: On a poset of quantum exact promise problems