Direct entanglement ansatz learning (DEAL) with ZNE on error-prone superconducting qubits
arXiv:2504.04021 · doi:10.1109/QCE65121.2025.10343
Abstract
Quantum combinatorial optimization algorithms typically face challenges due to complex optimization landscapes featuring numerous local minima, exponentially scaling latent spaces, and susceptibility to quantum hardware noise. In this study, we introduce Direct Entanglement Ansatz Learning (DEAL), wherein we employ a direct mapping from quadratic unconstrained binary problem parameters to quantum ansatz angles for cost and mixer hamiltonians, which improves the convergence rate towards the optimal solution. Our approach exploits a quantum entanglement-based ansatz to effectively explore intricate latent spaces and zero noise extrapolation (ZNE) to greatly mitigate the randomness caused by crosstalk and coherence errors. Our experimental evaluation demonstrates that DEAL increases the success rate by up to 14% compared to the classic quantum approximation optimization algorithm while also controlling the error variance. In addition, we demonstrate the capability of DEAL to provide near optimum ground energy solutions for travelling salesman, knapsack, and maxcut problems, which facilitates novel paradigms for solving relevant NP-hard problems and extends the practical applicability of quantum optimization using noisy quantum hardware.
References in corpus (16)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Variational Quantum Algorithms
- Barren plateaus in quantum neural network training landscapes
- Error mitigation for short-depth quantum circuits
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
- Quantum circuit architecture search for variational quantum algorithms
- Digital zero noise extrapolation for quantum error mitigation
- Quantum annealing initialization of the quantum approximate optimization algorithm
- 64-Qubit Quantum Circuit Simulation
- Operation and intrinsic error budget of a two-qubit cross-resonance gate
- Constructing a virtual two-qubit gate by sampling single-qubit operations
- Fast universal quantum gates on microwave photons with all-resonance operations in circuit QED
- Parameter Setting in Quantum Approximate Optimization of Weighted Problems
- Beyond NISQ: The Megaquop Machine
- Readout error mitigated quantum state tomography tested on superconducting qubits
- Digitized Counterdiabatic Quantum Algorithms for Logistics Scheduling