The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
Quantum computation and quantum information
Quantum computation and quantum information
A complete problem for statistical zero knowledge
Journal of the ACM (JACM)
imits on the Power of Quantum Statistical Zero-Knowledge
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Image Density is Complete for Non-Interactive-SZK (Extended Abstract)
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Comparing Entropies in Statistical Zero Knowledge with Applications to the Structure of SZK
COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
Succinct quantum proofs for properties of finite groups
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Classical and Quantum Computation
Classical and Quantum Computation
On monotone function closure of perfect and statistical zero-knowledge
On monotone function closure of perfect and statistical zero-knowledge
A study of statistical zero-knowledge proofs
A study of statistical zero-knowledge proofs
Computational Complexity: A Conceptual Perspective
Computational Complexity: A Conceptual Perspective
Computational Complexity
On monotone formula closure of SZK
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Computational Complexity: A Modern Approach
Computational Complexity: A Modern Approach
Zero-Knowledge against Quantum Attacks
SIAM Journal on Computing
How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge
TCC'08 Proceedings of the 5th conference on Theory of cryptography
General properties of quantum zero-knowledge proofs
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Interactive and noninteractive zero knowledge are equivalent in the help model
TCC'08 Proceedings of the 5th conference on Theory of cryptography
| Hi-index | 0.00 |
The main purpose of this paper is to prove that (promise) problem Quantum State Identicalness (abbreviated QSI) is essentially complete for perfect zero-knowledge quantum interactive proof (QPZK). Loosely speaking, problem QSI is to decide whether two efficiently preparable quantum states (captured by quantum circuit of polynomial size) are identical or far apart (in trace distance). It is worthy noting that our result does not have classical counterpart yet; natural complete problem for perfect zero-knowledge interactive proof (PZK) is still unknown. Our proof generalizes Watrous' completeness proof for statistical zero-knowledge quantum interactive proof (QSZK), with an extra idea inspired by Malka to deal with completeness error. With complete problem at our disposal, we can immediately prove (and reprove) several interesting facts about QPZK.