Modularized and Scalable Compilation for Double Quantum Dot Quatum Computing
arXiv:2211.05300 · doi:10.1088/2058-9565/acfe38
Abstract
Any quantum program on a realistic quantum device must be compiled into an executable form while taking into account the underlying hardware constraints. Stringent restrictions on architecture and control imposed by physical platforms make this very challenging. In this paper, based on the quantum variational algorithm, we propose a novel scheme to train an Ansatz circuit and realize high-fidelity compilation of a set of universal quantum gates for singlet-triplet qubits in semiconductor double quantum dots, a fairly heavily constrained system. Furthermore, we propose a scalable architecture for a modular implementation of quantum programs in this constrained systems and validate its performance with two representative demonstrations, Grover's algorithm for the database searching (static compilation) and a variant of variational quantum eigensolver for the Max-Cut optimization (dynamic compilation). Our methods are potentially applicable to a wide range of physical devices. This work constitutes an important stepping-stone for exploiting the potential for advanced and complicated quantum algorithms on near-term devices.
10 pages, 4 figures
References in corpus (21)
- Ultracold atomic gases in optical lattices: mimicking condensed matter physics and beyond
- A Quantum Approximate Optimization Algorithm
- The ITensor Software Library for Tensor Network Calculations
- Demonstration of Entanglement of Electrostatically Coupled Singlet-Triplet Qubits
- Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
- Universal control of a six-qubit quantum processor in silicon
- Coherent spin manipulation in an exchange-only qubit
- Quantum error correction with silicon spin qubits
- Self-guided quantum tomography
- Observing ground-state properties of the Fermi-Hubbard model using a scalable algorithm on a quantum computer
- Noise-resistant control for a spin qubit array
- Topological Quantum Compiling with Reinforcement Learning
- Approaching the theoretical limit in quantum gate decomposition
- Implementation of the SMART protocol for global qubit control in silicon
- Classifying global state preparation via deep reinforcement learning
- Fabrication process and failure analysis for robust quantum dots in silicon
- Deep reinforcement learning for universal quantum state preparation via dynamic pulse control
- Efficient quantum gate decomposition via adaptive circuit compression
- Stochastic learning control of adiabatic speedup in a non-Markovian open qutrit system
- Universal quantum state preparation via revised greedy algorithm
- Fast high-fidelity geometric gates for singlet-triplet qubits