Resource-efficient context-aware dynamical decoupling embedding for arbitrary large-scale quantum algorithms

Abstract

We introduce and implement GraphDD: an efficient method for real-time, circuit-specific, optimal embedding of dynamical decoupling (DD) into executable quantum algorithms. We demonstrate that for an arbitrary quantum circuit, GraphDD exactly refocuses both quasi-static single-qubit dephasing and crosstalk idling errors over the entire circuit, while using a minimal number of additional single-qubit gates embedded into idle periods. The method relies on a graph representation of the embedding problem, where the optimal decoupling sequence can be efficiently calculated using an algebraic computation that scales linearly with the number of idles. This allows optimal DD to be embedded during circuit compilation, without any calibration overhead, additional circuit execution, or numerical optimization. The method is generic and applicable to any arbitrary circuit; in compiler runtime the specific pulse-sequence solutions are tailored to the individual circuit, and consider a range of contextual information on circuit structure and device connectivity. We verify the ability of GraphDD to deliver enhanced circuit-level error suppression on 127-qubit IBM devices, showing that the optimal circuit-specific DD embedding resulting from GraphDD provides orders of magnitude improvements to measured circuit fidelities compared with standard embedding approaches available in Qiskit.

12 pages, 8 figures

References in corpus (26)

• Dynamical Decoupling of Open Quantum Systems
• Dynamical suppression of decoherence in two-state quantum systems
• Keeping a Quantum Bit Alive by Optimized $\pi$-Pulse Sequences
• Optimized Dynamical Decoupling in a Model Quantum Memory
• Demonstration of the trapped-ion quantum-CCD computer architecture
• Benchmarking an 11-qubit quantum computer
• Using Parity Kicks for Decoherence Control
• Robust dynamical decoupling for quantum computing and quantum memory
• Demonstration of fidelity improvement using dynamical decoupling with superconducting qubits
• Suppression of crosstalk in superconducting qubits using dynamical decoupling
• Dynamical decoupling for superconducting qubits: a performance survey
• Arbitrary quantum control of qubits in the presence of universal noise
• Reducing unitary and spectator errors in cross resonance with optimized rotary echoes
• Arbitrarily Accurate Pulse Sequences for Robust Dynamical Decoupling
• Robust Dynamic Hamiltonian Engineering of Many-Body Spin Systems
• Long-time Low-latency Quantum Memory by Dynamical Decoupling
• Demonstration of algorithmic quantum speedup
• Effects of Dynamical Decoupling and Pulse-level Optimizations on IBM Quantum Computers
• Keeping a Single Qubit Alive by Experimental Dynamic Decoupling
• Error-robust quantum logic optimization using a cloud quantum computer interface
• Reducing sequencing complexity in dynamical quantum error suppression by Walsh modulation
• Dynamical decoupling sequences for multi-qubit dephasing suppression and long-time quantum memory
• Experimental benchmarking of an automated deterministic error suppression workflow for quantum algorithms
• Optimized Dynamical Decoupling via Genetic Algorithms
• Synergistic Dynamical Decoupling and Circuit Design for Enhanced Algorithm Performance on Near-Term Quantum Devices
• Increasing the Measured Effective Quantum Volume with Zero Noise Extrapolation

Cited by in corpus (3)

• High-Fidelity Electron Spin Gates for Scaling Diamond Quantum Register
• Achieving computational gains with quantum error-correction primitives: Generation of long-range entanglement enhanced by error detection
• Color it, Code it, Cancel it: k-local dynamical decoupling from classical additive codes