Scheduler of quantum circuits based on dynamical pattern improvement and its application to hardware design
arXiv:1912.00035
Abstract
As quantum hardware increases in complexity, successful algorithmic execution relies more heavily on awareness of existing device constraints. In this work we focus on the problem of routing quantum information across the machine to overcome the limited connectivity of quantum hardware. Previous approaches address the problem for each two-qubit gate separately and then impose the compatibility of the different routes. Here we shift the focus onto the set of all routing operations that are possible at any given time and favor those that most benefit the global pattern of two-qubit gates. We benchmark our optimization technique by scheduling variational algorithms for transmon chips. Finally we apply our scheduler to the design problem of quantifying the impact of manufacturing decisions. Specifically, we address the number of distinct qubit frequencies in superconducting architectures and how they affect the algorithmic performance of the quantum Fourier transform.
References in corpus (8)
- A Quantum Approximate Optimization Algorithm
- Demonstration of Two-Qubit Algorithms with a Superconducting Quantum Processor
- A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
- Efficient Simulation of Quantum Systems by Quantum Computers
- Quantum Process Tomography of a Universal Entangling Gate Implemented with Josephson Phase Qubits
- Scalable quantum circuit and control for a superconducting surface code
- A Software Methodology for Compiling Quantum Programs
- Advantages of a modular high-level quantum programming framework