PSPACE has constant-round quantum interactive proof systems
From MaRDI portal
Publication:1870552
Recommendations
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 1072528 (Why is no real title available?)
- scientific article; zbMATH DE number 1775384 (Why is no real title available?)
- A proof of the security of quantum key distribution (extended abstract)
- A universal two-bit gate for quantum computation
- Algebraic methods for interactive proof systems
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Exponential separation of quantum and classical communication complexity
- Finite state verifiers I
- IP = PSPACE
- IP = SPACE
- Interactive proof systems with polynomially bounded strategies
- New Algorithms for Finding Irreducible Polynomials Over Finite Fields
- Non-deterministic exponential time has two-prover interactive protocols
- On the power of multi-prover interactive protocols
- PSPACE is provable by two provers in one round
- Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Probabilistic checking of proofs
- Quantum Computability
- Quantum computational networks
- Quantum cryptography: public key distribution and coin tossing
- The Knowledge Complexity of Interactive Proof Systems
Cited in
(24)- General Properties of Quantum Zero-Knowledge Proofs
- Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
- How to Verify a Quantum Computation
- New limits to classical and quantum instance compression
- Constant-space quantum interactive proofs against multiple provers
- On quantum interactive proofs with short messages
- STACS 2005
- Generalized quantum Arthur-Merlin games
- Quantum multi-prover interactive proof systems with limited prior entanglement.
- Stronger methods of making quantum interactive proofs perfectly complete
- Quantum information and the PCP theorem
- Rank-one quantum games
- Bidirectional controlled quantum teleportation and secure direct communication using five-qubit entangled state
- An application of quantum finite automata to interactive proof systems
- Quantum commitments from complexity assumptions
- Quantum entanglement as a new information processing resource
- Zero-knowledge proof systems for QMA
- Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata
- Quantum commitments from complexity assumptions
- Quantum interactive proofs with weak error bounds
- Bidirectional controlled teleportation by using nine-qubit entangled state in noisy environments
- Stronger methods of making quantum interactive proofs perfectly complete
- Interactive proofs with quantum finite automata
- PSPACE is provable by two provers in one round
This page was built for publication: PSPACE has constant-round quantum interactive proof systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1870552)
