Quantum Arthur-Merlin games
From MaRDI portal
Publication:814420
DOI10.1007/s00037-005-0194-xzbMath1085.68052OpenAlexW2100827027MaRDI QIDQ814420
Publication date: 7 February 2006
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00037-005-0194-x
quantum computationinteractive proof systemsArthur-Merlin gamesquantum complexity theoryquantum proofs
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (36)
Quantum de Finetti theorems under local measurements with applications ⋮ New multiplicativity results for qubit maps ⋮ Complete Problem for Perfect Zero-Knowledge Quantum Proof ⋮ Testing Quantum Circuits and Detecting Insecure Encryption ⋮ Approximate Degree in Classical and Quantum Computing ⋮ Parallel approximation of min-max problems ⋮ Constant-round blind classical verification of quantum sampling ⋮ QMA with Subset State Witnesses ⋮ Nonlocal Games with Noisy Maximally Entangled States are Decidable ⋮ Complexity limitations on one-turn quantum refereed games ⋮ Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete ⋮ Collusion resistant copy-protection for watermarkable functionalities ⋮ Total functions in QMA ⋮ Non-uniformity and quantum advice in the quantum random oracle model ⋮ Public key encryption with secure key leasing ⋮ Semantic embedding for quantum algorithms ⋮ Unnamed Item ⋮ EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS ⋮ A quantum characterization of NP ⋮ Shadow Tomography of Quantum States ⋮ Unnamed Item ⋮ A Complete Characterization of Unitary Quantum Space ⋮ Generalized Quantum Arthur--Merlin Games ⋮ Epsilon-net method for optimizations over separable states ⋮ Quantum Commitments from Complexity Assumptions ⋮ Quantum games: a review of the history, current state, and interpretation ⋮ Faithful squashed entanglement ⋮ Unnamed Item ⋮ Unnamed Item ⋮ General Properties of Quantum Zero-Knowledge Proofs ⋮ Quantum 3-SAT Is QMA$_1$-Complete ⋮ Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\) ⋮ Characterising the intersection of QMA and coQMA ⋮ Unnamed Item ⋮ QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge ⋮ Quantum commitments from complexity assumptions
This page was built for publication: Quantum Arthur-Merlin games
