Pulse-efficient circuit transpilation for quantum applications on cross-resonance-based hardware
arXiv:2105.01063 · doi:10.1103/PhysRevResearch.3.043088
Abstract
We show a pulse-efficient circuit transpilation framework for noisy quantum hardware. This is achieved by scaling cross-resonance pulses and exposing each pulse as a gate to remove redundant single-qubit operations with the transpiler.Crucially, no additional calibration is needed to yield better results than a CNOT-based transpilation. This pulse-efficient circuit transpilation therefore enables a better usage of the finite coherence time without requiring knowledge of pulse-level details from the user. As demonstration, we realize a continuous family of cross-resonance-based gates for SU(4) by leveraging Cartan's decomposition. We measure the benefits of a pulse-efficient circuit transpilation with process tomography and observe up to a 50% error reduction in the fidelity of RZZ(θ) and arbitrary SU(4) gates on IBM Quantum devices.We apply this framework for quantum applications by running circuits of the Quantum Approximate Optimization Algorithm applied to MAXCUT. For an 11 qubit non-hardware native graph, our methodology reduces the overall schedule duration by up to 52% and errors by up to 38%
References in corpus (8)
- Charge insensitive qubit design derived from the Cooper pair box
- A Quantum Approximate Optimization Algorithm
- Superconducting qubit in waveguide cavity with coherence time approaching 0.1ms
- Quantum Process Tomography: Resource Analysis of Different Strategies
- A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem
- Optimized Compilation of Aggregated Instructions for Realistic Quantum Computers
- An Introduction to Cartan's KAK Decomposition for QC Programmers
- Constructive Quantum Shannon Decomposition from Cartan Involutions
Cited by in corpus (23)
- Scalable error mitigation for noisy quantum circuits produces competitive expectation values
- Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware
- Quantum-enhanced Markov chain Monte Carlo
- Digitized-Counterdiabatic Quantum Algorithm for Protein Folding
- Universal qudit gate synthesis for transmons
- Constrained Quantum Optimization for Extractive Summarization on a Trapped-ion Quantum Computer
- Effects of Dynamical Decoupling and Pulse-level Optimizations on IBM Quantum Computers
- Error-Mitigated Simulation of Quantum Many-Body Scars on Quantum Computers with Pulse-Level Control
- Unravelling physics beyond the standard model with classical and quantum anomaly detection
- Ancilla-free implementation of generalized measurements for qubits embedded in a qudit space
- Efficient realization of quantum algorithms with qudits
- Well-conditioned multi-product formulas for hardware-friendly Hamiltonian simulation
- Minimum quantum run-time characterization and calibration via restless measurements with dynamic repetition rates
- Evaluation of Parameterized Quantum Circuits with Cross-Resonance Pulse-Driven Entanglers
- Pulse-efficient quantum machine learning
- PANSATZ: Pulse-based Ansatz for Variational Quantum Algorithms
- Explaining Quantum Circuits with Shapley Values: Towards Explainable Quantum Machine Learning
- Squeezing and quantum approximate optimization
- A SAT approach to the initial mapping problem in SWAP gate insertion for commuting gates
- Pulse-engineered Controlled-V gate and its applications on superconducting quantum device
- Optimal synthesis into fixed XX interactions
- Error suppression by a virtual two-qubit gate
- Parallel Driving for Fast Quantum Computing Under Speed Limits