A Study On The Proof Of Quantum Knowledge Mutual Proof

Quantum computation is a new way of method of computation based on quantum theory performed on quantum computer. Based on the quantum theory to design of quantum algorithm, it is possible to go beyond the classical Turing machines on computation speed. Quantum computation and quantum communication is feasible in principle and will be fully implemented in physically. Nowadays, information security and more important, whether the use of quantum properties of cryptography can bring mankind better security, and whether traditional information technology also has a conventional security under quantum computation capacity, which is a problem we need to think. There is reason to believe that the classic quantum cryptography in the quantum attack is not safe, how to resist the same quantum mechanism caused by the quantum mechanical attack. For example, classical cryptography is a basic concept of zero-knowledge proof, only cryptographic protocols constructing by zero-knowledge proof can be considered safe. Then, extending the zero-knowledge proof to quantum case consider for the quantum zero knowledge proof, cryptographic protocols constructing by quantum zero knowledge proof may be able to meet our security needs.We use some concepts and tools of computational complexity theory to study of quantum zero-knowledge. Through the Angle of the observation of the verifier describes the definition of quantum zero knowledge proof. Re-understanding of the description of the definition of quantum zero-knowledge interactive proof, which will help us to discuss how they promote from the definition of classical cases and meet our intuitive understanding. Then we study the quantum multi-prover zero knowledge proof,by constructing a quantum multi-prover zero-knowledge interactive argument, and proved that the protocol of argument is a quantum multi-prover zero knowledge interactive proof. Implementation of the protocol is based on quantum mechanics, that is absolute security.