Pages that link to "Item:Q3192033"
From MaRDI portal
The following pages link to Parallelization, amplification, and exponential time simulation of quantum interactive proof systems (Q3192033):
Displaying 27 items.
- Quantum commitments from complexity assumptions (Q260394) (← links)
- Parallel approximation of min-max problems (Q354658) (← links)
- A quantum characterization of NP (Q445251) (← links)
- Quantum information and the PCP theorem (Q835644) (← links)
- Some geometric interpretations of quantum fidelity (Q890558) (← links)
- Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families (Q1009352) (← links)
- An application of quantum finite automata to interactive proof systems (Q1015813) (← links)
- Quantum multi-prover interactive proof systems with limited prior entanglement. (Q1401955) (← links)
- Uniformity of quantum circuit families for error-free algorithms (Q1770403) (← links)
- PSPACE has constant-round quantum interactive proof systems (Q1870552) (← links)
- One complexity theorist's view of quantum computing (Q1870556) (← links)
- Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\) (Q2087770) (← links)
- Constant-space quantum interactive proofs against multiple provers (Q2252642) (← links)
- Rank-one quantum games (Q2353189) (← links)
- Classical binding for quantum commitments (Q2695637) (← links)
- Complete Problem for Perfect Zero-Knowledge Quantum Proof (Q2891386) (← links)
- Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete (Q2954372) (← links)
- Quantum Commitments from Complexity Assumptions (Q3012793) (← links)
- New Limits to Classical and Quantum Instance Compression (Q3449566) (← links)
- Generalized Quantum Arthur--Merlin Games (Q4634057) (← links)
- (Q4637976) (← links)
- (Q5005160) (← links)
- Nonlocal Games with Noisy Maximally Entangled States are Decidable (Q5096445) (← links)
- General Properties of Quantum Zero-Knowledge Proofs (Q5445501) (← links)
- Optimal quantum networks and one-shot entropies (Q5855097) (← links)
- QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge (Q5868888) (← links)
- Complexity limitations on one-turn quantum refereed games (Q6038714) (← links)
