Related papers: Rigorous convergence condition for quantum anneali…
We study the ground-state properties of a quantum "sunburst model", composed of a quantum Ising spin-ring in a transverse field, symmetrically coupled to a set of ancillary isolated qubits, to maintain a residual translation invariance and…
We study the quantum phase transition in the two-dimensional random Ising model in a transverse field by Monte Carlo simulations. We find results similar to those known analytically in one-dimension: the dynamical exponent is infinite and,…
We investigate a quantum annealing approach based on real-time quantum dynamics for graph coloring. In this approach, a driving Hamiltonian is chosen so that constraints are naturally satisfied without penalty terms, and the dimension of…
The Hubbard model has occupied the minds of condensed matter physicists for most part of the last century. This model provides insight into a range of phenomena in correlated electron systems. We wish to examine the paradigm of quantum…
Characterizing thermally activated transitions in high-dimensional rugged energy surfaces is a very challenging task for classical computers. Here, we develop a quantum annealing scheme to solve this problem. First, the task of finding the…
We study the adiabatic limit for the sequential passage of atoms through a high-Q cavity, in the presence of frequency chirps. Despite the fact that the adiabatic approximation might be expected to fail, we were able to show that for proper…
We study first-order quantum phase transitions in models where the mean-field traitment is exact, and the exponentially fast closure of the energy gap with the system size at the transition. We consider exactly solvable ferromagnetic…
Current generation quantum annealers have already proven to be successful problem-solvers. Yet, quantum annealing is still very much in its infancy, with suboptimal applicability. For instance, to date it is still an open question which…
Computational complexity theory contains a corpus of theorems and conjectures regarding the time a Turing machine will need to solve certain types of problems as a function of the input size. Nature {\em need not} be a Turing machine and,…
We propose a universal inequality that unifies the Bousso bound with the classical focussing theorem. Given a surface $\sigma$ that need not lie on a horizon, we define a finite generalized entropy $S_\text{gen}$ as the area of $\sigma$ in…
We formulate a passive quantum detector based on a quantum hypothesis testing framework under the setting of finite sample size. In particular, we exploit the fundamental limits of performance of the passive quantum detector asymptotically.…
Via the AdS/CFT correspondence, fundamental constraints on the entanglement structure of quantum systems translate to constraints on spacetime geometries that must be satisfied in any consistent theory of quantum gravity. In this paper, we…
We study conformal field theories with boundaries, and their boundary renormalization group (RG) flows, using methods from quantum information theory. Positivity of the relative entropy, together with unitarity and Lorentz invariance, give…
Continuous-time quantum algorithms for combinatorial optimisation problems, such as quantum annealing, have previously been motivated by the adiabatic principle. A number of continuous-time approaches exploit dynamics, however, and…
Quantum enhanced sensing provides a powerful tool for the precise measurement of physical parameters that is applicable in many areas of science and technology. The achievable gain in sensitivity is largely limited by the influence of noise…
We compare the performance of quantum annealing (QA, through Schr\"odinger dynamics) and simulated annealing (SA, through a classical master equation) on the $p$-spin infinite range ferromagnetic Ising model, by slowly driving the system…
A general time-dependent quantum system can be driven fast from its initial ground state to its final ground state without generating transitions by adding a steering term to the Hamiltonian. We show how this technique can be modified to…
Since the discovery of adiabatic quantum computing, a need has arisen for rigorously proven bounds for the error in the adiabatic approximation. We present in this paper, a rigorous and elementary derivation of upper and lower bounds on the…
We develop an intuitive geometric picture of quantum states, define a particular state distance, and derive a quantum speed limit (QSL) for open systems. Our QSL is attainable because any initial state can be driven to a final state by the…
In adiabatic quantum annealing, the speed with which an anneal can be run, while still achieving a high final ground state fidelity, is dictated by the size of the minimum gap that appears between the ground and first excited state in the…