Space-bounded quantum interactive proof systems
From MaRDI portal
Cites work
- \(\mathsf{stateQIP} = \mathsf{stateSPACE}\)
- A complete characterization of unitary quantum space
- A multi-prover interactive proof for NEXP sound against entangled provers
- Algebraic methods for interactive proof systems
- An application of quantum finite automata to interactive proof systems
- Approximation algorithms and semidefinite programming.
- Delegating computation: interactive proofs for muggles
- Distributed quantum interactive proofs
- Distributed quantum proofs for replicated data
- Efficient interactive proofs for non-deterministic bounded space
- Efficient quantum state synthesis with one query
- Eliminating intermediate measurements in space-bounded Quantum computation
- Finite state verifiers I
- Generalized quantum Arthur-Merlin games
- scientific article; zbMATH DE number 5899305 (Why is no real title available?)
- scientific article; zbMATH DE number 4205986 (Why is no real title available?)
- scientific article; zbMATH DE number 512803 (Why is no real title available?)
- scientific article; zbMATH DE number 1776257 (Why is no real title available?)
- scientific article; zbMATH DE number 6820203 (Why is no real title available?)
- scientific article; zbMATH DE number 7829308 (Why is no real title available?)
- scientific article; zbMATH DE number 7829344 (Why is no real title available?)
- Interactive distributed proofs
- Interactive proof systems and alternating time-space complexity
- Interactive proof systems with polynomially bounded strategies
- Interactive proofs with quantum finite automata
- Inverting well conditioned matrices in quantum logspace
- IP = PSPACE
- Kolmogorov complexity characterizes statistical zero knowledge
- Limits on the power of quantum statistical zero-knowledge
- On quantum interactive proofs with short messages
- On the complexity of simulating space-bounded quantum computations
- On the power of quantum distributed proofs
- Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
- Properties that characterize LOGCFL
- PSPACE has constant-round quantum interactive proof systems
- QIP = PSPACE
- Quantum Arthur-Merlin games
- Quantum computation and quantum information. 10th anniversary edition
- Quantum interactive proofs with weak error bounds
- Quantum logspace algorithm for powering matrices with bounded norm
- Quantum logspace computations are verifiable
- Quantum proofs
- Quantum search-to-decision reductions and the state synthesis problem
- Quantum space, ground space traversal, and how to embed multi-prover interactive proofs into unentanglement
- Robustness for space-bounded statistical zero knowledge
- Space-bounded probabilistic game automata
- Space-bounded quantum complexity
- Streaming zero-knowledge proofs
- The Knowledge Complexity of Interactive Proof Systems
- The power of distributed verifiers in interactive proofs
- The space-time cost of purifying quantum computations
- Using entanglement in quantum multi-prover interactive proofs
- Zero-knowledge against quantum attacks
This page was built for publication: Space-bounded quantum interactive proof systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296767)
