Oracle separations for non-adaptive collapse-free quantum computing

DOI10.1016/J.TCS.2025.115078MaRDI QIDQ7028331zbMATH OpenFDO

Authors Henrique Hepp, Murilo V. G. da Silva, Leandro M. Zatesko

Publication date 12 February 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115078

zbMATH Keywords

collapse-free quantum computingcomputational complexityoracle separationunambiguous polynomial time

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum computation (81P68)

Cites work

• \(\mathrm P \overset {?} {=} \mathrm{NP}\)
• Complexity limitations on quantum computation
• scientific article; zbMATH DE number 1583884 (Why is no real title available?)
• scientific article; zbMATH DE number 1775405 (Why is no real title available?)
• Oracle Separation of BQP and PH
• Quantum circuits with classical channels and the principle of deferred measurements
• Quantum computing and hidden variables
• Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
• Strengths and Weaknesses of Quantum Computing
• The space ``just above BQP
• Uniform hardness versus randomness tradeoffs for Arthur-Merlin games

This page was built for publication: Oracle separations for non-adaptive collapse-free quantum computing

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