相关论文: Quantum Annealing in a Kinetically Constrained Sys…
We describe a computational investigation of tunneling at finite energy in a weakly coupled quantum mechanical system with two degrees of freedom. We compare a full quantum mechanical analysis to the results obtained by making use of a…
We propose a framework to solve non-linear and history-dependent mechanical problems based on a hybrid classical computer -- quantum annealer approach. Quantum Computers are anticipated to solve particular operations exponentially faster.…
Kinetically constrained spin systems play an important role in understanding key properties of the dynamics of slowly relaxing materials, such as glasses. So far kinetic constraints have been introduced in idealised models aiming to capture…
Geometric frustration in two-dimensional Ising models allows for a wealth of exotic universal behavior, both Ising and non-Ising, in the presence of quantum fluctuations. In particular, the triangular antiferromagnet and Villain model in a…
Quantum computing holds the promise of substantially speeding up computationally expensive tasks, such as solving optimization problems over a large number of elements. In high-energy collider physics, quantum-assisted algorithms might…
The transport of ultra-cold atoms in magneto-optical potentials provides a clean setting in which to investigate the distinct predictions of classical versus quantum dynamics for a system with coupled degrees of freedom. In this system,…
We compare the classical and quantum mechanical position-space probability densities for a particle in an asymmetric infinite well. In an idealized system with a discontinuous step in the middle of the well, the classical and quantum…
I describe how real quantum annealers may be used to perform local (in state space) searches around specified states, rather than the global searches traditionally implemented in the quantum annealing algorithm. The quantum annealing…
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…
Two objects can be distinguished if they have different measurable properties. Thus, distinguishability depends on the Physics of the objects. In considering graphs, we revisit the Ising model as a framework to define physically meaningful…
Providing an optimal path to a quantum annealing algorithm is key to finding good approximate solutions to computationally hard optimization problems. Reinforcement is one of the strategies that can be used to circumvent the exponentially…
The simplest one-dimensional model for the studying of non-trivial geometrical effects is a ring shaped device which is formed by joining two arms. We explore the possibility to model such a system as a two level system (TLS). Of particular…
We derive lower bounds on the time needed for a quantum annealer to prepare the ground state of a target Hamiltonian. These bounds do not depend on the annealing schedule and can take the local structure of the Hamiltonian into account.…
To enhance the performance of quantum annealing machines, several methods have been proposed to reduce the number of spins by fixing spin values through preprocessing. We proposed a hybrid optimization method that combines a simulated…
We study quantum tunneling in an asymmetric double-well potential using a dynamical systems--based approach rooted in the Ehrenfest formalism. In this framework, the time evolution of a Gaussian wave packet is governed by a hierarchy of…
The recent emergence of novel computational devices, such as quantum computers, coherent Ising machines, and digital annealers presents new opportunities for hardware-accelerated hybrid optimization algorithms. Unfortunately, demonstrations…
Quantum annealing is a generic solver for optimization problems that uses fictitious quantum fluctuation. The most groundbreaking progress in the research field of quantum annealing is its hardware implementation, i.e., the so-called…
We show how a digitized version of Quantum Annealing can be made optimal, realizing the best possible solution allowed by quantum mechanics in the shortest time, without any prior knowledge on the location and properties of the spectral…
The recent availability of the first commercial quantum computers has provided a promising tool to tackle NP hard problems which can only be solved heuristically with present techniques. However, it is unclear if the current state of…
The theory of quantum quenches in near-critical one-dimensional systems formulated in [J. Phys. A 47 (2014) 402001] yields analytic predictions for the dynamics, unveils a qualitative difference between non-interacting and interacting…