.png){kind=icon}
.png){kind=icon}
Return
Toward Solution-Time Advantage With Error-Mitigated Quantum Annealing for Combinatorial Optimization
.png){kind=icon}
PRE
AI
DOI：10.1002/apxr.202500216.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Quantum annealing (QA) has the potential to solve complex optimization problems, but its broad adoption is hindered by qubit errors, which cause an exponential slowdown in computing the global optimal solution as problem size increases. To address this limitation, we present a novel post-processing error mitigation for optimization technique, known as SEMO (spin-error mitigation for optimization), designed to improve QA computational efficiency. Its effectiveness is demonstrated through a correlated 3D image segmentation model for material microstructures, formulated as a quadratic unconstrained binary optimization (QUBO) problem. The technique significantly reduces the computing time required to reach the global optimum solution, demonstrating a time-to-solution advantage over the standard D-Wave Systems Advantage QA, simulated annealing (SA), and other post-processing techniques. Because it operates at the fundamental QUBO level, this approach is applicable to a wide range of discrete combinatorial optimization problems that can be expressed in QUBO format. As the number of qubits in quantum computers continues to increase, this method will become increasingly impactful.
Keywords:
combinatorial optimization
error mitigation
quadratic unconstrained binary optimization
Quantum annealing
qubit error
Journal
A
IF:
2.8
Papers:
96
Citations:
482