Related papers: Finite temperature quantum annealing solving expon…
Quantum annealing aims at finding optimal solutions to complex optimization problems using a suitable quantum many body Hamiltonian encoding the solution in its ground state. To find the solution one typically evolves the ground state of a…
Quantum information processing offers dramatic speedups, yet is famously susceptible to decoherence, the process whereby quantum superpositions decay into mutually exclusive classical alternatives, thus robbing quantum computers of their…
Quantum annealing is a method to solve optimization problems that leverages quantum tunneling in a coupled qubit system. We present a detailed study of the coherence of a tunable capacitively-shunted flux qubit, designed for coherent…
New exact results about the nonequilibrium thermodynamics of open quantum systems at arbitrary timescales are obtained by considering all possible variations of initial conditions of a system, its environment, and correlations between them.…
An approach is proposed to nuclear pairing at finite temperature and angular momentum, which includes the effects of the quasiparticle-number fluctuation and dynamic coupling to pair vibrations within the self-consistent quasiparticle…
We explore the potential application of quantum annealing to address the protein structure problem. To this end, we compare several proposed ab initio protein folding models for quantum computers and analyze their scaling and performance…
We investigate the use of quantum computing algorithms on real quantum hardware to tackle the computationally intensive task of feature selection for light-weight medical image datasets. Feature selection is often formulated as a k of n…
We introduce and review briefly the phenomenon of quantum annealing and analog computation. The role of quantum fluctuation (tunneling) in random systems with rugged (free) energy landscapes having macroscopic barriers are discussed to…
A promising approach to solving hard binary optimisation problems is quantum adiabatic annealing (QA) in a transverse magnetic field. An instantaneous ground state --- initially a symmetric superposition of all possible assignments of $N$…
In reverse quantum annealing, the initial state is an eigenstate of the final problem Hamiltonian and the transverse field is cycled rather than strictly decreased as in standard (forward) quantum annealing. We present a numerical study of…
A theoretical and numerical investigations of the quantum tunneling of the domain walls in ferromagnets and weak ferromagnets was performed taking into account the interaction between walls and thermal excitations of a crystal. The…
Temperature effect on quantum tunneling in a Cooper-pair-box coupled to a quantum oscillator is studied by both numerical and analytical calculations. It is found that, in strong coupling regions, coherent tunneling of a Cooper-pair-box can…
A significant challenge in quantum annealing is to map a real-world problem onto a hardware graph of limited connectivity. If the maximum degree of the problem graph exceeds the maximum degree of the hardware graph, one employs minor…
Reverse annealing is a variant of quantum annealing, in which the system is prepared in a classical state, reverse-annealed to an inversion point, and then forward-annealed. We report on reverse annealing experiments using the D-Wave 2000Q…
We show for the one-dimensional quantum $XY$ model with $s=1/2$ that the energy gap between the ground and first excited states behaves anomalously as a function of the system size at the first-order quantum phase transition. Although it is…
Estimating partition functions of Ising spin glasses is a cornerstone of statistical physics and computational science, yet it remains classically challenging due to its $\#$P-hard complexity. While Jarzynski's equality offers a theoretical…
The D-wave processor is a partially controllable open quantum system which exchanges energy with its surrounding environment (in the form of heat) and with the external time dependent control fields (in the form of work). Despite being…
Quantum annealing is a heuristic optimization algorithm that exploits quantum evolution to approximately find lowest energy states. Quantum annealers have scaled up in recent years to tackle increasingly larger and more highly connected…
The exactly solvable model of a one dimensional isotropic XY spin chain is employed to study the thermodynamics of open systems. For this purpose the chain is subdivided into two parts, one part is considered as the system while the rest as…
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…