Image de couverture de livre

Separating Quantum and Classical Advice with Good Codes

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bostanci, John, Huang, Andrew, Vaikuntanathan, Vinod
Format:	Preprint
Publié:	2026
Sujets:	Quantum Physics Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth
par: Kahanamoku-Meyer, Gregory D., et autres
Publié: (2024)

Quantum Event Learning and Gentle Random Measurements
par: Watts, Adam Bene, et autres
Publié: (2022)

Classical vs Quantum Advice and Proofs under Classically-Accessible Oracle
par: Li, Xingjian, et autres
Publié: (2023)

Uncloneable Quantum Advice
par: Broadbent, Anne, et autres
Publié: (2023)

Commuting Local Hamiltonians Beyond 2D
par: Bostanci, John, et autres
Publié: (2024)

Oracle Separations for the Quantum-Classical Polynomial Hierarchy
par: Agarwal, Avantika, et autres
Publié: (2024)

Improved Circuit Lower Bounds and Quantum-Classical Separations
par: Grewal, Sabee, et autres
Publié: (2024)

Coherence in Property Testing: Quantum-Classical Collapses and Separations
par: Jeronimo, Fernando Granha, et autres
Publié: (2024)

Quantum versus Classical Separation in Simultaneous Number-on-Forehead Communication
par: Yang, Guangxu, et autres
Publié: (2025)

Separating QMA from QCMA with a classical oracle
par: Bostanci, John, et autres
Publié: (2025)

Exponential Separation of Quantum and Classical One-Way Numbers-on-Forehead Communication
par: Yang, Guangxu, et autres
Publié: (2026)

On Bounded Advice Classes
par: Marshall, Simon, et autres
Publié: (2024)

Average-Case Complexity of Quantum Stabilizer Decoding
par: Khesin, Andrey Boris, et autres
Publié: (2025)

Toward Separating QMA from QCMA with a Classical Oracle
par: Zhandry, Mark
Publié: (2024)

Quantum and Classical Communication Complexity of Permutation-Invariant Functions
par: Guan, Ziyi, et autres
Publié: (2023)

Symmetric Perceptrons, Number Partitioning and Lattices
par: Vafa, Neekon, et autres
Publié: (2025)

Quantum-Classical Separations in Shallow-Circuit-Based Learning with and without Noises
par: Zhang, Zhihan, et autres
Publié: (2024)

Lower Bounds for Unitary Property Testing with Proofs and Advice
par: Weggemans, Jordi
Publié: (2024)

An efficient quantum parallel repetition theorem and applications
par: Bostanci, John, et autres
Publié: (2023)

A Qubit, a Coin, and an Advice String Walk Into a Relational Problem
par: Aaronson, Scott, et autres
Publié: (2023)

Classical Simulability of Quantum Circuits with Shallow Magic Depth
par: Zhang, Yifan, et autres
Publié: (2024)

Quantum Complexity vs Classical Complexity: A Survey
par: Vaezi, Arash, et autres
Publié: (2023)

Pseudorandomness in the (Inverseless) Haar Random Oracle Model
par: Ananth, Prabhanjan, et autres
Publié: (2024)

Exponential Separation Criteria for Quantum Iterative Power Algorithms
par: Czégel, András, et autres
Publié: (2025)

Classically Spoofing System Linear Cross Entropy Score Benchmarking
par: Tanggara, Andrew, et autres
Publié: (2024)

A Lifting Theorem for Hybrid Classical-Quantum Communication Complexity
par: Wu, Xudong, et autres
Publié: (2025)

Lower Bounds on Relative Error Quantum Compression and Classical Shadows
par: Sankar, Kaushik
Publié: (2025)

Maximum Separation of Quantum Communication Complexity With and Without Shared Entanglement
par: Hasegawa, Atsuya, et autres
Publié: (2025)

Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams
par: Khadiev, Kamil, et autres
Publié: (2017)

Raising the Bar: An Asymptotic Comparison of Classical and Quantum Shortest Path Algorithms
par: Do, Phuc Hao, et autres
Publié: (2025)

Improved Quantum Query Upper Bounds Based on Classical Decision Trees
par: Cornelissen, Arjan, et autres
Publié: (2022)

Oracle Separation between Noisy Quantum Polynomial Time and the Polynomial Hierarchy
par: Chia, Nai-Hui, et autres
Publié: (2024)

Polynomial-Time Classical Simulation of Noisy Quantum Circuits with Naturally Fault-Tolerant Gates
par: Nelson, Jon, et autres
Publié: (2024)

An Exponential Separation Between Quantum and Quantum-Inspired Classical Algorithms for Linear Systems
par: Grønlund, Allan, et autres
Publié: (2024)

Classical Verification of Quantum Learning
par: Caro, Matthias C., et autres
Publié: (2023)

Quantum Pseudorandomness and Classical Complexity
par: Kretschmer, William
Publié: (2021)

Unitary Complexity and the Uhlmann Transformation Problem
par: Bostanci, John, et autres
Publié: (2023)

A Perfectly Distributable Quantum-Classical Algorithm for Estimating Triangular Balance in a Signed Edge Stream
par: Kordonowy, Steven, et autres
Publié: (2026)

Classically estimating observables of noiseless quantum circuits
par: Angrisani, Armando, et autres
Publié: (2024)

Semi-Classical Subspaces, The No Synchronization Law, and More
par: Epstein, Samuel
Publié: (2024)