Related papers: Temperature scaling law for quantum annealing opti…
Recent developments in quantum annealing techniques have been indicating potential advantage of quantum annealing for solving NP-hard optimization problems. In this article we briefly indicate and discuss the beneficial features of quantum…
One of the central applications for quantum annealers is to find the solutions of Ising problems. Suitable Ising problems, however, need to be formulated such that they, on the one hand, respect the specific restrictions of the hardware…
We present a modified simulated annealing method with a dynamical choice of the cooling temperature. The latter is determined via a closed-loop control and is proven to yield exponential decay of the entropy of the particle system. The…
Cooling of a quantum system is limited by the size of the control forces that are available (the "speed" of control). We consider the most general cooling process, albeit restricted to the regime in which the thermodynamics of the system is…
Quantum annealing provides a powerful platform for simulating magnetic materials and realizing statistical physics models, presenting a compelling alternative to classical Monte Carlo methods. We demonstrate that quantum annealers can…
Quantum annealing devices have been subject to various analyses in order to classify their usefulness for practical applications. While it has been successfully proven that such systems can in general be used for solving combinatorial…
In the study of thermalization in finite isolated quantum systems, an inescapable issue is the definition of temperature. We examine and compare different possible ways of assigning temperatures to energies or equivalently to eigenstates in…
Recent advances in quantum technology have led to the development and manufacturing of experimental programmable quantum annealers that promise to solve certain combinatorial optimization problems of practical relevance faster than their…
We introduce quantum fluctuations into the simulated annealing process of optimization problems, aiming at faster convergence to the optimal state. The idea is tested by the two models, the transverse Ising model and the traveling salesman…
In most studies for the quantification of the third thermodynamic law, the minimum temperature which can be achieved with a long but finite-time process scales as a negative power of the process duration. In this article, we use our recent…
Finding the global minimum in a rugged potential landscape is a computationally hard task, often equivalent to relevant optimization problems. Simulated annealing is a computational technique which explores the configuration space by…
The protocol of quantum annealing is applied to an optimization problem with a one-dimensional continuous degree of freedom, a variant of the problem proposed by Shinomoto and Kabashima. The energy landscape has a number of local minima,…
Cooling quantum systems is arguably one of the most important thermodynamic tasks connected to modern quantum technologies and an interesting question from a foundational perspective. It is thus of no surprise that many different…
We consider a regular chain of elementary quantum systems with nearest neighbor interactions and assume that the total system is in a canonical state with temperature $T$. We analyze under what condition the state factors into a product of…
We introduce quantum fluctuations into the simulated annealing process of optimization problems, aiming at faster convergence to the optimal state. Quantum fluctuations cause transitions between states and thus play the same role as thermal…
We study the problem of dynamic cooling whereby a target qubit is cooled at the expense of heating up $N-1$ further identical qubits, by means of a global unitary operation. A standard back-of-the-envelope high temperature estimate…
Quantum annealing is a heuristic quantum optimization algorithm that can be used to solve combinatorial optimization problems. In recent years, advances in quantum technologies have enabled the development of small- and intermediate-scale…
We present a general error-correcting scheme for quantum annealing that allows for the encoding of a logical qubit into an arbitrarily large number of physical qubits. Given any Ising model optimization problem, the encoding replaces each…
In a recent study (Ref. [1]), quantum annealing was reported to exhibit a scaling advantage for approximately solving Quadratic Unconstrained Binary Optimization (QUBO). However, this claim critically depends on the choice of classical…
Performances of the symmetric universal and phase-covariant cloning transformations and entanglement cloners -- qubit case -- are investigated when the initial state of the hardware or the original state to be cloned is weakly coupled to a…