Ruoqian Xu, Sebastián V. Romero, Jialiang Tang, Yue Ban, Xi Chen
{"title":"装箱问题的数字化反绝热量子优化","authors":"Ruoqian Xu, Sebastián V. Romero, Jialiang Tang, Yue Ban, Xi Chen","doi":"10.1140/epjqt/s40507-025-00402-w","DOIUrl":null,"url":null,"abstract":"<div><p>The bin packing problem (BPP), a classical NP-hard combinatorial optimization challenge, has emerged as a promising application for quantum computing. In this work, we tackle the one-dimensional BPP (1dBPP) using a digitized counterdiabatic quantum approximate optimization algorithm (DC-QAOA) that incorporates counterdiabatic (CD) driving to achieve a 40% higher feasibility ratio than standard QAOA, while reducing quantum resource requirements. We investigate three ansatz schemes -DC-QAOA, CD-inspired ansatz, and CD-mixer ansatz - each integrating CD terms with distinct combinations of cost and mixer Hamiltonians, resulting in different DC-QAOA variants. Numerical simulations demonstrate that these DC-QAOA variants maintain solution accuracy with less than 5% variance across varying iteration numbers, circuit depths, and Hamiltonian step sizes. Moreover, they require approximately 7 to 8 times fewer measurements to achieve comparable precision under the same parameter variations. Experimental validation on a 10-item 1dBPP instance using IBM quantum computers shows the CD-mixer ansatz achieves five times more feasibility solutions and greater robustness against NISQ noise. Collectively, these results establish DC-QAOA as a resource-efficient framework for combinatorial optimization on near-term quantum devices.</p></div>","PeriodicalId":547,"journal":{"name":"EPJ Quantum Technology","volume":"12 1","pages":""},"PeriodicalIF":5.6000,"publicationDate":"2025-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://epjquantumtechnology.springeropen.com/counter/pdf/10.1140/epjqt/s40507-025-00402-w","citationCount":"0","resultStr":"{\"title\":\"Digitized counterdiabatic quantum optimization for bin packing problem\",\"authors\":\"Ruoqian Xu, Sebastián V. Romero, Jialiang Tang, Yue Ban, Xi Chen\",\"doi\":\"10.1140/epjqt/s40507-025-00402-w\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The bin packing problem (BPP), a classical NP-hard combinatorial optimization challenge, has emerged as a promising application for quantum computing. In this work, we tackle the one-dimensional BPP (1dBPP) using a digitized counterdiabatic quantum approximate optimization algorithm (DC-QAOA) that incorporates counterdiabatic (CD) driving to achieve a 40% higher feasibility ratio than standard QAOA, while reducing quantum resource requirements. We investigate three ansatz schemes -DC-QAOA, CD-inspired ansatz, and CD-mixer ansatz - each integrating CD terms with distinct combinations of cost and mixer Hamiltonians, resulting in different DC-QAOA variants. Numerical simulations demonstrate that these DC-QAOA variants maintain solution accuracy with less than 5% variance across varying iteration numbers, circuit depths, and Hamiltonian step sizes. Moreover, they require approximately 7 to 8 times fewer measurements to achieve comparable precision under the same parameter variations. Experimental validation on a 10-item 1dBPP instance using IBM quantum computers shows the CD-mixer ansatz achieves five times more feasibility solutions and greater robustness against NISQ noise. Collectively, these results establish DC-QAOA as a resource-efficient framework for combinatorial optimization on near-term quantum devices.</p></div>\",\"PeriodicalId\":547,\"journal\":{\"name\":\"EPJ Quantum Technology\",\"volume\":\"12 1\",\"pages\":\"\"},\"PeriodicalIF\":5.6000,\"publicationDate\":\"2025-08-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://epjquantumtechnology.springeropen.com/counter/pdf/10.1140/epjqt/s40507-025-00402-w\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"EPJ Quantum Technology\",\"FirstCategoryId\":\"101\",\"ListUrlMain\":\"https://link.springer.com/article/10.1140/epjqt/s40507-025-00402-w\",\"RegionNum\":2,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"OPTICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"EPJ Quantum Technology","FirstCategoryId":"101","ListUrlMain":"https://link.springer.com/article/10.1140/epjqt/s40507-025-00402-w","RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"OPTICS","Score":null,"Total":0}
Digitized counterdiabatic quantum optimization for bin packing problem
The bin packing problem (BPP), a classical NP-hard combinatorial optimization challenge, has emerged as a promising application for quantum computing. In this work, we tackle the one-dimensional BPP (1dBPP) using a digitized counterdiabatic quantum approximate optimization algorithm (DC-QAOA) that incorporates counterdiabatic (CD) driving to achieve a 40% higher feasibility ratio than standard QAOA, while reducing quantum resource requirements. We investigate three ansatz schemes -DC-QAOA, CD-inspired ansatz, and CD-mixer ansatz - each integrating CD terms with distinct combinations of cost and mixer Hamiltonians, resulting in different DC-QAOA variants. Numerical simulations demonstrate that these DC-QAOA variants maintain solution accuracy with less than 5% variance across varying iteration numbers, circuit depths, and Hamiltonian step sizes. Moreover, they require approximately 7 to 8 times fewer measurements to achieve comparable precision under the same parameter variations. Experimental validation on a 10-item 1dBPP instance using IBM quantum computers shows the CD-mixer ansatz achieves five times more feasibility solutions and greater robustness against NISQ noise. Collectively, these results establish DC-QAOA as a resource-efficient framework for combinatorial optimization on near-term quantum devices.
期刊介绍:
Driven by advances in technology and experimental capability, the last decade has seen the emergence of quantum technology: a new praxis for controlling the quantum world. It is now possible to engineer complex, multi-component systems that merge the once distinct fields of quantum optics and condensed matter physics.
EPJ Quantum Technology covers theoretical and experimental advances in subjects including but not limited to the following:
Quantum measurement, metrology and lithography
Quantum complex systems, networks and cellular automata
Quantum electromechanical systems
Quantum optomechanical systems
Quantum machines, engineering and nanorobotics
Quantum control theory
Quantum information, communication and computation
Quantum thermodynamics
Quantum metamaterials
The effect of Casimir forces on micro- and nano-electromechanical systems
Quantum biology
Quantum sensing
Hybrid quantum systems
Quantum simulations.