Information Complexity of Quantum Gates
- 52 Downloads
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.
Key Wordsquantum gates quantum computing
Unable to display preview. Download preview PDF.
- Kak, S. (1998). Quantum information in a distributed apparatus. Foundations of Physics 28, 1005; Physics Archive: quant-ph/9804047Google Scholar
- Kak, S. (1999). The initialization problem in quantum computing. Foundations of Physics 29, 267–279; quant-ph/9805002.Google Scholar
- Kak, S. (2000). Rotating a qubit. Information Sciences 128, 149–154; quant-ph/9910107.Google Scholar
- Kak, S. (2001a). Statistical constraints on state preparation for a quantum computer. Pramana 57, 683–688; quant-ph/0010109.Google Scholar
- Kak, S. (2001b). Are quantum computing models realistic? Physics Arxiv: quant-ph/0110040.Google Scholar
- Kak, S. (2003a). General qubit errors cannot be corrected. Information Sciences 152, 195–202; quant-ph/0206144.Google Scholar
- Kak, S. (2003b). Teleportation protocols requiring only one classical bit. Physics Arxiv: quant-ph/0305085.Google Scholar
- Knill, E. (2004a). Fault tolerant post-selected quantum computation. Physics Arxiv: quant-ph/0404104.Google Scholar
- Knill, E. (2004b). Quantum computing with very noisy devices. Physics Arxiv: quant-ph/0410199.Google Scholar
- Nielsen, M. A. and Chuang, I. L. (2000). Quantum Computation and Quantum Information. Cambridge University Press.Google Scholar
- Svore, K., Terhal, B. M., and DiVincenzo, D. P. (2004). Local fault-tolerant quantum computation. Physics Arxiv: quant-ph/0410047.Google Scholar