Puya Mirkarimi puya.mirkarimi@durham.ac.uk
PGR Student Doctor of Philosophy
Quantum optimization with linear Ising penalty functions for customer data science
Mirkarimi, Puya; Shukla, Ishaan; Hoyle, David C.; Williams, Ross; Chancellor, Nicholas
Authors
Ishaan Shukla ishaan.shukla@durham.ac.uk
Marking
David C. Hoyle
Ross Williams
Dr Nicholas Chancellor nicholas.chancellor@durham.ac.uk
Teaching Fellow QO
Abstract
Constrained combinatorial optimization problems, which are ubiquitous in industry, can be solved by quantum algorithms such as quantum annealing (QA) and the quantum approximate optimization algorithm (QAOA). In these quantum algorithms, constraints are typically implemented with quadratic penalty functions. This penalty method can introduce large energy scales and make interaction graphs much more dense. These effects can result in worse performance of quantum optimization, particularly on near-term devices that have sparse hardware graphs and other physical limitations. In this work, we consider linear Ising penalty functions, which are applied with local fields in the Ising model, as an alternative method for implementing constraints that makes more efficient use of physical resources. We study the behavior of the penalty method in the context of quantum optimization for customer data science problems. Our theoretical analysis and numerical simulations of QA and the QAOA indicate that this penalty method can lead to better performance in quantum optimization than the quadratic method. However, the linear Ising penalty method is not suitable for all problems as it cannot always exactly implement the desired constraint. In cases where the linear method is not successful in implementing all constraints, we propose that schemes involving both quadratic and linear Ising penalties can be effective.
Citation
Mirkarimi, P., Shukla, I., Hoyle, D. C., Williams, R., & Chancellor, N. (2024). Quantum optimization with linear Ising penalty functions for customer data science. Physical Review Research, 6(4), Article 043241. https://doi.org/10.1103/physrevresearch.6.043241
Journal Article Type | Article |
---|---|
Acceptance Date | Oct 21, 2024 |
Online Publication Date | Dec 5, 2024 |
Publication Date | 2024-12 |
Deposit Date | Dec 20, 2024 |
Publicly Available Date | Dec 20, 2024 |
Journal | Physical Review Research |
Electronic ISSN | 2643-1564 |
Publisher | American Physical Society |
Peer Reviewed | Peer Reviewed |
Volume | 6 |
Issue | 4 |
Article Number | 043241 |
DOI | https://doi.org/10.1103/physrevresearch.6.043241 |
Public URL | https://durham-repository.worktribe.com/output/3226658 |
Files
Published Journal Article
(1.2 Mb)
PDF
Publisher Licence URL
http://creativecommons.org/licenses/by/4.0/
You might also like
Comparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms
(2023)
Journal Article
Experimental demonstration of improved quantum optimization with linear Ising penalties
(2024)
Journal Article
Cycle discrete-time quantum walks on a noisy quantum computer
(2024)
Journal Article
A thermodynamic approach to optimization in complex quantum systems
(2024)
Journal Article
Graphical structures for design and verification of quantum error correction
(2023)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search