Graph test of controllability in qubit arrays: A systematic way to determine the minimum number of external controls
arXiv:2212.04828 · doi:10.1088/2058-9565/ace1a4
Abstract
The ability to implement any desired quantum logic gate on a quantum processing unit is equivalent to evolution-operator controllability of the qubits. Conversely, controllability analysis can be used to minimize the resources, i.e., the number of external controls and qubit-qubit couplings, required for universal quantum computing. Standard controllability analysis, consisting in the construction of the dynamical Lie algebra, is, however, impractical already for a comparatively small number of qubits. Here, we show how to leverage an alternative approach, based on a graph representation of the Hamiltonian, to determine controllability of arrays of coupled qubits. We provide a complete computational framework and exemplify it for arrays of five qubits, inspired by the ibmq_quito architecture. We find that the number of controls can be reduced from five to one for complex qubit-qubit couplings and to two for standard qubit-qubit couplings.
arXiv comment18 pages, 7 figures, 3 tables, 3 algorithms
References in corpus (18)
- A Quantum Engineer's Guide to Superconducting Qubits
- Training Schrödinger's cat: quantum optimal control
- Quantum speed limits: from Heisenberg's uncertainty principle to optimal quantum control
- Complete controllability of quantum systems
- Parallel Entangling Operations on a Universal Ion Trap Quantum Computer
- Controllability of quantum mechanical systems by root space decomposition of su(N)
- Controllability of the discrete-spectrum Schrodinger equation driven by an external field
- Analysis of parametrically driven exchange-type (iSWAP) and two-photon (bSWAP) interactions between superconducting qubits
- Complete controllability of finite-level quantum systems
- Charting the circuit QED design landscape using optimal control theory
- A weak spectral condition for the controllability of the bilinear Schrödinger equation with application to the control of a rotating planar molecule
- Control by quantum dynamics on graphs
- Criteria for reachability of quantum states
- Symmetry & Controllability for Spin Networks with a Single-Node Control
- Symmetries on Spin Chains: Limited Controllability and Minimal Controls for Full Controllability
- Complete Controllability Despite Degeneracy: Quantum Control of Enantiomer-Specific State Transfer in Chiral Molecules
- Efficiently Controllable Graphs
- Lie algebra for rotational subsystems of a driven asymmetric top