Accelerating Quantum Optimal Control of Multi-Qubit Systems with Symmetry-Based Hamiltonian Transformations

Abstract

We present a novel, computationally efficient approach to accelerate quantum optimal control calculations of large multi-qubit systems used in a variety of quantum computing applications. By leveraging the intrinsic symmetry of finite groups, the Hilbert space can be decomposed and the Hamiltonians block-diagonalized to enable extremely fast quantum optimal control calculations. Our approach reduces the Hamiltonian size of an $n$-qubit system from 2^n by 2^n to O(n by n) or O((2^n / n) by (2^n / n)) under Sn or Dn symmetry, respectively. Most importantly, this approach reduces the computational runtime of qubit optimal control calculations by orders of magnitude while maintaining the same accuracy as the conventional method. As prospective applications, we show that (1) symmetry-protected subspaces can be potential platforms for quantum error suppression and simulation of other quantum Hamiltonians, and (2) Lie-Trotter-Suzuki decomposition approaches can generalize our method to a general variety of multi-qubit systems.

arXiv comment15 pages, 5 figures. This article may be downloaded for personal use only. Any other use requires prior permission of the author and AIP Publishing. This article appeared in AVS Quantum Science and may be found at https://doi.org/10.1116/5.0162455. Find the PDF of the Supplementary Material in the source files

References in corpus (20)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum cryptography: Public key distribution and coin tossing
• Surface codes: Towards practical large-scale quantum computation
• Experimental loophole-free violation of a Bell inequality using entangled electron spins separated by 1.3 km
• 14-qubit entanglement: creation and coherence
• Suppressing quantum errors by scaling a surface code logical qubit
• Quantum Phases of Matter on a 256-Atom Programmable Quantum Simulator
• Engineered 2D Ising interactions on a trapped-ion quantum simulator with hundreds of spins
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Building logical qubits in a superconducting quantum computing system
• A 10-qubit solid-state spin register with quantum memory up to one minute
• Chopped random-basis quantum optimization
• Observation of multi-component atomic Schrödinger cat states of up to 20 qubits
• Nearly optimal lattice simulation by product formulas
• Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms
• Speedup for quantum optimal control from automatic differentiation based on graphics processing units
• Optimized Lie-Trotter-Suzuki decompositions for two and three non-commuting terms
• Preparing Greenberger-Horne-Zeilinger and $W$ states on a long-range Ising spin model by global controls
• Controllability of Symmetric Spin Networks
• Memory-Efficient Differentiable Programming for Quantum Optimal Control of Discrete Lattices

Cited by in corpus (2)

• Discrete time quantum walk of locally interacting walkers
• Global optimization in variational quantum algorithms via dynamic tunneling method