Imagen de Portada

En Route to a Standard QMA1 vs. QCMA Oracle Separation

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Miloschewsky, David, Podder, Supartha, Rudolph, Dorian
Formato:	Preprint
Publicado:	2026
Materias:	Quantum Physics Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

New Lower-bounds for Quantum Computation with Non-Collapsing Measurements
por: Miloschewsky, David, et al.
Publicado: (2024)

Modifications of Quantum Computation and Adaptive Queries to PP
por: Miloschewsky, David, et al.
Publicado: (2025)

Toward Separating QMA from QCMA with a Classical Oracle
por: Zhandry, Mark
Publicado: (2024)

Oracle separation of QMA and QCMA with bounded adaptivity
por: Ben-David, Shalev, et al.
Publicado: (2024)

QMA vs. QCMA and Pseudorandomness
por: Liu, Jiahui, et al.
Publicado: (2024)

Towards a universal gateset for $\mathsf{QMA}_1$
por: Rudolph, Dorian
Publicado: (2024)

Separating QMA from QCMA with a classical oracle
por: Bostanci, John, et al.
Publicado: (2025)

On the Approximate Non-Deterministic Degree of Total Boolean Functions
por: Pednekar, Samruddhi, et al.
Publicado: (2026)

Quantum 2-SAT on low dimensional systems is $\mathsf{QMA}_1$-complete: Direct embeddings and black-box simulation
por: Rudolph, Dorian, et al.
Publicado: (2024)

The Role of piracy in quantum proofs
por: Broadbent, Anne, et al.
Publicado: (2024)

Group Order is in QCMA
por: Gall, François Le, et al.
Publicado: (2025)

From Promises to Totality: A Framework for Ruling Out Quantum Speedups
por: Huffstutler, Thomas, et al.
Publicado: (2026)

Two bases suffice for QMA1-completeness
por: Ma, Henry, et al.
Publicado: (2025)

Oracle Separations for the Quantum-Classical Polynomial Hierarchy
por: Agarwal, Avantika, et al.
Publicado: (2024)

On the Complexity of Pure-State Consistency of Local Density Matrices
por: Kamminga, Jonas, et al.
Publicado: (2024)

On the Pure Quantum Polynomial Hierarchy and Quantified Hamiltonian Complexity
por: Grewal, Sabee, et al.
Publicado: (2025)

Superposition detection and QMA with non-collapsing measurements
por: Bassirian, Roozbeh, et al.
Publicado: (2024)

The rotation-invariant Hamiltonian problem is QMA$_{\rm EXP}$-complete
por: Nelson, Jon, et al.
Publicado: (2025)

Fermionic Independent Set and Laplacian of an independence complex are QMA-hard
por: Rayudu, Chaithanya
Publicado: (2024)

An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem
por: Aldi, Marco, et al.
Publicado: (2024)

Bounding the computational power of bosonic systems
por: Upreti, Varun, et al.
Publicado: (2025)

PDQMA = DQMA = NEXP: QMA With Hidden Variables and Non-collapsing Measurements
por: Aaronson, Scott, et al.
Publicado: (2024)

Quantum k-SAT Related Hypergraph Problems
por: Kremer, Simon-Luca, et al.
Publicado: (2025)

Oracle Separation between Noisy Quantum Polynomial Time and the Polynomial Hierarchy
por: Chia, Nai-Hui, et al.
Publicado: (2024)

Deciding Whether a C-Q Channel Preserves a Bit is QCMA-Complete
por: Hutton, Kiera, et al.
Publicado: (2025)

Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower bounds
por: Agarwal, Avantika, et al.
Publicado: (2024)

How hard is it to verify a classical shadow?
por: Karaiskos, Georgios, et al.
Publicado: (2025)

Classical vs Quantum Advice and Proofs under Classically-Accessible Oracle
por: Li, Xingjian, et al.
Publicado: (2023)

Quantum Interactive Oracle Proofs
por: Sun, Baocheng, et al.
Publicado: (2026)

A Cautionary Note on Quantum Oracles
por: Agarwal, Avantika, et al.
Publicado: (2025)

Separations in query complexity for total search problems
por: Ben-David, Shalev, et al.
Publicado: (2024)

A distribution testing oracle separation between QMA and QCMA
por: Natarajan, Anand, et al.
Publicado: (2022)

Qubit Routing for (Almost) Free
por: de Griend, Arianne Meijer-van
Publicado: (2026)

Pseudorandomness in the (Inverseless) Haar Random Oracle Model
por: Ananth, Prabhanjan, et al.
Publicado: (2024)

Separating Quantum and Classical Advice with Good Codes
por: Bostanci, John, et al.
Publicado: (2026)

Improved Circuit Lower Bounds and Quantum-Classical Separations
por: Grewal, Sabee, et al.
Publicado: (2024)

Coherence in Property Testing: Quantum-Classical Collapses and Separations
por: Jeronimo, Fernando Granha, et al.
Publicado: (2024)

Exponential Separation Criteria for Quantum Iterative Power Algorithms
por: Czégel, András, et al.
Publicado: (2025)

Maximum Separation of Quantum Communication Complexity With and Without Shared Entanglement
por: Hasegawa, Atsuya, et al.
Publicado: (2025)

Quantum versus Classical Separation in Simultaneous Number-on-Forehead Communication
por: Yang, Guangxu, et al.
Publicado: (2025)