Image de couverture de livre

Quantum Merlin-Arthur proof systems for synthesizing quantum states

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Delavenne, Hugo, Gall, François Le, Liu, Yupan, Miyamoto, Masayuki
Format:	Preprint
Publié:	2023
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)

Quantum State Synthesis: Relation with Decision Complexity Classes and Impossibility of Synthesis Error Reduction
par: Delavenne, Hugo, et autres
Publié: (2024)

Space-bounded quantum interactive proof systems
par: Gall, François Le, 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)

Quantum Merlin-Arthur with an internally separable proof
par: Bassirian, Roozbeh, et autres
Publié: (2024)

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

Classical versus quantum queries in quantum PCPs with classical proofs
par: Buhrman, Harry, et autres
Publié: (2024)

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

Classical and quantum Merlin-Arthur automata
par: Yakaryılmaz, Abuzer
Publié: (2022)

The Collapse of Unentangled Stoquastic Merlin-Arthur Proof Systems
par: Gay, William, et autres
Publié: (2026)

Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture
par: Gharibian, Sevag, et autres
Publié: (2021)

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

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

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

Classical simulability of quantum circuits followed by sparse classical post-processing
par: Takahashi, Yasuhiro, et autres
Publié: (2026)

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

Dequantizing Short-Path Quantum Algorithms
par: Gall, François Le, et autres
Publié: (2026)

Classical Algorithms for Constant Approximation of the Ground State Energy of Local Hamiltonians
par: Gall, François Le
Publié: (2024)

Does there exist a quantum fingerprinting protocol without coherent measurements?
par: Hasegawa, Atsuya, et autres
Publié: (2025)

Beating the natural Grover bound for low-energy estimation and state preparation
par: Buhrman, Harry, et autres
Publié: (2024)

Multi-Prover Interactive Proof Systems with Leakage
par: Asadi, Vahid R., et autres
Publié: (2026)

An Entropy-Governed Speedup for Quantum Algorithms on Local Hamiltonians
par: Mataraarachchi, Ranitha, et autres
Publié: (2026)

StoqMA vs. MA: the power of error reduction
par: Aharonov, Dorit, et autres
Publié: (2020)

Group Order is in QCMA
par: Gall, François Le, et autres
Publié: (2025)

Dequantization and Hardness of Spectral Sum Estimation
par: Edenhofer, Roman, et autres
Publié: (2025)

Fine-Grained Complexity for Quantum Problems from Size-Preserving Circuit-to-Hamiltonian Constructions
par: Chia, Nai-Hui, et autres
Publié: (2026)

Collapses in quantum-classical probabilistically checkable proofs and the quantum polynomial hierarchy
par: Anand, Kartik, et autres
Publié: (2025)

Improved Hardness Results for the Guided Local Hamiltonian Problem
par: Cade, Chris, et autres
Publié: (2022)

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

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

Quasi-quantum states and the quasi-quantum PCP theorem
par: Arad, Itai, et autres
Publié: (2024)

Pseudo-deterministic Quantum Algorithms
par: Aaronson, Hugo, et autres
Publié: (2026)

Quantum state isomorphism problems for groups
par: Gheorghiu, Alexandru, et autres
Publié: (2026)

Quantum-proof multi-source randomness extractors in the Markov model
par: Arnon, Rotem, et autres
Publié: (2015)

Learning junta distributions, quantum junta states, and QAC$^0$ circuits
par: Bao, Jinge, et autres
Publié: (2024)

Learning stabilizer structure of quantum states
par: Arunachalam, Srinivasan, et autres
Publié: (2025)

Quantum interactive proofs using quantum energy teleportation
par: Ikeda, Kazuki, et autres
Publié: (2023)

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

An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem
par: Aldi, Marco, et autres
Publié: (2024)

Distributed Quantum Advantage for Local Problems
par: Balliu, Alkida, et autres
Publié: (2024)