GPU-accelerated simulations of quantum annealing and the quantum approximate optimization algorithm
Open accessThe DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Abstract
We study large-scale applications using a GPU-accelerated version of the massively parallel Jülich universal quantum computer simulator (JUQCS–G). First, we benchmark JUWELS Booster, a GPU cluster with 3744 NVIDIA A100 Tensor Core GPUs. Then, we use JUQCS–G to study the relation between quantum annealing (QA) and the quantum approximate optimization algorithm (QAOA). We find that a very coarsely discretized version of QA, termed approximate quantum annealing (AQA), performs surprisingly well in comparison to the QAOA. It can either be used to initialize the QAOA, or to avoid the costly optimization procedure altogether. Furthermore, we study the scaling of the success probability when using AQA for problems with 30 to 40 qubits. We find that the case with the largest discretization error scales most favorably, surpassing the best result obtained from the QAOA.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
Ising formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512
Quantum annealing in the transverse Ising model
Kadowaki, T., & Nishimori, H. (1998) · Physical Review E · doi:10.1103/physreve.58.5355 · Cited by 2,339
On the product of semi-groups of operators
Trotter, H. F. (1959) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1959-0108732-6 · Cited by 2,282 · cited 1×
“We increase the time step that controls the discretization error (sometimes referred to as the Trotter error [46, 47], although the formalism goes well beyond Trotter’s investigation [48], see [49–51]).”
BackgroundA Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
Farhi, E., Goldstone, J., Gutmann, S., Lapan, J., Lundgren, A., & Preda, D. (2001) · Science · doi:10.1126/science.1057726 · Cited by 2,056
Quantum annealing with manufactured spins
Johnson, M. W., Amin, M. H. S., Gildert, S., Lanting, T., Hamze, F., Dickson, N., Harris, R., Berkley, A. J., Johansson, J., Bunyk, P., et al. (2011) · Nature · doi:10.1038/nature10012 · Cited by 1,891
Two-bit gates are universal for quantum computation
DiVincenzo, D. P. (1995) · Physical Review A · doi:10.1103/physreva.51.1015 · Cited by 1,069 · cited 1×
“As all quantum circuits can be decomposed into single-qubit and two-qubit gates [53, 54], simulating a quantum circuit amounts to a large number of sparse matrix-vector updates.”
BackgroundZhou, L., Wang, S.-T., Choi, S., Pichler, H., & Lukin, M. D. (2020) · Physical Review X · doi:10.1103/physrevx.10.021067 · Cited by 913
Suzuki, M. (1976) · Communications in Mathematical Physics · doi:10.1007/bf01609348 · Cited by 895
From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
Hadfield, S., Wang, Z., O’Gorman, B., Rieffel, E. G., Venturelli, D., & Biswas, R. (2019) · Algorithms · doi:10.3390/a12020034 · Cited by 772
Quantum approximate optimization of non-planar graph problems on a planar superconducting processor
Harrigan, M. P., Sung, K. J., Neeley, M., Satzinger, K. J., Arute, F., Arya, K., Atalaya, J., Bardin, J. C., Barends, R., Boixo, S., et al. (2021) · Nature Physics · doi:10.1038/s41567-020-01105-y · Cited by 564
Quantum Computation by Adiabatic Evolution
Farhi, E., Goldstone, J., Gutmann, S., & Sipser, M. (2000) · arXiv · doi:10.48550/arxiv.quant-ph/0001106 · Cited by 536 · cited 1×
“The concept of QA is based on the adiabatic theorem [65, 66].”
MethodQuantum Annealing of a Disordered Magnet
Brooke, J., Bitko, D., F., T., Rosenbaum, & Aeppli, G. (1999) · Science · doi:10.1126/science.284.5415.779 · Cited by 518
Perspectives of quantum annealing: methods and implementations
Hauke, P., Katzgraber, H. G., Lechner, W., Nishimori, H., & Oliver, W. D. (2020) · Reports on Progress in Physics · doi:10.1088/1361-6633/ab85b8 · Cited by 507
Quantum approximate optimization algorithm for MaxCut: A fermionic view
Wang, Z., Hadfield, S., Jiang, Z., & Rieffel, E. G. (2018) · Physical Review A · doi:10.1103/physreva.97.022304 · Cited by 353
Universality in quantum computation
Deutsch, D. E., Barenco, A., & Ekert, A. (1995) · Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences · doi:10.1098/rspa.1995.0065 · Cited by 346
Quantum Supremacy through the Quantum Approximate Optimization Algorithm
Farhi, E., & Harrow, A. W. (2016) · arXiv · doi:10.48550/arxiv.1602.07674 · Cited by 331
What Limits the Simulation of Quantum Computers?
Zhou, Y., Stoudenmire, E. M., & Waintal, X. (2020) · Physical Review X · doi:10.1103/physrevx.10.041038 · Cited by 254
Farhi, E., Goldstone, J., Gutmann, S., & Zhou, L. (2019) · arXiv · doi:10.48550/arxiv.1910.08187 · Cited by 226
Performance of the Quantum Approximate Optimization Algorithm on the Maximum Cut Problem
Crooks, G. E. (2018) · arXiv · doi:10.48550/arxiv.1811.08419 · Cited by 158
Reachability Deficits in Quantum Approximate Optimization
Akshay, V., Philathong, H., Morales, M. E. S., & Biamonte, J. D. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.090504 · Cited by 151
64-qubit quantum circuit simulation
Chen, Z.-Y., Zhou, Q., Xue, C., Yang, X., Guo, G.-C., & Guo, G.-P. (2018) · Science Bulletin · doi:10.1016/j.scib.2018.06.007 · Cited by 136
Benchmarking the quantum approximate optimization algorithm
Willsch, M., Willsch, D., Jin, F., De Raedt, H., & Michielsen, K. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02692-8 · Cited by 128
Self-citationTraining the quantum approximate optimization algorithm without access to a quantum processing unit
Streif, M., & Leib, M. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab8c2b · Cited by 125 · cited 2×
“Ideas that are similar to AQA have been investigated before [17, 21, 22, 46].”
BackgroundBenchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems
Willsch, D., Willsch, M., Gonzalez Calaza, C. D., Jin, F., De Raedt, H., Svensson, M., & Michielsen, K. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03476-y · Cited by 114 · cited 5×
“In this paper, we study the instances of exact cover problems used in [41].”
BackgroundMethodInfluentialSelf-citationBrandao, F. G. S. L., Broughton, M., Farhi, E., Gutmann, S., & Neven, H. (2018) · arXiv · doi:10.48550/arxiv.1812.04170 · Cited by 88
Benchmarking gate-based quantum computers
Michielsen, K., Nocon, M., Willsch, D., Jin, F., Lippert, T., & De Raedt, H. (2017) · Computer Physics Communications · doi:10.1016/j.cpc.2017.06.011 · Cited by 82
Self-citationClassical variational simulation of the Quantum Approximate Optimization Algorithm
Medvidović, M., & Carleo, G. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00440-z · Cited by 79
A study of the performance of classical minimizers in the Quantum Approximate Optimization Algorithm
Fernández-Pendás, M., Combarro, E. F., Vallecorsa, S., Ranilla, J., & Rúa, I. F. (2022) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2021.113388 · Cited by 52
Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral
Pednault, E., Gunnels, J. A., Nannicini, G., Horesh, L., Magerlein, T., Solomonik, E., Draeger, E. W., Holland, E. T., & Wisnieff, R. (2017) · arXiv · doi:10.48550/arxiv.1710.05867 · Cited by 48
Comparison of QAOA with Quantum and Simulated Annealing
Streif, M., & Leib, M. (2019) · arXiv · doi:10.48550/arxiv.1901.01903 · Cited by 35
Research works printed but not linked: 49
- De Raedt, 2019, Comput. Phys. Commun., 237, 47, 10.1016/j.cpc.2018.11.005 · DOI · Paper page
- Willsch, 2020, vol. 50, 255
- Jülich Supercomputing Centre, 2019, J. Large-Scale Res. Facil., 5, A135, 10.17815/jlsrf-5-171 · DOI · Paper page
- Suarez, 2020, vol. 50, 1
- De Raedt, 2007, Comput. Phys. Commun., 176, 121, 10.1016/j.cpc.2006.08.007 · DOI · Paper page
- Arute, 2019, Nature, 574, 505, 10.1038/s41586-019-1666-5 · DOI · Paper page
- Wang, 2018, Phys. Rev. A, 97
- Qiang, 2018, Nat. Photonics, 12, 534, 10.1038/s41566-018-0236-y · DOI · Paper page
- Vikstål, 2020, Phys. Rev. Appl., 14, 10.1103/PhysRevApplied.14.034009 · DOI · Paper page
- Bengtsson, 2020, Phys. Rev. Appl., 14, 10.1103/PhysRevApplied.14.034010 · DOI · Paper page
- Lacroix, 2020, PRX Quantum, 1, 10.1103/PRXQuantum.1.020304 · DOI · Paper page
- Pagano, 2020, Proc. Natl. Acad. Sci., 117, 10.1073/pnas.2006373117 · DOI · Paper page
- Zhou, 2020, Phys. Rev. X, 10
- Harrigan, 2021, Nat. Phys.
- Fernández-Pendás, 2021, J. Comput. Appl. Math., 113388
- Apolloni, 1989, Stoch. Process. Appl., 33, 233, 10.1016/0304-4149(89)90040-9 · DOI · Paper page
- Finnila, 1994, Chem. Phys. Lett., 219, 343, 10.1016/0009-2614(94)00117-0 · DOI · Paper page
- Harris, 2010, Phys. Rev. B, 82
- Bunyk, 2014, IEEE Trans. Appl. Supercond., 24, 1, 10.1109/TASC.2014.2318294 · DOI · Paper page
- Job, 2018, Quantum Sci. Technol., 3, 10.1088/2058-9565/aabd9b · DOI · Paper page
- Nath, 2021, SN Comput. Sci., 2, 365, 10.1007/s42979-021-00751-0 · DOI · Paper page
- Phillipson, 2021, Computers, 10, 71, 10.3390/computers10060071 · DOI
- Willsch, 2020, Comput. Phys. Commun., 248, 10.1016/j.cpc.2019.107006 · DOI · Paper page
- Gonzalez Calaza, 2021, Quantum Inf. Process., 20, 305, 10.1007/s11128-021-03226-6 · DOI
- Heyl, 2019, Sci. Adv., 5, 10.1126/sciadv.aau8342 · DOI
- Sieberer, 2019, npj Quantum Inf., 5, 78, 10.1038/s41534-019-0192-5 · DOI
- De Raedt, 1983, Phys. Rev. A, 28, 3575, 10.1103/PhysRevA.28.3575 · DOI · Paper page
- Suzuki, 1985, J. Math. Phys., 26, 601, 10.1063/1.526596 · DOI · Paper page
- Chen, 2018, Sci. Bull., 964
- Villalonga, 2019, npj Quantum Inf., 5, 10.1038/s41534-019-0196-1 · DOI · Paper page
- Zhou, 2020, Phys. Rev. X, 10
- Childs, 2001, Phys. Rev. A, 65, 10.1103/PhysRevA.65.012322 · DOI · Paper page
- Dickson, 2013, Nat. Commun., 4, 1903, 10.1038/ncomms2920 · DOI · Paper page
- Bian, 2014, Front. Phys., 2, 56, 10.3389/fphy.2014.00056 · DOI · Paper page
- Amin, 2015, Phys. Rev. A, 92, 10.1103/PhysRevA.92.052323 · DOI · Paper page
- Mishra, 2018, Nat. Commun., 9, 2917, 10.1038/s41467-018-05239-9 · DOI
- Marshall, 2019, Phys. Rev. Appl., 11, 10.1103/PhysRevApplied.11.044083 · DOI · Paper page
- Pearson, 2019, npj Quantum Inf., 5, 107, 10.1038/s41534-019-0210-7 · DOI · Paper page
- Weinberg, 2020, Phys. Rev. Lett., 124, 10.1103/PhysRevLett.124.090502 · DOI · Paper page
- Cao, 2016, Sci. Rep., 6
- Ernst, 2004, Eur. J. Oper. Res., 153, 3, 10.1016/S0377-2217(03)00095-X · DOI · Paper page
- Tahir, 2019, EURO J. Transp. Logist., 8, 713, 10.1007/s13676-019-00145-6 · DOI
- Suzuki, 1993, Proc. Jpn. Acad. Ser. B, 69, 161, 10.2183/pjab.69.161 · DOI · Paper page
- Nelder, 1965, Comput. J., 7, 308, 10.1093/comjnl/7.4.308 · DOI · Paper page
- Zhu, 1997, ACM Trans. Math. Softw., 23, 550, 10.1145/279232.279236 · DOI · Paper page
- Morales, 2011, ACM Trans. Math. Softw., 38, 7, 10.1145/2049662.2049669 · DOI · Paper page
- Press, 2007
- Willsch, 2020, Phys. Rev. A, 101, 10.1103/PhysRevA.101.012327 · DOI
- Hsu, 2019, Commun. Comput. Phys., 26, 928, 10.4208/cicp.OA-2018-0257 · DOI
Cited by
Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems
Willsch, D., Willsch, M., Gonzalez Calaza, C. D., Jin, F., De Raedt, H., Svensson, M., & Michielsen, K. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03476-y · Cited by 114
Self-citationMontañez-Barrera, J. A., Willsch, D., Maldonado-Romo, A., & Michielsen, K. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad35e4 · Cited by 57
Self-citationMontañez-Barrera, J. A., & Michielsen, K. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01082-1 · Cited by 34
Self-citationTransfer learning of optimal QAOA parameters in combinatorial optimization
Montañez-Barrera, J. A., Willsch, D., & Michielsen, K. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04743-4 · Cited by 19
“The underlying idea of parameter transfer is very promising, as it has been shown that finding parameters for variation quantum algorithms, such as QAOA, is NP-hard [10].”
Self-citation
Metadata
- Authors
- Willsch, D., Willsch, M., Jin, F., Michielsen, K., & De Raedt, H.
- Venue
- Computer Physics Communications
- Publisher
- Elsevier BV
- Published
- 2022-09
- Volume
- 278
- Pages
- 108411
- ISSN
- 0010-4655 (ISSN-L)
- OpenAlex
- W3145669624
- Cited by
- 36
- References
- 31
- FWCI
- 2.26
- Type
- journal article
- Language
- en
- Open access
- hybrid
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- www.elsevier.com/legal/tdmrep-license (tdm)
- creativecommons.org/licenses/by-nc-nd/4.0/ (vor)
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.