Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
From MaRDI portal
Recommendations
Cited in
(37)- Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families
- An application of quantum finite automata to interactive proof systems
- Quantum multi-prover interactive proof systems with limited prior entanglement.
- Uniformity of quantum circuit families for error-free algorithms
- PSPACE has constant-round quantum interactive proof systems
- One complexity theorist's view of quantum computing
- Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\)
- Constant-space quantum interactive proofs against multiple provers
- Rank-one quantum games
- Quantum commitments from complexity assumptions
- Classical binding for quantum commitments
- Quantum interactive proofs with weak error bounds
- Complete Problem for Perfect Zero-Knowledge Quantum Proof
- Stronger methods of making quantum interactive proofs perfectly complete
- Quantum commitments from complexity assumptions
- New limits to classical and quantum instance compression
- Parallel approximation of min-max problems
- scientific article; zbMATH DE number 5568627 (Why is no real title available?)
- A quantum characterization of NP
- Generalized quantum Arthur-Merlin games
- scientific article; zbMATH DE number 6866233 (Why is no real title available?)
- Quantum generalizations of the polynomial hierarchy with applications to QMA(2)
- Nonlocal Games with Noisy Maximally Entangled States are Decidable
- General Properties of Quantum Zero-Knowledge Proofs
- Optimal quantum networks and one-shot entropies
- QMA-hardness of consistency of local density matrices with applications to quantum zero-knowledge
- Complexity limitations on one-turn quantum refereed games
- General properties of quantum bit commitments (extended abstract)
- Quantum interactive proofs using quantum energy teleportation
- Classical and quantum Merlin-Arthur automata
- The entangled quantum polynomial hierarchy collapses
- A classical proof system for quantum unsatisfiability, based on a matrix Nullstellensatz
- The black-box simulation barrier persists in a fully quantum world
- The round complexity of proofs in the bounded quantum storage model
- Quantum information and the PCP theorem
- Some geometric interpretations of quantum fidelity
- Perfect parallel repetition theorem for quantum XOR proof systems
This page was built for publication: Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192033)
