Robust Error Accumulation Suppression for Quantum Circuits

Abstract

We present a \textit{robust error accumulation suppression} (\textbf{REAS}) technique to manage errors in quantum computers. Our method reduces the accumulation of errors in any quantum circuit composed of single- or two-qubit gates expressed as $e^{-i\sigma \theta }$ for Pauli operators $\sigma$ and $\theta \in [0,\pi )$, which forms a universal gate set. For coherent errors -- which include gate overrotation and crosstalk -- we demonstrate a reduction of the error scaling in an $L$-depth circuit from $O(L)$ to $O(\sqrt{L})$. This asymptotic error suppression behavior can be proven in a regime where all gates -- including those constituting the error-suppressing protocol itself -- are noisy. Going beyond coherent errors, we derive the general form of decoherence noise that can be suppressed by REAS. Lastly, we experimentally demonstrate the effectiveness of our approach regarding realistic errors using 100-qubit circuits with up to 64 two-qubit gate layers on IBM Quantum processors.

10 + 13 pages, 7 figures; close to published version

References in corpus (38)

• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Error mitigation for short-depth quantum circuits
• Quantum Error Correction for Quantum Memories
• Extending the computational reach of a noisy superconducting quantum processor
• Robust randomized benchmarking of quantum processes
• Quantum error correction below the surface code threshold
• The European Quantum Technologies Roadmap
• Efficient variational quantum simulator incorporating active error minimisation
• Quantum Error Mitigation
• Noise tailoring for scalable quantum computation via randomized compiling
• Practical Quantum Error Mitigation for Near-Future Applications
• Scalable error mitigation for noisy quantum circuits produces competitive expectation values
• Model-free readout-error mitigation for quantum expectation values
• Demonstration of non-Markovian process characterisation and control on a quantum processor
• Exponential Error Suppression for Near-Term Quantum Devices
• Reducing unitary and spectator errors in cross resonance with optimized rotary echoes
• Demonstrating Heisenberg-limited unambiguous phase estimation without adaptive measurements
• Efficient error models for fault-tolerant architectures and the Pauli twirling approximation
• Standard forms of noisy quantum operations via depolarization
• Non-Markovian Quantum Process Tomography
• Quantum-enhanced Markov chain Monte Carlo
• Generalized quantum subspace expansion
• Universal Sampling Lower Bounds for Quantum Error Mitigation
• Shorter gate sequences for quantum computing by mixing unitaries
• Universal cost bound of quantum error mitigation based on quantum estimation theory
• Distinguishing decoherence from alternative quantum theories by dynamical decoupling
• Partially Fault-tolerant Quantum Computing Architecture with Error-corrected Clifford Gates and Space-time Efficient Analog Rotations
• Experimental characterisation of a non-Markovian quantum process
• Randomized benchmarking for non-Markovian noise
• Efficiently improving the performance of noisy quantum computers
• Experimental Demonstration of Instrument-specific Quantum Memory Effects and Non-Markovian Process Recovery for Common-Cause Processes
• Demonstrating scalable randomized benchmarking of universal gate sets
• Synergetic quantum error mitigation by randomized compiling and zero-noise extrapolation for the variational quantum eigensolver
• Leveraging Randomized Compiling for the QITE Algorithm
• Filtering crosstalk from bath non-Markovianity via spacetime classical shadows
• Localized Virtual Purification
• Towards a general framework of Randomized Benchmarking incorporating non-Markovian Noise
• Probabilistic state synthesis based on optimal convex approximation