.png){kind=icon}
Return
Noisy quantum approximation optimization algorithm for solving MaxCut problem
.png){kind=icon}
PRE
AI
DOI：10.1088/1402-4896/ae009f.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In the noisy intermediate-scale quantum (NISQ) era, quantum approximate optimisation algorithms are important tools for solving NP-hard problems such as combinatorial optimisation. However, most QAOA implementations ignore the inherent noise in quantum circuit environments. This study proposes a noisy quantum approximate optimisation algorithm (NQAOA) and analyses its performance under noisy conditions through numerical simulations. We compare the approximate ratios (AR) of various graphs under different optimisation strategies and noise conditions, and assess the impact of circuit depth, node count, edge count, and noise coefficient on the maximum cut (MaxCut). Experimental results show that noise leads to overfitting, and the approximate ratio (AR) exhibits fluctuating changes as the edge count e increases. The AR values under ideal conditions and the expected results are both superior to those under noisy conditions. This study is the first to systematically integrate multiple types of quantum noise into the QAOA framework, quantitatively analysing the synergistic effects of noise type, optimiser performance, and graph structure. Through theoretical derivations and numerical simulations, we established linear/exponential theoretical boundaries for AR decay related to noise coefficients, providing a critical reference for designing noise-resistant quantum optimisation algorithms on NISQ devices.
Journal
IF:
2.6
Papers:
4.3K
Citations:
2.5W
Organization
No organization information available
Cited Papers
ShareSave
ShareSaveHardware-efficient variational quantum eigensolver for small molecules and quantum magnets.png)
Nature
OAAI
NatureIF0
OAAIShareSaveFrom the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator AnsatzAlgorithmsOAAI
AlgorithmsIF0
OAAIShareSaveShareSave
View more