Controlling qubit networks in polynomial time
arXiv:1710.02579 · doi:10.1103/PhysRevLett.120.220503
Abstract
Future quantum devices often rely on favourable scaling with respect to the system components. To achieve desirable scaling, it is therefore crucial to implement unitary transformations in an efficient manner. We develop an upper bound for the minimum time required to implement a unitary transformation on a generic qubit network in which each of the qubits is subject to local time dependent controls. The set of gates is characterized that can be implemented in a time that scales at most polynomially in the number of qubits. Furthermore, we show how qubit systems can be concatenated through controllable two body interactions, making it possible to implement the gate set efficiently on the combined system. Finally a system is identified for which the gate set can be implemented with fewer controls. The considered model is particularly important, since it describes electron-nuclear spin interactions in NV centers.
References in corpus (31)
- QuTiP: An open-source Python framework for the dynamics of open quantum systems
- Dynamical Decoupling of Open Quantum Systems
- Control of quantum phenomena: Past, present, and future
- Training Schrödinger's cat: quantum optimal control
- Simulating Hamiltonian dynamics with a truncated Taylor series
- Time Optimal Control in Spin Systems
- Universal Control of Decoupled Quantum Systems
- High fidelity spin entanglement using optimal control
- Quantum Brachistochrone
- A universal quantum circuit for two-qubit transformations with three CNOT gates
- Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space
- Polarization and readout of coupled single spins in diamond
- Sub-Riemannian Geometry and Time Optimal Control of Three Spin Systems: Quantum Gates and Coherence Transfer
- Driving at the quantum speed limit: Optimal control of a two-level system
- Optimal Control-Based Efficient Synthesis of Building Blocks of Quantum Algorithms Seen in Perspective from Network Complexity towards Time Complexity
- Universal quantum computation and simulation using any entangling Hamiltonian and local unitaries
- Optimal control, geometry, and quantum computing
- Simulation of interacting fermions with entanglement renormalization
- Scalable quantum computation via local control of only two qubits
- Speed limits for quantum gates in multi-qubit systems
- Symmetry Principles in Quantum Systems Theory
- Decoherence of a single-ion qubit immersed in a spin-polarized atomic bath
- Coupling of nitrogen vacancy centers in nanodiamonds by means of phonons
- Coherent control of two nuclear spins using the anisotropic hyperfine interaction
- Robust Entanglement in Anti-ferromagnetic Heisenberg Chains by Single-spin Optimal Control
- Symmetry criteria for quantum simulability of effective interactions
- Control of open quantum systems: Case study of the central spin model
- Optical Superradiance from Nuclear Spin Environment of Single Photon Emitters
- Linear and logarithmic time compositions of quantum many-body operators
- Singlet state creation and Universal quantum computation in NMR using Genetic Algorithm
- Efficiently Controllable Graphs
Cited by in corpus (11)
- From pulses to circuits and back again: A quantum optimal control perspective on variational quantum algorithms
- Lyapunov control-inspired strategies for quantum combinatorial optimization
- End-to-End Quantum Machine Learning Implemented with Controlled Quantum Dynamics
- Dependence of the Quantum Speed Limit on System Size and Control Complexity
- Amplification of quadratic Hamiltonians
- Combining the synergistic control capabilities of modelling and experiments: illustration of finding a minimum time quantum objective
- Feasibility of single-shot realizations of conditional three-qubit gates in exchange-coupled qubit arrays with local control
- Optimal control of interacting quantum systems based on the first-order Magnus approximation: Application to multiple dipole-dipole coupled molecular rotors
- Algorithmic Primitives for Quantum-Assisted Quantum Control
- An upper bound on the time required to implement unitary operations
- Harnessing subspace controllability: Dynamical generation of Dicke states in Heisenberg-coupled qubit arrays with a single local control