Information Complexity of Quantum Gates

This paper considers the realizability of quantum gates from the perspective of information complexity. Since the gate is a physical device that must be controlled classically, it is subject to random error. We define the complexity of gate operation in terms of the difference between the entropy of the variables associated with initial and final states of the computation. We argue that the gate operations are irreversible if there is a difference in the accuracy associated with input and output variables. It is shown that under some conditions the gate operation may be associated with unbounded entropy, implying impossibility of implementation.

[1]  Subhash Kak Are Quantum Computing Models Realistic , 2001 .

[2]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[3]  Subhash C. Kak Rotating a qubit , 2000, Inf. Sci..

[4]  Subhash Kak Quantum Information in a Distributed Apparatus , 1998 .

[5]  E. Knill Fault-Tolerant Postselected Quantum Computation: Schemes , 2004, quant-ph/0402171.

[6]  A. Kitaev Quantum computations: algorithms and error correction , 1997 .

[7]  Subhash Kak The Initialization Problem in Quantum Computing , 1998 .

[8]  DiVincenzo Two-bit gates are universal for quantum computation. , 1994, Physical review. A, Atomic, molecular, and optical physics.

[9]  E. Knill Quantum Computing with Very Noisy Devices , 1998 .

[10]  E. Knill Quantum computing with realistically noisy devices , 2005, Nature.

[11]  Subhash C. Kak General qubit errors cannot be corrected , 2003, Inf. Sci..

[12]  R. Landauer,et al.  Irreversibility and heat generation in the computing process , 1961, IBM J. Res. Dev..

[13]  David P. DiVincenzo,et al.  Local fault-tolerant quantum computation , 2005 .

[14]  Charles H. Bennett,et al.  The thermodynamics of computation—a review , 1982 .

[15]  E. Knill,et al.  Theory of quantum error-correcting codes , 1997 .

[16]  Andrew M. Steane Efficient fault-tolerant quantum computing , 1999, Nature.

[17]  Viola,et al.  Theory of quantum error correction for general noise , 2000, Physical review letters.

[18]  Subhash Kak Teleportation Protocols Requiring Only One Classical Bit , 2003 .

[19]  Subhash Kak Statistical constraints on state preparation for a quantum computer , 2001 .

[20]  Raymond Laflamme,et al.  A Theory of Quantum Error-Correcting Codes , 1996 .