Variational quantum algorithms with invariant probabilistic error cancellation on noisy quantum processors
arXiv:2506.07039 · doi:10.1007/s11433-025-2779-x
Abstract
In the noisy intermediate-scale quantum era, emerging classical-quantum hybrid optimization algorithms, such as variational quantum algorithms (VQAs), can leverage the unique characteristics of quantum devices to accelerate computations tailored to specific problems with shallow circuits. However, these algorithms encounter biases and iteration difficulties due to significant noise in quantum processors. These difficulties can only be partially addressed without error correction by optimizing hardware, reducing circuit complexity, or fitting and extrapolation. A compelling solution is applying probabilistic error cancellation (PEC), a quantum error mitigation technique that enables unbiased results without full error correction. Traditional PEC is challenging to apply in VQAs due to its variance amplification, contradicting iterative process assumptions. This paper proposes a novel noise-adaptable strategy that combines PEC with the quantum approximate optimization algorithm (QAOA). It is implemented through invariant sampling circuits (invariant-PEC, or IPEC) and substantially reduces iteration variance. This strategy marks the first successful integration of PEC and QAOA, resulting in efficient convergence. Moreover, we introduce adaptive partial PEC (APPEC), which modulates the error cancellation proportion of IPEC during iteration. We experimentally validated this technique on a superconducting quantum processor, cutting sampling cost by 90.1\%. Notably, we find that dynamic adjustments of error levels via APPEC can enhance escape from local minima and reduce sampling costs. These results open promising avenues for executing VQAs with large-scale, low-noise quantum circuits, paving the way for practical quantum computing advancements.
27 pages, 16 figures
References in corpus (31)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum Machine Learning
- A variational eigenvalue solver on a quantum processor
- Variational Quantum Algorithms
- Quantum Simulation
- Quantum computational advantage using photons
- Barren plateaus in quantum neural network training landscapes
- Hybrid quantum circuits: Superconducting circuits interacting with other quantum systems
- Error mitigation for short-depth quantum circuits
- Trapped-Ion Quantum Computing: Progress and Challenges
- Atomic physics and quantum optics using superconducting circuits
- Strong quantum computational advantage using a superconducting quantum processor
- Towards Practical Quantum Variational Algorithms
- Quantum Error Mitigation
- Hybrid quantum-classical algorithms and quantum error mitigation
- Theory of variational quantum simulation
- Quantum-assisted quantum compiling
- Quantum Approximate Optimization Algorithm for MaxCut: A Fermionic View
- Probabilistic error cancellation with sparse Pauli-Lindblad models on noisy quantum processors
- Variational quantum simulation of general processes
- Variational Quantum Linear Solver
- Noise Resilience of Variational Quantum Compiling
- Variational algorithms for linear algebra
- Model-free readout-error mitigation for quantum expectation values
- Efficient error models for fault-tolerant architectures and the Pauli twirling approximation
- Error-Mitigated Quantum Gates Exceeding Physical Fidelities in a Trapped-Ion System
- Multi-exponential Error Extrapolation and Combining Error Mitigation Techniques for NISQ Applications
- Quantum approximate optimization via learning-based adaptive optimization
- Can Error Mitigation Improve Trainability of Noisy Variational Quantum Algorithms?
- The learnability of Pauli noise