Related papers: Quantum Annealing-Based Software Components: An Ex…
Using Quantum Computers to solve problems in Recommender Systems that classical computers cannot address is a worthwhile research topic. In this paper, we use Quantum Annealers to address the feature selection problem in recommendation…
Using a specially constructed set of hard 2-SAT problems with four satisfying assignments, we study the scaling and sampling performance of numerical simulation of quantum annealing as well as that of the physical quantum annealers offered…
Quantum hardware has the potential to efficiently solve computationally difficult problems in physics and chemistry to reap enormous practical rewards. Analogue quantum simulation accomplishes this by using the dynamics of a controlled…
Quantum computers are hypothetical devices, based on quantum physics, that would enable us to perform certain computations hundreds of orders of magnitude faster than digital computers. This feature is coined as "quantum supremacy" and one…
Classical program analysis techniques, such as abstract interpretation and symbolic execution, are essential for ensuring software correctness, optimizing performance, and enabling compiler optimizations. However, these techniques face…
We present a comparison study of state-of-the-art classical optimisation methods to a D-Wave 2000Q quantum annealer for the planning of Earth observation missions. The problem is to acquire high value images while obeying the attitude…
A quantum algorithm is proposed to solve the Satisfiability problems by the ground-state quantum computer. The scale of the energy gap of the ground-state quantum computer is analyzed for the 3-bit Exact Cover problem. The time cost of this…
Quantum computing promises to tackle technological and industrial problems insurmountable for classical computers. However, today's quantum computers still have limited demonstrable functionality, and it is expected that scaling up to…
Hybrid algorithms that combine quantum and classical resources have become commonplace in quantum computing. The variational quantum eigensolver (VQE) is routinely used to solve prototype problems. Currently, hybrid algorithms use no more…
Quantum annealing has emerged as a powerful tool for solving combinatorial optimization problems efficiently, making use of the principles of quantum mechanics. Companies are increasingly investing in the market of quantum computers,…
Quantum annealing processors typically control qubits in unison, attenuating quantum fluctuations uniformly until the applied system Hamiltonian is diagonal in the computational basis. This simplifies control requirements, allowing…
Quantum annealing leverages the properties of interacting quantum spin systems to solve computational problems, typically optimisation problems. Current hardware now has capabilities that can be used to solve condensed matter physics…
Quantum computing is rapidly progressing from theoretical promise to practical implementation, offering significant computational advantages for tasks in optimization, simulation, cryptography, and machine learning. However, its integration…
We assess the prospects for algorithms within the general framework of quantum annealing (QA) to achieve a quantum speedup relative to classical state of the art methods in combinatorial optimization and related sampling tasks. We argue for…
Utilizing present and futuristic Quantum Computers to solve difficult problems in different domains has become one of the main endeavors at this moment. Of course, in arriving at the requisite solution both quantum and classical computers…
For the last few decades, classical machine learning has allowed us to improve the lives of many through automation, natural language processing, predictive analytics and much more. However, a major concern is the fact that we're fast…
Quantum simulation is a potentially powerful application of quantum computing, holding the promise to be able to emulate interesting quantum systems beyond the reach of classical computing methods. Despite such promising applications, and…
The use of Boolean Satisfiability (SAT) solver for hardware verification incurs exponential run-time in several instances. In this work we have proposed an efficient quantum SAT (qSAT) solver for equivalence checking of Boolean circuits…
Quantum computing is gaining increased attention as a potential way to speed up simulations of physical systems, and it is also of interest to apply it to simulations of classical plasmas. However, quantum information science is…
Despite remarkable achievements in its practical tractability, the notorious class of NP-complete problems has been escaping all attempts to find a worst-case polynomial time-bound solution algorithms for any of them. The vast majority of…