Approximate quantum gates compiling with self-navigation algorithm

Abstract

The compiling of quantum gates is crucial for the successful quantum algorithm implementations. The environmental noise as well as the bandwidth of control pulses pose a challenge to precise and fast qubit control, especially in a weakly anharmonic system. In this work, we propose an algorithm to approximately compile single-qubit gates with arbitrary accuracy. Evaluation results show that the overall rotation distance generated by our algorithm is significantly shorter than the commonly used $U3$ gate, then the gate time can be effectively shortened. The requisite number of pulses and the runtime of scheme design scale up as $\mathcal{O}[\mathrm{Log}(1/\epsilon )]$ with very small prefactors, indicating low overhead costs. Moreover, we explore the trade-off between effectiveness and cost, and find a balance point. In short, our work opens a new avenue for efficient quantum algorithm implementations with contemporary quantum technology.

5 pages, 2 figures

References in corpus (14)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Charge insensitive qubit design derived from the Cooper pair box
• Quantum computational advantage using photons
• Strong quantum computational advantage using a superconducting quantum processor
• Simple pulses for elimination of leakage in weakly nonlinear qubits
• Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
• Superconducting Quantum Computing: A Review
• Quantum walks on a programmable two-dimensional 62-qubit superconducting processor
• Analytic control methods for high fidelity unitary operations in a weakly nonlinear oscillator
• Deep Reinforcement Learning for Quantum Gate Control
• Topological Quantum Compiling with Reinforcement Learning
• Classifying global state preparation via deep reinforcement learning
• Deep reinforcement learning for universal quantum state preparation via dynamic pulse control
• Universal quantum state preparation via revised greedy algorithm