research-article

Quantum Annealing versus Digital Computing: An Experimental Comparison

Authors:

Michael Jünger,

Elisabeth Lobe,

Gerhard Reinelt,

Giovanni Rinaldi,

Tobias StollenwerkAuthors Info & Claims

Journal of Experimental Algorithmics (JEA), Volume 26

Article No.: 1.9, Pages 1 - 30

https://doi.org/10.1145/3459606

Published: 09 July 2021 Publication History

Abstract

Quantum annealing is getting increasing attention in combinatorial optimization. The quantum processing unit by D-Wave is constructed to approximately solve Ising models on so-called Chimera graphs. Ising models are equivalent to quadratic unconstrained binary optimization (QUBO) problems and maximum cut problems on the associated graphs. We have tailored branch-and-cut as well as semidefinite programming algorithms for solving Ising models for Chimera graphs to provable optimality and use the strength of these approaches for comparing our solution values to those obtained on the current quantum annealing machine, D-Wave 2000Q. This allows for the assessment of the quality of solutions produced by the D-Wave hardware. In addition, we also evaluate the performance of a heuristic by Selby. It has been a matter of discussion in the literature how well the D-Wave hardware performs at its native task, and our experiments shed some more light on this issue. In particular, we examine how reliably the D-Wave computer can deliver true optimum solutions and present some surprising results.

References

[1]

Tameem Albash and Daniel A. Lidar. 2018. Demonstration of a scaling advantage for a quantum annealer over simulated annealing. Physical Review X 8, 3 (July 2018), 031016.

[2]

Francisco Barahona. 1982. On the computational complexity of ising spin glass models. Journal of Physics A: Mathematical and General 15, 10 (1982), 3241.

[3]

Francisco Barahona. 1983. Balancing Signed Toroidal Graphs in Polynomial Time.Departamento de Matematicas, Universidad de Chile, Santiago, Chile.

[4]

Francisco Barahona. 1983. The max-cut problem on graphs not contractible to . Operations Research Letters 2, 3 (1983), 107–111.

Digital Library

[5]

Francisco Barahona, Martin Grötschel, Michael Jünger, and Gerhard Reinelt. 1988. An application of combinatorial optimization to statistical physics and circuit layout design. Operations Research 36, 3 (1988), 493–513.

[6]

Francisco Barahona, Michael Jünger, and Gerhard Reinelt. 1989. Experiments in quadratic 0-1 programming. Mathematical Programming 44, 1 (1989), 127–137.

Digital Library

[7]

Francisco Barahona and Ali Ridha Mahjoub. 1986. On the cut polytope. Mathematical Programming 36, 2 (1986), 157–173.

[8]

Christian Bauckhage, Eduardo Brito, Kostadin Cvejoski, César Ojeda, Rafet Sifa, and Stefan Wrobel. 2018. Ising models for binary clustering via adiabatic quantum computing. In Energy Minimization Methods in Computer Vision and Pattern Recognition - 11th International Conference (EMMCVPR’17), Revised Selected Papers (Lecture Notes in Computer Science), Marcello Pelillo and Edwin R. Hancock (Eds.), Vol. 10746. Springer, 3–17.

[9]

Biq Mac 2009. Biq Mac Solver – Binary quadratic and Max cut Solver. http://biqmac.uni-klu.ac.at.

[10]

Hans L. Bodlaender and Klaus Jansen. 2000. On the complexity of the maximum cut problem. Nordic Journal of Computing 7, 1 (2000), 14–31.

Digital Library

[11]

Sergio Boixo, Troels F. Rønnow, Sergei V. Isakov, Zhihui Wang, David Wecker, Daniel A. Lidar, John M. Martinis, and Matthias Troyer. 2013. Evidence for quantum annealing with more than one hundred qubits. Nature Physics 10, 3 (2013), 218–224. arXiv:quant-ph/1304.4595.

[12]

Thorsten Bonato, Michael Jünger, Gerhard Reinelt, and Giovanni Rinaldi. 2014. Lifting and separation procedures for the cut polytope. Mathematical Programming 146, 1–2 (2014), 351–378.

Digital Library

[13]

Tomas Boothby, Andrew D. King, and Aidan Roy. 2016. Fast clique minor generation in chimera qubit connectivity graphs. Quantum Information Processing 15, 1 (2016), 495–508.

Digital Library

[14]

Jun Cai, William G. Macready, and Aidan Roy. 2014. A practical heuristic for finding graph minors. arXiv e-prints (2014), arXiv:1406.2741.

[15]

Cristian S. Calude, Michael J. Dinneen, and Richard Hua. 2017. QUBO formulations for the graph isomorphism problem and related problems. Theoretical Computer Science 701 (2017), 54–69. the intersection of computer science with biology, chemistry and physics - In Memory of Solomon Marcus.

Digital Library

[16]

Markus Chimani, Christine Dahn, Martina Juhnke-Kubitzke, Nils M. Kriege, Petra Mutzel, and Alexander Nover. 2020. Maximum cut parameterized by crossing number. Journal of Graph Algorithms and Applications 24, 3 (2020), 155–170.

[17]

Vicky Choi. 2008. Minor-embedding in adiabatic quantum computation: I. The parameter setting problem. Quantum Information Processing 7, 5 (2008), 193–209.

Digital Library

[18]

Carleton Coffrin, Harsha Nagarajan, and Russell Bent. 2017. Ising processing units: Potential and challenges for discrete optimization. arXiv e-prints (2017), arXiv:1707.00355.

[19]

William J. Cook, David L. Applegate, Robert E. Bixby, and Vasek Chvátal. 2011. The Traveling Salesman Problem. Princeton University Press.

[20]

D-Wave. 2020. D-Wave System Documentation. https://docs.dwavesys.com/docs/latest/c_timing_2.html.

[21]

Christine Dahn, Nils M. Kriege, and Petra Mutzel. 2018. A fixed-parameter algorithm for the max-cut problem on embedded 1-planar graphs. In Combinatorial Algorithms - 29th International Workshop (IWOCA’18), Proceedings (Lecture Notes in Computer Science), Costas S. Iliopoulos, Hon Wai Leong, and Wing-Kin Sung (Eds.), Vol. 10979. Springer, 141–152.

[22]

Christine Dahn, Nils M. Kriege, Petra Mutzel, and Julian Schilling. 2021. Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs. Theoretical Computer Science 852 (2021), 172–184. https://www.sciencedirect.com/science/article/pii/S0304397520306721.

[23]

Sanjeeb Dash. [n.d.]. Cutting planes from extended formulations of mixed-integer programs. Presentation at the Joint Mathematics Meeting, Baltimore, Jan. 2019. https://jointmathematicsmeetings.org/amsmtgs/2217_abstracts/1145-90-2271.pdf.

[24]

Sanjeeb Dash and Jean-François Puget. 2015. On quadratic unconstrained binary optimization problems defined on Chimera graphs. OPTIMA 98 (2015), 2–6.

[25]

Caterina De Simone, Martin Diehl, Michael Jünger, Petra Mutzel, Gerhard Reinelt, and Giovanni Rinaldi. 1995. Exact ground states of Ising spin glasses: New experimental results with a branch-and-cut algorithm. Journal of Statistical Physics 80, 1–2 (1995), 487–496.

[26]

Caterina De Simone, Martin Diehl, Michael Jünger, Petra Mutzel, Gerhard Reinelt, and Giovanni Rinaldi. 1996. Exact ground states of two-dimensional Ising spin glasses. Journal of Statistical Physics 84, 5 (Sept. 1996), 1363–1371.

[27]

Tony T. Tran Minh Do, Eleanor G. Rieffel, Jeremy Frank, Zhihui Wang, Bryan O’Gorman, Davide Venturelli, and J. Christopher Beck. 2016. A hybrid quantum-classical approach to solving scheduling problems. In 9th Annual Symposium on Combinatorial Search, 98–106.

[28]

Iain Dunning, Swati Gupta, and John Silberholz. 2018. What works best when? a systematic evaluation of heuristics for max-cut and QUBO. INFORMS Journal on Computing 30, 3 (2018), 608–624.

Digital Library

[29]

E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser. 2000. Quantum computation by adiabatic evolution. arXiv quant-ph/0001106.

[30]

Alexander Fix, Joyce Chen, Endre Boros, and Ramin Zabih. 2012. Approximate MRF inference using bounded treewidth subgraphs. In Computer Vision (ECCV’12), Andrew Fitzgibbon, Svetlana Lazebnik, Pietro Perona, Yoichi Sato, and Cordelia Schmid (Eds.). Springer, Berlin, 385–398.

[31]

Anna Galluccio and Martin Loebl. 1998. Max Cut in Toroidal Graphs. Technical Report R.471. Instituto di Analisi dei Sistemi ed Informatica, Consiglio Nazionale delle Ricerche.

[32]

Michel X. Goemans and David P. Williamson. 1995. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM 42, 6 (1995), 1115–1145.

Digital Library

[33]

Martin Grötschel, László Lovász, and Alexander Schrijver. 1981. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 2 (1981), 169–197.

[34]

Martin Grötschel and George L. Nemhauser. 1984. A polynomial algorithm for the max-cut problem on graphs without long odd cycles. Mathematical Programming 29, 1 (1984), 28–40.

Digital Library

[35]

Frank Hadlock. 1975. Finding a maximum cut of a planar graph in polynomial time. SIAM Journal on Computing 4, 3 (1975), 221–225.

[36]

Ryan Hamerly, Takahiro Inagaki, Peter L. McMahon, Davide Venturelli, Alireza Marandi, Tatsuhiro Onodera, Edwin Ng, Carsten Langrock, Kensuke Inaba, Toshimori Honjo, Koji Enbutsu, Takeshi Umeki, Ryoichi Kasahara, Shoko Utsunomiya, Satoshi Kako, Ken-ichi Kawarabayashi, Robert L. Byer, Martin M. Fejer, Hideo Mabuchi, Dirk Englund, Eleanor Rieffel, Hiroki Takesue, and Yoshihisa Yamamoto. 2019. Experimental investigation of performance differences between coherent Ising machines and a quantum annealer. Science Advances 5, 5 (2019), 1–10. https://advances.sciencemag.org/content/5/5/eaau0823.

[37]

Firas Hamze and Nando de Freitas. 2004. From fields to trees. In Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence (UAI’04). AUAI Press, Arlington, VA, 243–250. http://dl.acm.org/citation.cfm?id=1036843.1036873.

Digital Library

[38]

Itay Hen, Joshua Job, Tameem Albash, Troels F. Rønnow, Matthias Troyer, and Daniel A. Lidar. 2015. Probing for quantum speedup in spin-glass problems with planted solutions. Physical Review A 92, 4 (Oct. 2015), 042325.

[39]

IBM. 2020. CPLEX Optimization Studio. http://www.cplex.com.

[40]

Kazuki Ikeda, Yuma Nakamura, and Travis S. Humble. 2019. Application of quantum annealing to nurse scheduling problem. Scientific Reports 9, 1 (Sept. 2019), 12837.

[41]

Richard M. Karp. 1972. Reducibility among combinatorial problems. In Proceedings of a Symposium on the Complexity of Computer Computations, New York (The IBM Research Symposia Series), Raymond E. Miller and James W. Thatcher (Eds.). Plenum Press, New York, 85–103. http://www.cs.berkeley.edu/ luca/cs172/karp.pdf.

[42]

Donald E. Knuth. 1993. The Stanford GraphBase: A Platform for Combinatorial Computing. ACM Press, New York.

[43]

Frauke Liers, Michael Jünger, Gerhard Reinelt, and Giovanni Rinaldi. 2004. Computing exact ground states of hard ising spin glass problems by branch and cut. In New Optimization Algorithms in Physics, Alexander K. Hartmann and Heiko Rieger (Eds.). Wiley-VCH, 47–68.

[44]

Frauke Liers and Gregor Pardella. 2012. Partitioning planar graphs: A fast combinatorial approach for max-cut. Computational Optimization and Applications 51, 1 (2012), 323–344.

Digital Library

[45]

Stefan Lörwald and Gerhard Reinelt. 2015. PANDA: A software for polyhedral transformations. EURO Journal on Computational Optimization 3, 4 (2015), 297–308.

[46]

Sanjeev Mahajan and Hariharan Ramesh. 1995. Derandomizing semidefinite programming based approximation algorithms. SIAM Journal on Computing 28, 5 (1995), 1641–1663.

Digital Library

[47]

S. Thomas McCormick, M. R. Rao, and Giovanni Rinaldi. 2003. Easy and difficult objective functions for max cut. Mathematical Programming 94, 2–3 (2003), 459–466.

[48]

Catherine C. McGeoch and Cong Wang. 2013. Experimental evaluation of an adiabiatic quantum system for combinatorial optimization. In Computing Frontiers Conference (CF’13), Hubertus Franke, Alexander Heinecke, Krishna V. Palem, and Eli Upfal (Eds.). ACM, 23:1–23:11.

[49]

Christian F. A. Negre, Hayato Ushijima-Mwesigwa, and Susan M. Mniszewski. 2019. Detecting multiple communities using quantum annealing on the D-Wave system. arXiv e-prints, Article arXiv:1901.09756 (2019), arXiv:1901.09756 pages. arxiv:cs.OH/1901.09756.

[50]

Gurobi Optimization. 2020. Gurobi Optimizer 9.0. http://www.gurobi.com.

[51]

Christos H. Papadimitriou and Mihalis Yannakakis. 1991. Optimization, approximation, and complexity classes. Journal of Computer and System Sciences 43, 3 (1991), 425–440.

[52]

Ojas Parekh, Jeremy Wendt, Luke Shulenburger, Andrew Landahl, Jonathan Moussa, and John Aidun. 2016. Benchmarking adiabatic quantum optimization for complex network analysis. arXiv e-prints, Article arXiv:1604.00319 (2016), arXiv:1604.00319 pages. arxiv:quant-ph/1604.00319.

[53]

Adam Pearson, Anurag Mishra, Itay Hen, and Daniel Lidar. 2019. Analog errors in quantum annealing: Doom and hope. npj Quantum Information 5 (2019), 107.

[54]

Alejandro Perdomo-Ortiz, Joseph Fluegemann, Sriram Narasimhan, Rupak Biswas, and Vadim N. Smelyanskiy. 2015. A quantum annealing approach for fault detection and diagnosis of graph-based systems. European Physical Journal Special Topics 224, 1 (2015), 131–148.

[55]

Franz Rendl, Giovanni Rinaldi, and Angelika Wiegele. 2010. Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations. Mathematical Programming 121, 2 (2010), 307–335.

Digital Library

[56]

Eleanor G. Rieffel, Davide Venturelli, Bryan O’Gorman, Minh B. Do, Elicia M. Prystay, and Vadim N. Smelyanskiy. 2015. A case study in programming a quantum annealer for hard operational planning problems. Quantum Information Processing 14, 1 (2015), 1–36.

Digital Library

[57]

Troels F. Rønnow, Zhihui Wang, Joshua Job, Sergio Boixo, Sergei V. Isakov, David Wecker, John M. Martinis, Daniel A. Lidar, and Matthias Troyer. 2014. Defining and detecting quantum speedup. Science 345, 6195 (2014), 420–424.

[58]

Rishi Saket. 2013. A PTAS for the classical Ising spin glass problem on the Chimera graph structure. arXiv e-prints, Article arXiv:1306.6943 (2013), arXiv:1306.6943 pages. arxiv:cs.DS/1306.6943

[59]

Siddhartha Santra, Gregory Quiroz, Greg Ver Steeg, and Daniel A. Lidar. 2014. Max 2-SAT with up to 108 qubits. New Journal of Physics 16, 4 (Apr. 2014), 045006.

[60]

Alex Selby. [n.d.]. Harder QUBO instances on a Chimera graph. http://www.archduke.org/stuff/d-wave-comment-on-comparison-with-classical-computers/harder-qubo-instances-on-a-chimera-graph.

[61]

Alex Selby. 2013. QUBO-Chimera. Github: Social Coding.

[62]

Alex Selby. 2014. Efficient subgraph-based sampling of Ising-type models with frustration. arXiv e-prints, Article arXiv:1409.3934 (2014), arXiv:1409.3934 pages. arxiv:cond-mat.stat-mech/1409.3934

[63]

Wei-Kuan Shih, Sun Wu, and Yue-Sun Kuo. 1990. Unifying maximum cut and minimum cut of a planar graph. IEEE Transactions on Computers 39, 5 (1990), 694–697.

Digital Library

[64]

Spin Glass Solver 1996. The Spin Glass Ground State Server. https://informatik.uni-koeln.de/spinglass.

[65]

Tobias Stollenwerk, Elisabeth Lobe, and Martin Jung. 2019. Flight gate assignment with a quantum annealer. In Quantum Technology and Optimization Problems, Sebastian Feld and Claudia Linnhoff-Popien (Eds.). Springer International Publishing, 99–110.

[66]

Tobias Stollenwerk, Bryan O’Gorman, Davide Venturelli, Salvatore Mandrà, Olga Rodionova, Hokkwan Ng, Banavar Sridhar, Eleanor Gilbert Rieffel, and Rupak Biswas. 2020. Quantum annealing applied to de-conflicting optimal trajectories for air traffic management. IEEE Transactions on Intelligent Transportation Systems 21, 1 (2020), 285–297.

[67]

Davide Venturelli, Dominic J. J. Marchand, and Galo Rojo. 2015. Quantum annealing implementation of job-shop scheduling. arXiv preprint (2015), arXiv:1506.08479. http://arxiv.org/abs/1506.08479.

[68]

Walter Vinci and Daniel A. Lidar. 2016. Optimally stopped optimization. Physical Review Applied 6, 5 (Nov. 2016), 054016.

[69]

Sheir Yarkoni, Aske Plaat, and Thomas Bäck. 2018. First results solving arbitrarily structured maximum independent set problems using quantum annealing. 2018 IEEE Congress on Evolutionary Computation (CEC’18), 1–6.

[70]

Kevin Young, Robin Blume-Kohout, and Daniel Lidar. 2013. Adiabatic quantum optimization with the wrong Hamiltonian. Physical Review A 88, 6 (2013), 062314-1–062314-7.

Cited By

Vert DWillsch MYenilen BSirdey RLouise SMichielsen K(2024)Benchmarking quantum annealing with maximum cardinality matching problemsFrontiers in Computer Science10.3389/fcomp.2024.12860576Online publication date: 5-Jun-2024
https://doi.org/10.3389/fcomp.2024.1286057
McMahon CMcGillivray DDesai ARivadeneyra FLam JLo TMarsden DSkavysh V(2024)Improving the Efficiency of Payments Systems Using Quantum ComputingManagement Science10.1287/mnsc.2023.0031470:10(7325-7341)Online publication date: 1-Oct-2024
https://dl.acm.org/doi/10.1287/mnsc.2023.00314
Sandt RLe Bouar YSpatschek R(2024)Microstructure equilibration with consideration of elastic and interfacial interactions via quantum annealing with application to the solid electrolyte LLZOPhysical Review Research10.1103/PhysRevResearch.6.0330476:3Online publication date: 10-Jul-2024
https://doi.org/10.1103/PhysRevResearch.6.033047
Show More Cited By

Index Terms

Quantum Annealing versus Digital Computing: An Experimental Comparison
1. Hardware
  1. Emerging technologies
    1. Quantum technologies
      1. Quantum computation
2. Mathematics of computing
  1. Discrete mathematics
    1. Combinatorics
      1. Combinatorial optimization
  2. Mathematical software
    1. Mathematical software performance

Recommendations

Template-Based Minor Embedding for Adiabatic Quantum Optimization
Quantum annealing (QA) can be used to quickly obtain near-optimal solutions for quadratic unconstrained binary optimization (QUBO) problems. In QA hardware, each decision variable of a QUBO should be mapped to one or more adjacent qubits in such a way ...
Non-commuting two-local Hamiltonians for quantum error suppression

Physical constraints make it challenging to implement and control many-body interactions. For this reason, designing quantum information processes with Hamiltonians consisting of only one- and two-local terms is a worthwhile challenge. Enabling error ...
The potential of quantum annealing for rapid solution structure identification
Abstract
The recent emergence of novel computational devices, such as quantum computers, coherent Ising machines, and digital annealers presents new opportunities for hardware-accelerated hybrid optimization algorithms. Unfortunately, demonstrations of ...

Comments

Information & Contributors

Information

Published In

cover image ACM Journal of Experimental Algorithmics

ACM Journal of Experimental Algorithmics Volume 26, Issue

December 2021

479 pages

ISSN:1084-6654

EISSN:1084-6654

DOI:10.1145/3446425

Issue’s Table of Contents

Copyright © 2021 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 July 2021

Accepted: 01 March 2021

Revised: 01 March 2021

Received: 01 April 2020

Published in JEA Volume 26

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Deutsche Forschungsgemeinschaft

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

20
Total Citations
View Citations
533
Total Downloads

Downloads (Last 12 months)104
Downloads (Last 6 weeks)9

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Vert DWillsch MYenilen BSirdey RLouise SMichielsen K(2024)Benchmarking quantum annealing with maximum cardinality matching problemsFrontiers in Computer Science10.3389/fcomp.2024.12860576Online publication date: 5-Jun-2024
https://doi.org/10.3389/fcomp.2024.1286057
McMahon CMcGillivray DDesai ARivadeneyra FLam JLo TMarsden DSkavysh V(2024)Improving the Efficiency of Payments Systems Using Quantum ComputingManagement Science10.1287/mnsc.2023.0031470:10(7325-7341)Online publication date: 1-Oct-2024
https://dl.acm.org/doi/10.1287/mnsc.2023.00314
Sandt RLe Bouar YSpatschek R(2024)Microstructure equilibration with consideration of elastic and interfacial interactions via quantum annealing with application to the solid electrolyte LLZOPhysical Review Research10.1103/PhysRevResearch.6.0330476:3Online publication date: 10-Jul-2024
https://doi.org/10.1103/PhysRevResearch.6.033047
P. dos Santos LHang TSandt RFinsterbusch MLe Bouar YSpatschek R(2024)Elastic energy driven multivariant selection in martensites via quantum annealingPhysical Review Research10.1103/PhysRevResearch.6.0230766:2Online publication date: 22-Apr-2024
https://doi.org/10.1103/PhysRevResearch.6.023076
Binninger TTing YKowalski PEikerling M(2024)Optimization of ionic configurations in battery materials by quantum annealingPhysical Review B10.1103/PhysRevB.110.L180202110:18Online publication date: 26-Nov-2024
https://doi.org/10.1103/PhysRevB.110.L180202
Abbas AAmbainis AAugustino BBärtschi ABuhrman HCoffrin CCortiana GDunjko VEgger DElmegreen BFranco NFratini FFuller BGacon JGonciulea CGribling SGupta SHadfield SHeese RKircher GKleinert TKoch TKorpas GLenk SMarecek JMarkov VMazzola GMensa SMohseni NNannicini GO’Meara CTapia EPokutta SProissl MRebentrost PSahin ESymons BTornow SValls VWoerner SWolf-Bauwens MYard JYarkoni SZechiel DZhuk SZoufal C(2024)Challenges and opportunities in quantum optimizationNature Reviews Physics10.1038/s42254-024-00770-96:12(718-735)Online publication date: 28-Oct-2024
https://doi.org/10.1038/s42254-024-00770-9
Lobe ELutz A(2024)Minor embedding in broken chimera and derived graphs is NP-completeTheoretical Computer Science10.1016/j.tcs.2023.114369989:COnline publication date: 16-May-2024
https://dl.acm.org/doi/10.1016/j.tcs.2023.114369
Clautiaux FLjubić I(2024)Last fifty years of integer linear programming: A focus on recent practical advancesEuropean Journal of Operational Research10.1016/j.ejor.2024.11.018Online publication date: Nov-2024
https://doi.org/10.1016/j.ejor.2024.11.018
Basermann AEpping MFauseweh BFelderer MLobe ERöhrig-Zöllner MSchmiedinghoff GSchuhmacher PSetyawati YWeinert A(2024)Quantum Software Ecosystem DesignQuantum Software10.1007/978-3-031-64136-7_7(143-188)Online publication date: 23-Aug-2024
https://doi.org/10.1007/978-3-031-64136-7_7
McGeoch CFarré P(2023)Milestones on the Quantum Utility Highway: Quantum Annealing Case StudyACM Transactions on Quantum Computing10.1145/36253075:1(1-30)Online publication date: 16-Dec-2023
https://doi.org/10.1145/3625307
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

HTML Format

View this article in HTML Format.

Figures

Tables

Media

View Issue’s Table of Contents