Quantum vs. classical proofs and subset verification

DOI10.4230/LIPICS.MFCS.2018.22OpenAlexW2962997396MaRDI QIDQ5005122FDOQ5005122

Authors: Bill Fefferman, Shelby Kimmel 

Publication date: 4 August 2021

Full work available at URL: https://arxiv.org/abs/1510.06750

Recommendations

• Quantum versus classical proofs and advice
• QMA with subset state witnesses
• Classical verification of quantum proofs
• Oracle separations between quantum and non-interactive zero-knowledge classes
• QMA with subset state witnesses

zbMATH Keywords

quantum complexity theoryquantum proofs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Quantum versus classical proofs and advice
• Quantum computations: algorithms and error correction
• Quantum lower bound for the collision problem
• Quantum lower bounds for the collision and the element distinctness problems
• Title not available (Why is that?)
• Sharp quantum versus classical query complexity separations
• Quantum algorithms for learning symmetric juntas via the adversary bound
• Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
• Quantum lower bounds by quantum arguments

Cited In (4)

• QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge
• Quantum versus classical proofs and advice
• The quantum adversary method and classical formula size power bounds
• Classical verification of quantum proofs

This page was built for publication: Quantum vs. classical proofs and subset verification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5005122)