Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2005.05465

Quantum Annealing-Based Software Components: An Experimental Case Study with SAT Solving

Tom Krüger, Wolfgang Mauerer

Published Jun 27, 2020• 38 citations
arXivHTMLPDF

Abstract

Quantum computers have the potential of solving problems more efficiently than classical computers. While first commercial prototypes have become available, the performance of such machines in practical application is still subject to exploration. Quantum computers will not entirely replace classical machines, but serve as accelerators for specific problems. This necessitates integrating quantum computational primitives into existing applications.

DOI
10.1145/3387940.3391472

Related papers

Quantum Annealing and the Satisfiability Problem

Kristen L. Pudenz, Tallant Gregory S., Todd R. Belote +1 more

The utility of satisfiability (SAT) as an application focused hard computational problem is well established. We explore the potential of quantum annealing to enhance classical SAT solving, especially where sampling from the space of all possible solutions is of interest. We address the formulation of SAT problems to make them suitable for commercial quantum annealers, practical concerns in their implementation, and how the performance of the resulting quantum solver compares to and complements classical SAT solvers.

arXiv:1612.07258•Advances in parallel computing•Jan 1, 2017•7 citations

Towards Quantum Computing: Solving Satisfiability Problem by Quantum Annealing

Juexiao Su

To date, conventional computers have never been able to efficiently handle certain tasks, where the number of computation steps is likely to blow up as the problem size increases. As an emerging technology and new computing paradigm, quantum computing has a great potential to tackle those hard tasks efficiently. Among all the existing quantum computation models, quantum annealing has drawn significant attention in recent years due to the realization of the commercialized quantum annealer, sparking research interests in developing applications to solve problems that are intractable for classical computers.However, designing and implementing algorithms that manage to harness the enormous computation power from quantum annealer remains a challenging task. Generally, it requires mapping of the given optimization problem into quadratic unconstrained binary optimization(QUBO) problem and embedding the subsequent QUBO onto the physical architecture of quantum annealer. Additionally, practical quantum annealers are susceptible to errors leading to low probability of the correct solution.In this study, we focus on solving Boolean satisfiability (SAT) problem using quantum annealer while addressing practical limitations. We have proposed a mapping technique that maps SAT problem to QUBO, and we have further devised a tool flow that embeds the QUBO onto the architecture of a quantum annealing device. Additionally, We have optimized the proposed embedding flow to reduce run-time in addition to shortening the qubit chain length, leading to robust quantum annealing. To further improve the reliability of quantum annealing, we have also developed a post processing embedding technique that enlarges the energy gap between ground state and the first excited state. To demonstrate the effectiveness of proposed methods, we have conducted experiments on real quantum annealing devices manufactured by D-Wave Systems, showing compelling result of using quantum annealer to solve SAT problem.

•Jan 1, 2018•4 citations

Basics and Applications of Quantum Annealing

Shu Tanaka, Kotaro TANAHASHI, Tomomitsu Motohashi +1 more

Quantum annealing (QA) is a promising calculation method for obtaining a better solution to combinatorial optimization problems. QA is a natural computation technique proposed in the context of statistical physics in 1998. In 2011, the world's first commercial machine realizing QA experimentally was released. After that, the development of hardware and software has been exhaustive, and the studies on application search have been done using commercial QA machines. In this paper, we first explain the basics of QA without assuming the knowledge of statistical physics and quantum physics. We also show a couple of examples of application studies on QA. In addition, existing problems and overcoming other methods are explained.

TEION KOGAKU (Journal of Cryogenics and Superconductivity Society of Japan)•Sep 20, 2018•3 citations

Using a quantum computer to solve a real-world problem -- what can be achieved today?

R. Cumming, T. Thomas

Quantum computing is an important developing technology with the potential to revolutionise the landscape of scientific and business problems that can be practically addressed. The widespread excitement derives from the potential for a fault tolerant quantum computer to solve previously intractable problems. Such a machine is not expected to be available until 2030 at least. Thus we are currently in the so-called NISQ era where more heuristic quantum approaches are being applied to early versions of quantum hardware. In this paper we seek to provide a more accessible explanation of many of the more technical aspects of quantum computing in the current NISQ era exploring the 2 main hybrid classical-quantum algorithms, QAOA and VQE, as well as quantum annealing. We apply these methods, to an example of combinatorial optimisation in the form of a facilities location problem. Methods explored include the applications of different types of mixer (X, XY and a novel 3XY mixer) within QAOA as well as the effects of many settings for important meta parameters, which are often not focused on in research papers. Similarly, we explore alternative parameter settings in the context of quantum annealing. Our research confirms the broad consensus that quantum gate hardware will need to be much more capable than is available currently in terms of scale and fidelity to be able to address such problems at a commercially valuable level. Quantum annealing is closer to offering quantum advantage but will also need to achieve a significant step up in scale and connectivity to address optimisation problems where classical solutions are sub-optimal.

arXiv:2211.13080•Nov 23, 2022•17 citations

Experimental Analysis of Quantum Annealing for Satisfiability Problems

Remma Ukaku, Tomohisa Kawakami, Hiroyuki Tomiyama

Quantum computing has emerged as a promising method for solving combinatorial optimization problems. These problems are often encoded as the Satisfiability (SAT) problem. In this study, we explore the quantum annealing based approach to solving the SAT problems. We conduct experiments on uniformly random 3-CNF instances that have 400 propositional variables and 1,000 to 2,499 clauses. We measure the time required to solve them using Fixstars Amplify Annealing Engine. The results show that the monotonic increase in solving time as the number of clauses increases, except for a discontinuity point at approximately 1,800 clauses. In addition, we observe some cases of false UNSAT reports. Our findings demonstrate both the characteristics and the limitations of this quantum annealing based solver. We plan to reproduce the solver on a local machine to inspect the performance when varying the parameters of the quantum annealing and the environment.

IEEE Asia Pacific Conference on Circuits and Systems (APCCAS)•Oct 12, 2025•0 citations

A quantum annealing approach for boolean satisfiability problem

Juexiao Su, Tianheng Tu, Lei He

Quantum annealing device has shown a great potential in solving discrete problems that are theoretically and empirically hard. Boolean Satisfiability (SAT) problem, determining if there is an assignment of variables that satisfies a given Boolean function, is the first proven NP-complete problem widely used in various domains. Here, we present a novel mapping of the SAT problem to the quadratic unconstrained binary optimization problem (QUBO), and further develop a tool flow embedding the proposed QUBO to the architecture of the commercialized quantum computer D-Wave. By leveraging electronic design automation techniques including synthesis, placement and routing, this is not only the first work providing the detail flow that embeds the QUBO, but also a technique scalable for real world applications and some hard SAT problems with over 6000 variables in QUBO. Based on our results, we discuss the challenges in solving SAT using the current generation of annealing device, and explore the problem solving capability of future quantum annealing computers.

ACM/IEEE Design Automation Conference (DAC)•May 25, 2016•39 citations
Quantum computers have the potential of solving problems more efficiently than classical computers. While first commercial prototypes have become available, the performance of such machines in practical application is still subject to exploration. Quantum computers will not entirely replace classical machines, but serve as accelerators for specific problems. This necessitates integrating quantum computational primitives into existing applications.
The utility of satisfiability (SAT) as an application focused hard computational problem is well established. We explore the potential of quantum annealing to enhance classical SAT solving, especially where sampling from the space of all possible solutions is of interest. We address the formulation of SAT problems to make them suitable for commercial quantum annealers, practical concerns in their implementation, and how the performance of the resulting quantum solver compares to and complements classical SAT solvers.
To date, conventional computers have never been able to efficiently handle certain tasks, where the number of computation steps is likely to blow up as the problem size increases. As an emerging technology and new computing paradigm, quantum computing has a great potential to tackle those hard tasks efficiently. Among all the existing quantum computation models, quantum annealing has drawn significant attention in recent years due to the realization of the commercialized quantum annealer, sparking research interests in developing applications to solve problems that are intractable for classical computers.However, designing and implementing algorithms that manage to harness the enormous computation power from quantum annealer remains a challenging task. Generally, it requires mapping of the given optimization problem into quadratic unconstrained binary optimization(QUBO) problem and embedding the subsequent QUBO onto the physical architecture of quantum annealer. Additionally, practical quantum annealers are susceptible to errors leading to low probability of the correct solution.In this study, we focus on solving Boolean satisfiability (SAT) problem using quantum annealer while addressing practical limitations. We have proposed a mapping technique that maps SAT problem to QUBO, and we have further devised a tool flow that embeds the QUBO onto the architecture of a quantum annealing device. Additionally, We have optimized the proposed embedding flow to reduce run-time in addition to shortening the qubit chain length, leading to robust quantum annealing. To further improve the reliability of quantum annealing, we have also developed a post processing embedding technique that enlarges the energy gap between ground state and the first excited state. To demonstrate the effectiveness of proposed methods, we have conducted experiments on real quantum annealing devices manufactured by D-Wave Systems, showing compelling result of using quantum annealer to solve SAT problem.
Quantum annealing (QA) is a promising calculation method for obtaining a better solution to combinatorial optimization problems. QA is a natural computation technique proposed in the context of statistical physics in 1998. In 2011, the world's first commercial machine realizing QA experimentally was released. After that, the development of hardware and software has been exhaustive, and the studies on application search have been done using commercial QA machines. In this paper, we first explain the basics of QA without assuming the knowledge of statistical physics and quantum physics. We also show a couple of examples of application studies on QA. In addition, existing problems and overcoming other methods are explained.
Quantum computing is an important developing technology with the potential to revolutionise the landscape of scientific and business problems that can be practically addressed. The widespread excitement derives from the potential for a fault tolerant quantum computer to solve previously intractable problems. Such a machine is not expected to be available until 2030 at least. Thus we are currently in the so-called NISQ era where more heuristic quantum approaches are being applied to early versions of quantum hardware. In this paper we seek to provide a more accessible explanation of many of the more technical aspects of quantum computing in the current NISQ era exploring the 2 main hybrid classical-quantum algorithms, QAOA and VQE, as well as quantum annealing. We apply these methods, to an example of combinatorial optimisation in the form of a facilities location problem. Methods explored include the applications of different types of mixer (X, XY and a novel 3XY mixer) within QAOA as well as the effects of many settings for important meta parameters, which are often not focused on in research papers. Similarly, we explore alternative parameter settings in the context of quantum annealing. Our research confirms the broad consensus that quantum gate hardware will need to be much more capable than is available currently in terms of scale and fidelity to be able to address such problems at a commercially valuable level. Quantum annealing is closer to offering quantum advantage but will also need to achieve a significant step up in scale and connectivity to address optimisation problems where classical solutions are sub-optimal.
Quantum computing has emerged as a promising method for solving combinatorial optimization problems. These problems are often encoded as the Satisfiability (SAT) problem. In this study, we explore the quantum annealing based approach to solving the SAT problems. We conduct experiments on uniformly random 3-CNF instances that have 400 propositional variables and 1,000 to 2,499 clauses. We measure the time required to solve them using Fixstars Amplify Annealing Engine. The results show that the monotonic increase in solving time as the number of clauses increases, except for a discontinuity point at approximately 1,800 clauses. In addition, we observe some cases of false UNSAT reports. Our findings demonstrate both the characteristics and the limitations of this quantum annealing based solver. We plan to reproduce the solver on a local machine to inspect the performance when varying the parameters of the quantum annealing and the environment.
Quantum annealing device has shown a great potential in solving discrete problems that are theoretically and empirically hard. Boolean Satisfiability (SAT) problem, determining if there is an assignment of variables that satisfies a given Boolean function, is the first proven NP-complete problem widely used in various domains. Here, we present a novel mapping of the SAT problem to the quadratic unconstrained binary optimization problem (QUBO), and further develop a tool flow embedding the proposed QUBO to the architecture of the commercialized quantum computer D-Wave. By leveraging electronic design automation techniques including synthesis, placement and routing, this is not only the first work providing the detail flow that embeds the QUBO, but also a technique scalable for real world applications and some hard SAT problems with over 6000 variables in QUBO. Based on our results, we discuss the challenges in solving SAT using the current generation of annealing device, and explore the problem solving capability of future quantum annealing computers.