相关论文: Quantum Annealing in a Kinetically Constrained Sys…
A system of trapped ions under the action of off--resonant standing--waves can be used to simulate a variety of quantum spin models. In this work, we describe theoretically quantum phases that can be observed in the simplest realization of…
Process of quantum tunneling of particles in various physical systems can be effectively controlled even by a weak and slow varying in time electromagnetic signal if to adapt specially its shape to a particular system. During an…
Annealing approach to quantum tomography is theoretically proposed. First, based on the maximum entropy principle, we introduce classical parameters to combine "quantum models (or quantum states)" given a prior for potentially representing…
We address an apparent conflict between the traditional canonical quantization framework of quantum theory and the spatially restricted quantum dynamics, when the translation invariance of the otherwise free quantum system is broken by…
The application of quantum annealing to the optimization of continuous-variable functions is a relatively unexplored area of research. We test the performance of quantum annealing applied to a one-dimensional continuous-variable function…
A bit-quantum map relates probabilistic information for Ising spins or classical bits to quantum spins or qubits. Quantum systems are subsystems of classical statistical systems. The Ising spins can represent macroscopic two-level…
Critical phenomena at finite temperature underpin a broad range of physical systems, yet their study remains challenging due to computational bottlenecks near phase transitions. Quantum annealers have attracted significant interest as a…
In this paper we present a novel strategy to solve optimization problems within a hybrid quantum-classical scheme based on quantum annealing, with a particular focus on QUBO problems. The proposed algorithm is based on an iterative…
The quest for real-time dynamic optimization solutions in the process industry represents a formidable computational challenge, particularly within the realm of applications like model-predictive control, where rapid and reliable…
Quantum annealing in a real device is necessarily susceptible to errors due to diabatic transitions and thermal noise. Nested quantum annealing correction is a method to suppress errors by using an all-to-all penalty coupling among a set of…
We study a bifurcation mechanism of quantum annealing. Using spins with quantum number S=1, we construct a simple model to make a bifurcation. The qutrit can be composed by nesting two qubits. We numerically solve the Schroedinger equation…
Quantum annealing is a type of analog computation that aims to use quantum mechanical fluctuations in search of optimal solutions of QUBO (quadratic unconstrained binary optimization) or, equivalently, Ising problems. Since NP-hard problems…
Quantum annealing solves combinatorial optimization problems by finding the energetic ground states of an embedded Hamiltonian. However, quantum annealing dynamics under the embedded Hamiltonian may violate the principles of adiabatic…
It is well known that quantum computers are superior to classical computers in efficiently simulating quantum systems. Here we report the first experimental simulation of quantum tunneling through potential barriers, a widespread phenomenon…
An effective formalism for quantum constrained systems is presented which allows manageable derivations of solutions and observables, including a treatment of physical reality conditions without requiring full knowledge of the physical…
Discrete combinatorial optimization consists in finding the optimal configuration that minimizes a given discrete objective function. An interpretation of such a function as the energy of a classical system allows us to reduce the…
A quantum spin-$\frac{1}{2}$ chain with an axial symmetry is normally described by quasiparticles associated with the spins oriented along the axis of rotation. Kinetic constraints can enrich such a description by setting apart different…
We study the role of Hamiltonian complexity in the performance of quantum annealers. We consider two general classes of annealing Hamiltonians: stoquastic ones, which can be simulated efficiently using the quantum Monte Carlo algorithm, and…
We consider a model of weakly coupled quantum Ising chains. We describe the phase diagram of such a model and study the dynamical magnetic susceptibility by means of Bethe ansatz and the Random Phase Approximation applied to the inter-chain…
A quantum-thermal annealing method using a cluster-flip algorithm is studied in the two-dimensional spin-glass model. The temperature (T) and the transverse field (Gamma) are decreased simultaneously with the same rate along a linear path…