Quantum zero-error algorithms cannot be composed

DOI10.1016/S0020-0190(03)00254-0MaRDI QIDQ1014398zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 5568627
• scientific article; zbMATH DE number 5953454
• Quantum lower bounds by polynomials

Cites work

• \(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\)
• Complexity measures and decision tree complexity: a survey.
• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 1776257 (Why is no real title available?)
• scientific article; zbMATH DE number 2086394 (Why is no real title available?)
• Nondeterministic Quantum Query and Communication Complexities
• Quantum Computability
• Rapid solution of problems by quantum computation

Cited in

(1)

• Superiority of exact quantum automata for promise problems

This page was built for publication: Quantum zero-error algorithms cannot be composed

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014398)