Information Complexity of Quantum Gates

Abstract

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.

11 pages, 5 figures

References in corpus (4)

• Quantum Computing with Very Noisy Devices
• Local Fault-tolerant Quantum Computation
• Fault-Tolerant Postselected Quantum Computation: Schemes
• Teleportation Protocols Requiring Only One Classical Bit

Cited by in corpus (11)

• Quantum Information and Entropy
• Energy Requirement of Control: Comments on Szilard's Engine and Maxwell's Demon
• Neural Networks with Complex and Quaternion Inputs
• A Quasigroup Based Cryptographic System
• Difficulties in the Implementation of Quantum Computers
• The Basic Kak Neural Network with Complex Inputs
• Instantaneously Trained Neural Networks
• Implementing the Three-Stage Quantum Cryptography Protocol
• Information and Errors in Quantum Teleportation
• Information in Quantum Description and Gate Implementation
• State Decoding in Multi-Stage Cryptography Protocols