Zero-knowledge proof systems for QMA

DOI10.1137/18M1193530MaRDI QIDQ6663093zbMATH OpenFDO

Authors Anne Broadbent, Zhengfeng Ji, Fang Song, John Watrous

Publication date 14 January 2025

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/18M1193530

zbMATH Keywords

local-Hamiltonian problemQMAquantum computationzero-knowledge

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94)

Recommendations

• QMA-hardness of consistency of local density matrices with applications to quantum zero-knowledge
• General Properties of Quantum Zero-Knowledge Proofs
• Certified everlasting zero-knowledge proof for QMA

Cites work

• A note on quantum security for post-quantum cryptography
• A Pseudorandom Generator from any One-way Function
• A single quantum cannot be cloned
• Actively secure two-party evaluation of any quantum operation
• Advances in Cryptology – CRYPTO 2004
• Bit commitment using pseudorandomness
• Coin flipping by telephone a protocol for solving impossible problems
• Compression of quantum multi-prover interactive proofs
• Consistency of Local Density Matrices Is QMA-Complete
• Definitions and properties of zero-knowledge proof systems
• Efficient algorithm for a quantum analogue of 2-SAT
• Fast amplification of QMA
• Foundations of Cryptography
• Foundations of Cryptography
• Fully simulatable quantum-secure coin-flipping and applications
• How to construct constant-round zero-knowledge proof systems for NP
• How to Verify a Quantum Computation
• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 6492476 (Why is no real title available?)
• scientific article; zbMATH DE number 4191106 (Why is no real title available?)
• scientific article; zbMATH DE number 5320237 (Why is no real title available?)
• scientific article; zbMATH DE number 1775384 (Why is no real title available?)
• scientific article; zbMATH DE number 1776257 (Why is no real title available?)
• scientific article; zbMATH DE number 2086396 (Why is no real title available?)
• scientific article; zbMATH DE number 4185024 (Why is no real title available?)
• Increasing the power of the verifier in quantum zero knowledge
• Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks
• Multiple-particle interference and quantum error correction
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• PSPACE has constant-round quantum interactive proof systems
• Quantum 3-SAT Is QMA₁-complete
• Quantum Arthur-Merlin games
• Quantum computations: algorithms and error correction
• Quantum one-time programs. (Extended abstract)
• Quantum proof systems for iterated exponential time, and beyond
• Quantum proofs of knowledge
• Quantum-Secure Coin-Flipping and Applications
• Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
• The Complexity of the Local Hamiltonian Problem
• The Heisenberg representation of quantum computers
• The Knowledge Complexity of Interactive Proof Systems

Cited in

(4)

• Spatial Isolation Implies Zero Knowledge Even in a Quantum World
• Quantum delegation with an off-the-shelf device
• Quantum pseudorandom scramblers
• Quantum pseudorandom scramblers

This page was built for publication: Zero-knowledge proof systems for QMA

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