QMA with Subset State Witnesses

DOI10.4086/cjtcs.2016.004zbMath1356.68081OpenAlexW2970305865MaRDI QIDQ2808530

Jamie Sikora, Alex Bredariol Grilo, Iordanis Kerenidis

Publication date: 24 May 2016

Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/cjtcs.2016.004

zbMATH Keywords

computational complexityquantum computation

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (3)

Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture ⋮ Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\) ⋮ QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge

Cites Work

• Proof verification and the hardness of approximation problems
• Probabilistic checking of proofs
• Two-Message Quantum Interactive Proofs Are in PSPACE
• Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: QMA with Subset State Witnesses