Efficient Hamiltonian programming in qubit arrays with nearest-neighbour couplings

Abstract

We consider the problem of selectively controlling couplings in a practical quantum processor with always-on interactions that are diagonal in the computational basis, using sequences of local NOT gates. This methodology is well-known in NMR implementations, but previous approaches do not scale efficiently for the general fully-connected Hamiltonian, where the complexity of finding time-optimal solutions makes them only practical up to a few tens of qubits. Given the rapid growth in the number of qubits in cutting-edge quantum processors, it is of interest to investigate the applicability of this control scheme to much larger scale systems with realistic restrictions on connectivity. Here we present an efficient scheme to find near time-optimal solutions that can be applied to engineered qubit arrays with local connectivity for any number of qubits, indicating the potential for practical quantum computing in such systems.

arXiv comment5 pages, 5 figures. Shortened and clarified from previous version

References in corpus (25)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Elementary gates for quantum computation
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• A Quantum Approximate Optimization Algorithm
• Error mitigation for short-depth quantum circuits
• Demonstration of Two-Qubit Algorithms with a Superconducting Quantum Processor
• Extending the computational reach of a noisy superconducting quantum processor
• Efficient variational quantum simulator incorporating active error minimisation
• Building logical qubits in a superconducting quantum computing system
• Qubit architecture with high coherence and fast tunable coupling
• Nuclear magnetic resonance spectroscopy: An experimentally accessible paradigm for quantum computing
• Suppression of Qubit Crosstalk in a Tunable Coupling Superconducting Circuit
• Bang-bang control of fullerene qubits using ultra-fast phase gates
• Quantum Computing with an 'Always On' Heisenberg Interaction
• Efficient Refocussing of One Spin and Two Spin Interactions for NMR Quantum Computation
• Digital-Analog Quantum Computation
• Efficient implementation of selective recoupling in heteronuclear spin systems using Hadamard matrices
• Quantum computation with un-tunable couplings
• Scalable design of tailored soft pulses for coherent control
• Universal set of scalable dynamically corrected gates for quantum error correction with always-on qubit couplings
• Modelling Enclosures for Large-Scale Superconducting Quantum Circuits
• Dynamically corrected gates for qubits with always-on Ising couplings: Error model and fault-tolerance with the toric code
• Rescaling interactions for quantum control
• Scalable quantum computation architecture using always-on Ising interactions via quantum feedforward

Cited by in corpus (6)

• Scalable and robust quantum computing on qubit arrays with fixed coupling
• Parallel detection and spatial mapping of large nuclear spin clusters
• Controlling NMR spin systems for quantum computation
• Universal quantum processors in spin systems via robust local pulse sequences
• General, efficient, and robust Hamiltonian engineering
• Efficient Chromatic-Number-Based Multi-Qubit Decoherence and Crosstalk Suppression