Results 51 to 60 of about 1,815,218 (351)
Customized Quantum Annealing Schedules
In a typical quantum annealing protocol, the system starts with a transverse field Hamiltonian which is gradually turned off and replaced by a longitudinal Ising Hamiltonian. The ground state of the Ising Hamiltonian encodes the solution to the computational problem of interest, and the state overlap with this ground state gives the success probability
Mostafa Khezri +5 more
openaire +2 more sources
Single-Qubit Fidelity Assessment of Quantum Annealing Hardware
As a wide variety of quantum computing platforms become available, methods for assessing and comparing the performance of these devices are of increasing interest and importance.
Jon Nelson +3 more
doaj +1 more source
Hybrid Quantum Annealing for Larger-than-QPU Lattice-structured Problems [PDF]
Quantum processing units (QPUs) executing annealing algorithms have shown promise in optimization and simulation applications. Hybrid algorithms are a natural bridge to larger applications.
Jack Raymond +8 more
semanticscholar +1 more source
Molecular dynamics on quantum annealers
AbstractIn this work we demonstrate a practical prospect of using quantum annealers for simulation of molecular dynamics. A methodology developed for this goal, dubbed Quantum Differential Equations (QDE), is applied to propagate classical trajectories for the vibration of the hydrogen molecule in several regimes: nearly harmonic, highly anharmonic ...
Gaidai, Igor +7 more
openaire +4 more sources
Improving Urban Traffic Mobility via a Versatile Quantum Annealing Model
The growth of cities and the resulting increase in vehicular traffic pose significant challenges to the environment and citizens' quality of life.
Andrea Marchesin +4 more
semanticscholar +1 more source
A Review of Machine Learning Classification Using Quantum Annealing for Real-World Applications [PDF]
Optimizing the training of a machine learning pipeline helps in reducing training costs and improving model performance. One such optimizing strategy is quantum annealing, which is an emerging computing paradigm that has shown potential in optimizing the
R. K. Nath, H. Thapliyal, T. Humble
semanticscholar +1 more source
How to Solve Combinatorial Optimization Problems Using Real Quantum Machines: A Recent Survey
A combinatorial optimization problem (COP) is the problem of finding the optimal solution in a finite set. When the size of the feasible solution set is large, the complexity of the problem increases, and it is not easy to solve in a reasonable time with
Sovanmonynuth Heng +3 more
doaj +1 more source
Quantum versus classical annealing: insights from scaling theory and results for spin glasses on 3-regular graphs [PDF]
We discuss an Ising spin glass where each $S=1/2$ spin is coupled antiferromagnetically to three other spins (3-regular graphs). Inducing quantum fluctuations by a time-dependent transverse field, we use out-of-equilibrium quantum Monte Carlo simulations
Liu, Cheng-Wei +2 more
core +1 more source
Solving larger maximum clique problems using parallel quantum annealing [PDF]
Quantum annealing has the potential to find low energy solutions of NP-hard problems that can be expressed as quadratic unconstrained binary optimization problems.
Elijah Pelofske, Georg Hahn, H. Djidjev
semanticscholar +1 more source
Fuzzy Logic on Quantum Annealers [PDF]
Quantum computation is going to revolutionize the world of computing by enabling the design of massive parallel algorithms that solve hard problems in an efficient way, thanks to the exploitation of quantum mechanics effects, such as superposition, entanglement and interference.
Acampora G. +2 more
openaire +2 more sources

