Robustness of quantum algorithms against coherent control errors
arXiv:2303.00618 · doi:10.1103/PhysRevA.109.012417
Abstract
Coherent control errors, for which ideal Hamiltonians are perturbed by unknown multiplicative noise terms, are a major obstacle for reliable quantum computing. In this paper, we present a framework for analyzing the robustness of quantum algorithms against coherent control errors using Lipschitz bounds. We derive worst-case fidelity bounds which show that the resilience against coherent control errors is mainly influenced by the norms of the Hamiltonians generating the individual gates. These bounds are explicitly computable even for large circuits, and they can be used to guarantee fault-tolerance via threshold theorems. Moreover, we apply our theoretical framework to derive a novel guideline for robust quantum algorithm design and transpilation, which amounts to reducing the norms of the Hamiltonians. Using the -qubit Quantum Fourier Transform as an example application, we demonstrate that this guideline targets robustness more effectively than existing ones based on circuit depth or gate count. Furthermore, we apply our framework to study the effect of parameter regularization in variational quantum algorithms. The practicality of the theoretical results is demonstrated via implementations in simulation and on a quantum computer.
References in corpus (38)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- A variational eigenvalue solver on a quantum processor
- Variational Quantum Algorithms
- Noisy intermediate-scale quantum (NISQ) algorithms
- Evaluating analytic gradients on quantum hardware
- The effect of data encoding on the expressive power of variational quantum machine learning models
- A simple formula for the average gate fidelity of a quantum dynamical operation
- Quantum Error Mitigation
- Demonstration of the trapped-ion quantum-CCD computer architecture
- Noise tailoring for scalable quantum computation via randomized compiling
- Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography
- Dynamically Error-Corrected Gates for Universal Quantum Computation
- Quantum Circuit Simplification and Level Compaction
- Arbitrarily accurate composite pulses
- Automated optimization of large quantum circuits with continuous parameters
- Stochastic gradient descent for hybrid quantum-classical optimization
- Gate Set Tomography
- Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
- Estimating the Coherence of Noise
- Review of Decoherence Free Subspaces, Noiseless Subsystems, and Dynamical Decoupling
- Randomized Benchmarking with Confidence
- Fundamental limits of quantum error mitigation
- Correcting coherent errors with surface codes
- Comparing Experiments to the Fault-Tolerance Threshold
- Simplified instantaneous non-local quantum computation with applications to position-based cryptography
- Robust Ising Gates for Practical Quantum Computation
- Hybrid quantum linear equation algorithm and its experimental test on IBM Quantum Experience
- Simulating the performance of a distance-3 surface code in a linear ion trap
- Using models to improve optimizers for variational quantum algorithms
- On the CNOT-complexity of CNOT-PHASE circuits
- Distance Bounds on Quantum Dynamics
- Quantum State Tomography of a Single Qubit: Comparison of Methods
- Real-time calibration with spectator qubits
- Hidden Inverses: Coherent Error Cancellation at the Circuit Level
- Quantum error correction failure distributions: comparison of coherent and stochastic error models
- Stabilizer Slicing: Coherent Error Cancellations in LDPC Codes
- Dynamically corrected gates suppress spatio-temporal error correlations as measured by randomized benchmarking
Cited by in corpus (10)
- Training robust and generalizable quantum models
- Impact of decoherence on the fidelity of quantum gates leaving the computational subspace
- Quantum computing through the lens of control: A tutorial introduction
- Dissipative variational quantum algorithms for Gibbs state preparation
- Tsallis relative entropy of coherence dynamics in Grover's search algorithm
- Characterization of coherent errors in gate layers with robustness to Pauli noise
- Quantum tensor network algorithms for evaluation of spectral functions on quantum computers
- Density Matrix-based Dynamics for Quantum Robotic Swarms
- State convertibility under genuinely incoherent operations
- Resilience-Runtime Tradeoff Relations for Quantum Algorithms