Quantum deduction rules

Abstract We define propositional quantum Frege proof systems and compare them with classical Frege proof systems.

[1]  Richard J. Lipton,et al.  Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract) , 1995, CRYPTO.

[2]  Stephen A. Cook,et al.  The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.

[3]  Yaoyun Shi.  Both Toffoli and controlled-NOT need little help to do universal quantum computing , 2003, Quantum Inf. Comput..

[4]  Jan Krajicek.  Bounded Arithmetic, Propositional Logic, and Complexity Theory: Direct independence proofs , 1995 .

[5]  Michele Mosca,et al.  Exact quantum Fourier transforms and discrete logarithm algorithms , 2003 .

[6]  S. Aaronson.  Quantum computing and hidden variables , 2004, quant-ph/0408035.

[7]  Samuel R. Buss,et al.  Propositional Consistency Proofs , 1991, Ann. Pure Appl. Log..

[8]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[9]  Jan Krajícek,et al.  Bounded arithmetic, propositional logic, and complexity theory , 1995, Encyclopedia of mathematics and its applications.

[10]  Ran Raz,et al.  On Interpolation and Automatization for Frege Systems , 2000, SIAM J. Comput..

[11]  Jan Krajícek,et al.  Some Consequences of Cryptographical Conjectures for S12 and EF , 1998, Inf. Comput..

[12]  John Watrous,et al.  Succinct quantum proofs for properties of finite groups , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[13]  D. Aharonov.  A Simple Proof that Toffoli and Hadamard are Quantum Universal , 2003, quant-ph/0301040.