QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge
From MaRDI portal
Publication:5868888
DOI10.1137/21M140729XzbMath1495.68086arXiv1911.07782WikidataQ114074073 ScholiaQ114074073MaRDI QIDQ5868888
Anne Broadbent, Alex Bredariol Grilo
Publication date: 24 September 2022
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.07782
Cryptography (94A60) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (4)
Certified everlasting zero-knowledge proof for QMA ⋮ Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round ⋮ Classically verifiable NIZK for QMA with preprocessing ⋮ The round complexity of quantum zero-knowledge
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum Arthur-Merlin games
- Correlation polytopes: Their geometry and complexity
- Definitions and properties of zero-knowledge proof systems
- Non-interactive zero-knowledge arguments for QMA, with preprocessing
- Non-interactive classical verification of quantum computation
- Aurora: transparent succinct arguments for R1CS
- Verifier-on-a-leash: new schemes for verifiable delegated quantum computation, with quasilinear resources
- Revisiting post-quantum Fiat-Shamir
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- Complexity Classification of Local Hamiltonian Problems
- QMA with Subset State Witnesses
- Quantum Proofs of Knowledge
- Zero-knowledge against quantum attacks
- Quantum money from hidden subspaces
- Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
- Consistency of Local Density Matrices Is QMA-Complete
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The Knowledge Complexity of Interactive Proof Systems
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Generalized Quantum Arthur--Merlin Games
- Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
- A quantum linearity test for robustly verifying entanglement
- Reducibility among Combinatorial Problems
- Quantum vs Classical Proofs and Subset Verification
- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
- Post-quantum zero knowledge in constant rounds
- How Many Copies are Needed for State Discrimination?
- Zero Knowledge and Soundness Are Symmetric
- Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model
- Unconditional Characterizations of Non-interactive Zero-Knowledge
- The Complexity of Zero Knowledge
- The Complexity of the Local Hamiltonian Problem
This page was built for publication: QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge
