Quantum zero-error algorithms cannot be composed

DOI10.1016/S0020-0190(03)00254-0zbMath1175.68182OpenAlexW1999914841MaRDI QIDQ1014398

Harry Buhrman, Ronald de Wolf

Publication date: 28 April 2009

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(03)00254-0

zbMATH Keywords

analysis of algorithmsquantum computingzero-error computation

Mathematics Subject Classification ID

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

Related Items

Superiority of exact quantum automata for promise problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\)
• Complexity measures and decision tree complexity: a survey.
• Rapid solution of problems by quantum computation
• Quantum Computability
• Nondeterministic Quantum Query and Communication Complexities