Image de couverture de livre

StoqMA vs. MA: the power of error reduction

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Aharonov, Dorit, Grilo, Alex B., Liu, Yupan
Format:	Preprint
Publié:	2020
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

Unentangled stoquastic Merlin-Arthur proof systems: the power of unentanglement without destructive interference
par: Liu, Yupan, et autres
Publié: (2026)

Syndrome aware mitigation of logical errors
par: Aharonov, Dorit, et autres
Publié: (2025)

On estimating the trace of quantum state powers
par: Liu, Yupan, et autres
Publié: (2024)

The Complexity of Stoquastic Sparse Hamiltonians
par: Grilo, Alex B., et autres
Publié: (2026)

Quantum state testing beyond the polarizing regime and quantum triangular discrimination
par: Liu, Yupan
Publié: (2023)

Computational hardness of estimating quantum entropies via binary entropy bounds
par: Liu, Yupan
Publié: (2026)

The Round Complexity of Proofs in the Bounded Quantum Storage Model
par: Grilo, Alex B., et autres
Publié: (2024)

Space-bounded quantum state testing via space-efficient quantum singular value transformation
par: Gall, François Le, et autres
Publié: (2023)

On estimating the quantum $\ell_α$ distance
par: Liu, Yupan, et autres
Publié: (2025)

Quantum Merlin-Arthur proof systems for synthesizing quantum states
par: Delavenne, Hugo, et autres
Publié: (2023)

Space-bounded quantum interactive proof systems
par: Gall, François Le, et autres
Publié: (2024)

The Power of Shallow-depth Toffoli and Qudit Quantum Circuits
par: Grilo, Alex Bredariol, et autres
Publié: (2024)

Computational complexity of the homology problem with orientable filtration: MA-completeness
par: Hayakawa, Ryu, et autres
Publié: (2025)

A slightly improved upper bound for quantum statistical zero-knowledge
par: Gall, François Le, et autres
Publié: (2025)

The Role of piracy in quantum proofs
par: Broadbent, Anne, et autres
Publié: (2024)

Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower bounds
par: Agarwal, Avantika, et autres
Publié: (2024)

QMA vs. QCMA and Pseudorandomness
par: Liu, Jiahui, et autres
Publié: (2024)

Peaked quantum advantage using error correction
par: Deshpande, Abhinav, et autres
Publié: (2025)

Finding quantum partial assignments by search-to-decision reductions
par: Weggemans, Jordi
Publié: (2024)

The power of quantum circuits in sampling
par: Blanc, Guy, et autres
Publié: (2025)

BQP, meet NP: Search-to-decision reductions and approximate counting
par: Gharibian, Sevag, et autres
Publié: (2024)

Non-signalling parallel repetition using de Finetti reductions
par: Arnon, Rotem, et autres
Publié: (2014)

On the Importance of Error Mitigation for Quantum Computation
par: Aharonov, Dorit, et autres
Publié: (2025)

Bounding the computational power of bosonic systems
par: Upreti, Varun, et autres
Publié: (2025)

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

En Route to a Standard QMA1 vs. QCMA Oracle Separation
par: Miloschewsky, David, et autres
Publié: (2026)

Hardness results for decoding the surface code with Pauli noise
par: Fischer, Alex, et autres
Publié: (2023)

Quantum SAT Problems with Finite Sets of Projectors are Complete for a Plethora of Classes
par: Cardoso, Ricardo Rivera, et autres
Publié: (2025)

Fast simulation of planar Clifford circuits
par: Gosset, David, et autres
Publié: (2020)

Magic and communication complexity
par: Girish, Uma, et autres
Publié: (2025)

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

Gap-preserving reductions and RE-completeness of independent set games
par: Mančinska, Laura, et autres
Publié: (2025)

Proper vs Improper Quantum PAC learning
par: Nayak, Ashwin, et autres
Publié: (2024)

Satisfiability of commutative vs. non-commutative CSPs
par: Bulatov, Andrei A., et autres
Publié: (2024)

Quantum state testing with restricted measurements
par: Liu, Yuhan, et autres
Publié: (2024)

Efficient approximate unitary designs from random Pauli rotations
par: Haah, Jeongwan, et autres
Publié: (2024)

Efficiently verifiable quantum advantage on near-term analog quantum simulators
par: Liu, Zhenning, et autres
Publié: (2024)

Pauli Measurements Are Near-Optimal for Single-Qubit Tomography
par: Acharya, Jayadev, et autres
Publié: (2025)

Polynomial-Time Classical Simulation of Noisy IQP Circuits with Constant Depth
par: Rajakumar, Joel, et autres
Publié: (2024)

New Quantum Algorithms for Computing Quantum Entropies and Distances
par: Wang, Qisheng, et autres
Publié: (2022)