Limits on the power of quantum statistical zero-knowledge

@article{Watrous2002LimitsOT,
  title={Limits on the power of quantum statistical zero-knowledge},
  author={John Watrous},
  journal={The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.},
  year={2002},
  pages={459-468}
}
  • J. Watrous
  • Published 16 November 2002
  • Computer Science, Mathematics
  • The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
In this paper we propose a definition for (honest verifier) quantum statistical zero-knowledge interactive proof systems and study the resulting complexity class, which we denote QSZK/sub HV/. We prove several facts regarding this class, including: the following problem is a complete promise problem for QSZKHV: given instructions for preparing two mixed quantum states, are the states close together or far apart in the trace norm metric? This problem is a quantum generalization of the complete… 

Figures from this paper

Non-Interactive Quantum Statistical and Perfect Zero-Knowledge
TLDR
The results may be the first non-trivial quantum zero- knowledge proofs secure even against dishonest quantum verifiers, since the protocols are non-interactive, and thus the zero-knowledge property does not depend on whether the verifier in the protocol is honest or not.
Increasing the power of the verifier in Quantum Zero Knowledge
TLDR
This paper studies what happens when an honest verifier is allowed to flip some coins in addition to using unitary operations, and shows that Quantum Statistical Zero Knowledge where the verifier applies any non-unitary operation is equal to Quantum Zero-Knowledge where theVerifier uses only unitaries.
Zero-knowledge against quantum attacks
  • J. Watrous
  • Mathematics, Computer Science
    STOC '06
  • 2006
TLDR
This paper proves that several interactive proof systems are zero-knowledge against general quantum attacks and establishes for the first time that true zero- knowledge is indeed possible in the presence of quantum information and computation.
Two-Message Quantum Interactive Proofs and the Quantum Separability Problem
TLDR
The quantum separability problem constitutes the first nontrivial promise problem decidable by a two-message quantum interactive proof system while being hard for both NP and QSZK.
Analysis of Quantum Multi-Prover Zero-Knowledge Systems: Elimination of the Honest Condition and Computational Zero-Knowledge Systems for QMIP
TLDR
The LHI protocol makes previous research for Local Hamiltonians applicable to check the history state of interactive proofs, and Broadbent et al.'s zero-knowledge protocol for QMA \cite{BJSW} to quantum multi-prover systems in order to obtain the second result.
Zero-knowledge against quantum attacks (Preliminary version)
TLDR
It is proved for the first time that true zero-knowledge is indeed possible in the presence of quantum information and that zero- knowledge proofs for every language in NP exist that are secure against quantum attacks.
Complete Problem for Perfect Zero-Knowledge Quantum Proof
  • Jun Yan
  • Computer Science, Mathematics
    SOFSEM
  • 2012
TLDR
This paper proves that (promise) problem Quantum State Identicalness (abbreviated QSI) is essentially complete for perfect zero-knowledge quantum interactive proof (QPZK).
Perfect Zero Knowledge for Quantum Multiprover Interactive Proofs
TLDR
The main result is that the two classes are equal, i.e., MIP* = PZK-MIP*.
On parallel composition of zero-knowledge proofs with black-box quantum simulators
TLDR
It is shown that the exis-tence of a black-box quantum simulator for such protocols when L ∉ BQP would imply an impossibly-good quantum search algorithm.
Zero-Knowledge Proof Systems for QMA
TLDR
This work proves that every problem in the complexity class QMA has a quantum interactive proof system that is zero-knowledge with respect to efficient quantum computations.
...
...

References

SHOWING 1-10 OF 41 REFERENCES
Comparing entropies in statistical zero knowledge with applications to the structure of SZK
  • Oded Goldreich, S. Vadhan
  • Mathematics, Computer Science
    Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317)
  • 1999
TLDR
An alternative proof of Okamoto's result by which HVSZK: (i.e., honest-verifier statistical zero knowledge) equals public-coin HVSzK is obtained, and an equivalence of a weak notion of statisticalzero knowledge to the standard one is obtained.
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
TLDR
It is proved that any polynomial-round quan tum interactiveProof system with two-sided bounded error can be parallelized to a quantum interactive proof system with exponentially small one-sided error, in which the prover and verifier exchange only 3 messages.
Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge
We show how to transform any interactive proof system which is statistical zero-knowledge with respect to the honest-verifier, into a proof system which is statistical zero-knowledgewith respect to
Quantum lower bounds by polynomials
TLDR
This work examines the number T of queries that a quantum network requires to compute several Boolean functions on {0,1}/sup N/ in the black-box model and gives asymptotically tight characterizations of T for all symmetric f in the exact, zero-error, and bounded-error settings.
Quantum circuits with mixed states
TLDR
A solution for the subroutine problem: the general function that a quantum circuit outputs is a probabilistic function, but using pure state language, such a function can not be used as a black box in other computations.
Exponential separation of quantum and classical communication complexity
  • R. Raz
  • Computer Science
    STOC '99
  • 1999
TLDR
It is shown that for certain communication complezity problems quantum communication protocols are exponentially faster than classical ores and an ezponential gap between quantum communication complexity and classical probabilistic communication complexity is given.
Quantum Computability
TLDR
It is shown that when quantum Turing machines are restricted to have transition amplitudes which are algebraic numbers, BQP, EQP, and nondeterministic quantum polynomial time (NQP) are all contained in PP, hence in P and PSPACE.
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
In this paper the generality and wide applicability of Zero-knowledge proofs, a notion introduced by Goldwasser, Micali, and Rackoff is demonstrated. These are probabilistic and interactive proofs
PSPACE has constant-round quantum interactive proof systems
  • J. Watrous
  • Computer Science, Mathematics
    40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
  • 1999
TLDR
It is proved that every language in PSPACE has a quantum interactive proof system that requires a total of only three messages to be sent between the prover and verifier and has exponentially small (one-sided) probability of error.
The complexity of perfect zero-knowledge
  • L. Fortnow
  • Computer Science, Mathematics
    Adv. Comput. Res.
  • 1989
TLDR
It is shown that knowledge complexity can be used to show that a language is easy to prove and that there are not any perfect zero-knowledge protocols for NP-complete languages unless the polynomial time hierarchy collapses.
...
...