On QMA protocols with two short quantum proofs

zbMATH Open1260.81048arXiv1108.4306MaRDI QIDQ2906789FDOQ2906789

Authors: François Le Gall, Shota Nakagawa, Harumichi Nishimura 

Publication date: 5 September 2012

Published in: Quantum Information \& Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1108.4306

Recommendations

• NP vs QMA\(_{\log}(2)\)
• Improved soundness for QMA with multiple provers
• The power of unentanglement
• Quantum Merlin-Arthur proof systems: are multiple Merlins more helpful to Arthur?
• Algorithms and Computation

zbMATH Keywords

entanglementquantum complexityQMA

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Quantum coherence, entanglement, quantum correlations (81P40)

Cited In (17)

• NP vs QMA\(_{\log}(2)\)
• Quantum Merlin-Arthur proof systems: are multiple Merlins more helpful to Arthur?
• Improved soundness for QMA with multiple provers
• Shorter unentangled proofs for ground state connectivity
• Limitations of semidefinite programs for separable states and entangled games
• Title not available (Why is that?)
• Quantum Arthur-Merlin games
• Quantum hedging in two-round prover-verifier interactions
• Quantum versus classical proofs and advice
• The power of unentanglement
• Epsilon-net method for optimizations over separable states
• The power of unentangled quantum proofs with non-negative amplitudes
• An improved semidefinite programming hierarchy for testing entanglement
• Quantum generalizations of the polynomial hierarchy with applications to QMA(2)
• Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\)
• Fast amplification of QMA
• Quantum interactive proofs and the complexity of separability testing

This page was built for publication: On QMA protocols with two short quantum proofs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906789)