Strictly contractive quantum channels and physically realizable quantum computers
arXiv:quant-ph/0105141 · doi:10.1103/PhysRevA.65.032306
Abstract
We study the robustness of quantum computers under the influence of errors modelled by strictly contractive channels. A channel is defined to be strictly contractive if, for any pair of density operators in its domain, for some (here denotes the trace norm). In other words, strictly contractive channels render the states of the computer less distinguishable in the sense of quantum detection theory. Starting from the premise that all experimental procedures can be carried out with finite precision, we argue that there exists a physically meaningful connection between strictly contractive channels and errors in physically realizable quantum computers. We show that, in the absence of error correction, sensitivity of quantum memories and computers to strictly contractive errors grows exponentially with storage time and computation time respectively, and depends only on the constant and the measurement precision. We prove that strict contractivity rules out the possibility of perfect error correction, and give an argument that approximate error correction, which covers previous work on fault-tolerant quantum computation as a special case, is possible.
14 pages; revtex, amsfonts, amssymb; made some changes (recommended by Phys. Rev. A), updated the references
References in corpus (19)
- Quantum Mechanics helps in searching for a needle in a haystack
- Elementary gates for quantum computation
- Persistent entanglement in arrays of interacting particles
- Decoherence Free Subspaces for Quantum Computation
- Encoding a qubit in an oscillator
- Noiseless Quantum Codes
- Reliable Quantum Computers
- Quantum Computers and Dissipation
- A Theory of Quantum Error-Correcting Codes
- Maintaining coherence in Quantum Computers
- Using entanglement improves precision of quantum measurements
- Stabilizing Quantum Information
- Finite precision measurement nullifies the Kochen-Specker theorem
- Robustness of Decoherence-Free Subspaces for Quantum Computation
- A fidelity measure for quantum channels
- Quantum entanglement and classical communication through a depolarising channel
- Subdecoherent Information Encoding in a Quantum-Dot Array
- Ergodicity of quantum cellular automata
- Lower Bounds for Attainable Fidelity in Entanglement Purification
Cited by in corpus (25)
- Quantum channels and memory effects
- Full control by locally induced relaxation
- Fully quantum fluctuation theorems
- Quantum MERA Channels
- Ergodic and Mixing Quantum Channels in Finite Dimensions
- The Generalized Lyapunov Theorem and its Application to Quantum Channels
- De Sitter Space as a Tensor Network: Cosmic No-Hair, Complementarity, and Complexity
- Asymptotics of quantum channels: conserved quantities, an adiabatic limit, and matrix product states
- Quantum Information Encoding, Protection, and Correction from Trace-Norm Isometries
- A scheme for entanglement extraction from a solid
- Homogeneous MERA states: an information theoretical analysis
- Single-shot discrimination of quantum unitary processes
- Dependence of integrated, instantaneous, and fluctuating entropy production on the initial state in quantum and classical processes
- Interpreting quantum coherence through a quantum measurement process
- Emergence of noise-induced barren plateaus in arbitrary layered noise models
- Entropy production rates of bistochastic strictly contractive quantum channels on a matrix algebra
- Spectral Properties of Tensor Products of Channels
- A lower bound on the space overhead of fault-tolerant quantum computation
- Communication Through a Quantum Link
- Bures Contractive Channels on Operator Algebras
- Role of correlations in the thermalization of quantum systems
- Dynamical Aspects of Information Storage in Quantum-Mechanical Systems
- Reality, Causality, and Quantum Theory
- Estimates of loss function concentration in noisy parametrized quantum circuits
- Information storage and transmission under Markovian noise