Control by quantum dynamics on graphs
arXiv:0910.5397 · doi:10.1103/PhysRevA.81.052316
Abstract
We address the study of controllability of a closed quantum system whose dynamical Lie algebra is generated by adjacency matrices of graphs. We characterize a large family of graphs that renders a system controllable. The key property is a novel graph-theoretic feature consisting of a particularly disordered cycle structure. Disregarding efficiency of control functions, but choosing subfamilies of sparse graphs, the results translate into continuous-time quantum walks for universal computation.
5 pages, 1 figure
References in corpus (13)
- Universal computation by quantum walk
- Realization of quantum walks with negligible decoherence in waveguide lattices
- Quantum Communication through Spin Chain Dynamics: an Introductory Overview
- Full control by locally induced relaxation
- Robust optimal quantum gates for Josephson charge qubits
- Local controllability of quantum networks
- State Transfer and Spin Measurement
- Quantum simulators, continuous-time automata, and translationally invariant systems
- Universal quantum interfaces
- Global controllability with a single local actuator
- Computation on Spin Chains with Limited Access
- Statics and Dynamics of Quantum XY and Heisenberg Systems on Graphs
- Universal quantum walks and adiabatic algorithms by 1D Hamiltonians
Cited by in corpus (15)
- Zero forcing sets and controllability of dynamical systems defined on graphs
- Number-Theoretic Nature of Communication in Quantum Spin Systems
- Zero forcing, linear and quantum controllability for systems evolving on networks
- Quantum Transport Enhancement by Time-Reversal Symmetry Breaking
- Universal quantum computation by discontinuous quantum walk
- Approximate entropy of network parameters
- Quantum Control Theory for State Transformations: Dark States and their Enlightenment
- Efficiently Controllable Graphs
- Lie algebra for rotational subsystems of a driven asymmetric top
- Controllable Subsets in Graphs
- Graph test of controllability in qubit arrays: A systematic way to determine the minimum number of external controls
- How to Suppress Dark States in Quantum Networks and Bio-Engineered Structures
- Perfect State Transfer in Laplacian Quantum Walk
- An exact algorithm for the minimum rank of a graph
- State Transfer on Graphs