Pages that link to "Item:Q1870552"

The following pages link to PSPACE has constant-round quantum interactive proof systems (Q1870552):

Displaying 18 items.

• Quantum commitments from complexity assumptions (Q260394) (← links)
• Bidirectional controlled teleportation by using nine-qubit entangled state in noisy environments (Q264650) (← links)
• Bidirectional controlled quantum teleportation and secure direct communication using five-qubit entangled state (Q479379) (← links)
• Quantum information and the PCP theorem (Q835644) (← 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)
• Quantum entanglement as a new information processing resource (Q1880335) (← links)
• Constant-space quantum interactive proofs against multiple provers (Q2252642) (← links)
• Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata (Q2343133) (← links)
• Rank-one quantum games (Q2353189) (← links)
• Interactive proofs with quantum finite automata (Q2513604) (← 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)
• How to Verify a Quantum Computation (Q4568113) (← links)
• Generalized Quantum Arthur--Merlin Games (Q4634057) (← links)
• General Properties of Quantum Zero-Knowledge Proofs (Q5445501) (← links)
• Zero-knowledge proof systems for QMA (Q6663093) (← links)