2000 character limit reached
Oracle separation of QMA and QCMA with bounded adaptivity (2402.00298v1)
Published 1 Feb 2024 in quant-ph and cs.CC
Abstract: We give an oracle separation between QMA and QCMA for quantum algorithms that have bounded adaptivity in their oracle queries; that is, the number of rounds of oracle calls is small, though each round may involve polynomially many queries in parallel. Our oracle construction is a simplified version of the construction used recently by Li, Liu, Pelecanos, and Yamakawa (2023), who showed an oracle separation between QMA and QCMA when the quantum algorithms are only allowed to access the oracle classically. To prove our results, we introduce a property of relations called \emph{slipperiness}, which may be useful for getting a fully general classical oracle separation between QMA and QCMA.
- Scott Aaronson, Harry Buhrman and William Kretschmer “A Qubit, a Coin, and an Advice String Walk Into a Relational Problem”, 2023 DOI: 10.48550/arXiv.2302.10332
- “Quantum versus Classical Proofs and Advice” In Twenty-Second Annual IEEE Conference on Computational Complexity (CCC’07), 2007, pp. 115–128 DOI: 10.1109/CCC.2007.27
- “Quantum NP - A Survey”, 2002 DOI: 10.48550/arXiv.quant-ph/0210077
- “Strengths and Weaknesses of Quantum Computing” In SIAM Journal on Computing 26, 1997, pp. 1510–1523 DOI: 10.1137/S0097539796300933
- Roozbeh Bassirian, Bill Fefferman and Kunal Marwaha “On the Power of Nonstandard Quantum Oracles” In 18th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2023) 266, Leibniz International Proceedings in Informatics (LIPIcs) Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023, pp. 11:1–11:25 DOI: 10.4230/LIPIcs.TQC.2023.11
- “Random Oracles and Non-uniformity” In Advances in Cryptology – EUROCRYPT 2018 Cham: Springer International Publishing, 2018, pp. 227–258
- “Quantum vs. Classical Proofs and Subset Verification” In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018) 117, Leibniz International Proceedings in Informatics (LIPIcs) Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2018, pp. 22:1–22:23 DOI: 10.4230/LIPIcs.MFCS.2018.22
- Mika Göös, Toniann Pitassi and Thomas Watson “Query-to-communication lifting for BPP” In Proceedings of the 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2017 DOI: 10.1109/FOCS.2017.21
- Qipeng Liu “Non-uniformity and Quantum Advice in the Quantum Random Oracle Model” In Advances in Cryptology – EUROCRYPT 2023 Cham: Springer Nature Switzerland, 2023, pp. 117–143
- “Classical vs Quantum Advice and Proofs under Classically-Accessible Oracle”, 2023 DOI: 10.48550/arXiv.2303.04298
- “A Distribution Testing Oracle Separating QMA and QCMA” In 38th Computational Complexity Conference (CCC 2023) 264, Leibniz International Proceedings in Informatics (LIPIcs) Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023, pp. 22:1–22:27 DOI: 10.4230/LIPIcs.CCC.2023.22
- “Oracle Separation of BQP and PH” In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019 Phoenix, AZ, USA: Association for Computing Machinery, 2019, pp. 13–23 DOI: 10.1145/3313276.3316315
- Atri Rudra “List Decoding and Property Testing of Error Correcting Codes”, 2007 URL: https://cse.buffalo.edu/faculty/atri/papers/coding/thesis.html
- “Verifiable Quantum Advantage without Structure” In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 2022, pp. 69–74 DOI: 10.1109/FOCS54457.2022.00014