語言:

Quantum dropout: On and over the hardness of quantum approximate optimization algorithm

Wang, Zhenduo ; Zheng, Pei-Lin ; Wu, Biao ; Zhang, Yi

Physical review research, 2023-06, Vol.5 (2), p.023171, Article 023171 [同儕審閱期刊]

可取得全文

引用被引用

題名:
Quantum dropout: On and over the hardness of quantum approximate optimization algorithm
著者: Wang, Zhenduo ; Zheng, Pei-Lin ; Wu, Biao ; Zhang, Yi
所屬期刊: Physical review research, 2023-06, Vol.5 (2), p.023171, Article 023171
描述: A combinatorial optimization problem becomes very difficult in situations where the energy landscape is rugged, and the global minimum locates in a narrow region of the configuration space. When using the quantum approximate optimization algorithm (QAOA) to tackle these harder cases, we find that difficulty mainly originates from the QAOA quantum circuit instead of the cost function. To alleviate the issue, we selectively drop the clauses defining the quantum circuit while keeping the cost function intact. Due to the combinatorial nature of the optimization problems, the dropout of clauses in the circuit does not affect the solution. Our numerical results confirm improvements in QAOA's performance with various types of quantum-dropout implementations.
出版者: American Physical Society
語言: 英文
識別號: ISSN: 2643-1564
EISSN: 2643-1564
DOI: 10.1103/PhysRevResearch.5.023171
資源來源: DOAJ Directory of Open Access Journals

返回到檢索清單

前一個記錄檢索清單 9 下ㄧ個記錄下ㄧ頁