Optimal quantum chain communication by end gates
arXiv:quant-ph/0610018 · doi:10.1103/PhysRevA.75.062327
Abstract
The scalability of solid state quantum computation relies on the ability of connecting the qubits to the macroscopic world. Quantum chains can be used as quantum wires to keep regions of external control at a distance. However even in the absence of external noise their transfer fidelity is too low to assure reliable connections. We propose a method of optimizing the fidelity by minimal usage of the available resources, consisting of applying a suitable sequence of two-qubit gates at the end of the chain. Our scheme allows also the preparation of states in the first excitation sector as well as cooling.
6 pages, 4 figures; improved version includes discussion on finitely many gate applications
References in corpus (13)
- Perfect Transfer of Arbitrary States in Quantum Spin Networks
- Distributed quantum computation via optical fibres
- Single-shot readout of electron spin states in a quantum dot using spin-dependent tunnel rates
- Mirror Inversion of Quantum States in Linear Registers
- The Propagation of Quantum Information Through a Spin System
- Spin Chains as Perfect Quantum State Mirrors
- Perfect quantum state transfer with randomly coupled quantum chains
- Perfect State Transfer: Beyond Nearest-Neighbor Couplings
- Quantum state transmission via a spin ladder as a robust data bus
- Electron wavepacket propagation and entanglement in a chain of coupled quantum dots
- From perfect to fractal transmission in spin chains
- Improved transfer of quantum information using a local memory
- Mesoscopic continuous and discrete channels for quantum information transfer
Cited by in corpus (6)
- Local controllability of quantum networks
- Fast, high fidelity information transmission through spin chain quantum wires
- Iterative quantum state transfer along a chain of nuclear spin qubits
- Quantum Data Bus in Dipolar Coupled Nuclear Spin Qubits
- Heisenberg chains cannot mirror a state
- High fidelity state transfer in binary tree spin networks