Quantum Control Theory for State Transformations: Dark States and their Enlightenment
arXiv:1003.4290 · doi:10.1103/PhysRevA.82.042322
Abstract
For many quantum information protocols such as state transfer, entanglement transfer and entanglement generation, standard notions of controllability for quantum systems are too strong. We introduce the weaker notion of accessible pairs, and prove an upper bound on the achievable fidelity of a transformation between a pair of states based on the symmetries of the system. A large class of spin networks is presented for which this bound can be saturated. In this context, we show how the inaccessible dark states for a given excitation-preserving evolution can be calculated, and illustrate how some of these can be accessed using extra catalytic excitations. This emphasises that it is not sufficient for analyses of state transfer in spin networks to restrict to the single excitation subspace. One class of symmetries in these spin networks is exactly characterised in terms of the underlying graph properties.
arXiv comment14 pages, 3 figures v3: rewritten for increased clarity
References in corpus (20)
- Perfect state transfer in quantum spin networks
- Reference frames, superselection rules, and quantum information
- Quantum Communication through Spin Chain Dynamics: an Introductory Overview
- A Review of Perfect State Transfer and its Application as a Constructive Tool
- Conclusive and arbitrarily perfect quantum state transfer using parallel spin chain channels
- Complete controllability of quantum systems
- Coupling strength estimation for spin chains despite restricted access
- Scalable quantum computation via local control of only two qubits
- Local controllability of quantum networks
- Indirect Hamiltonian Identification through a small gateway
- State Transfer and Spin Measurement
- Fast, high fidelity information transmission through spin chain quantum wires
- Control by quantum dynamics on graphs
- Implementation of Fault-tolerant Quantum Logic Gates via Optimal Control
- Graph State Preparation and Cluster Computation with Global Addressing of Optical Lattices
- Geometric Effects and Computation in Spin Networks
- Quantum Communication Through a Spin-Ring with Twisted Boundary Conditions
- Computation on Spin Chains with Limited Access
- Statics and Dynamics of Quantum XY and Heisenberg Systems on Graphs
- Identification of dynamical Lie algebras for finite-level quantum control systems
Cited by in corpus (12)
- Long quantum channels for high-quality entanglement transfer
- Perfect Quantum Routing in Regular Spin Networks
- The Basics of Perfect Communication through Quantum Networks
- Symmetry & Controllability for Spin Networks with a Single-Node Control
- Capacitively coupled double quantum dot system in the Kondo regime
- A coherent router for quantum networks
- Cospectrality preserving graph modifications and eigenvector properties via walk equivalence of vertices
- Chiral quantum router with Rydberg atoms
- How to Suppress Dark States in Quantum Networks and Bio-Engineered Structures
- Characterization and Control of Quantum Spin Chains and Rings
- Which weighted circulant networks have perfect state transfer?
- Incorporating Encoding into Quantum System Design