Related papers: Quantum annealing and thermalization: insights fro…
Systems of spin 1, such as triplet pairs of spin-1/2 fermions (like orthohydrogen nuclei) make useful three-terminal elements for quantum computation, and when interconnected by qubit equality relations are universal for quantum…
Quantum annealing is a general strategy for solving difficult optimization problems with the aid of quantum adiabatic evolution. Both analytical and numerical evidence suggests that under idealized, closed system conditions, quantum…
Quantum annealers are an alternative approach to quantum computing which make use of the adiabatic theorem to efficiently find the ground state of a physically realizable Hamiltonian. Such devices are currently commercially available and…
Here we first discuss briefly the quantum annealing technique. We then study the quantum annealing of Sherrington-Kirkpatrick spin glass model with the tuning of both transverse and longitudinal fields. Both the fields are time-dependent…
In this paper we show quantum fluctuation effect of fully frustrated Ising spin systems. Quantum annealing has been expected to be an efficient method to find ground state of optimization problems. However it is not clear when to use the…
Quantum simulation has emerged as a valuable arena for demonstrating and understanding the capabilities of near-term quantum computers. Quantum annealing has been used successfully in simulating a range of open quantum systems, both at…
We developed a non-Hermitian quantum optimization algorithm to find the ground state of the ferromagnetic Ising model with up to 1024 spins (qubits). Our approach leads to significant reduction of the annealing time. Analytical and…
A quantum system coupled to a bath at some fixed, finite temperature converges to its Gibbs state. This thermalization process defines a natural, physically-motivated model of quantum computation. However, whether quantum computational…
In the computational model of quantum annealing, the size of the minimum gap between the ground state and the first excited state of the system is of particular importance, since it is inversely proportional to the running time of the…
The rotational and fine structure of open-shell molecules in a $\Sigma$ electronic state gives rise to crossings between Zeeman states of different parity. These crossings become avoided in the presence of an electric field. We propose an…
In this PhD thesis we investigate some properties of one-dimensional quantum systems, focusing on two important aspects of integrable models: Their entanglement properties at equilibrium and their dynamical correlators after a quantum…
In this review, after providing the basic physical concept behind quantum annealing (or adiabatic quantum computation), we present an overview of some recent theoretical as well as experimental developments pointing to the issues which are…
Quantum annealing method has been widely attracted attention in statistical physics and information science since it is expected to be a powerful method to obtain the best solution of optimization problem as well as simulated annealing. The…
Quantum phase transitions occur at zero temperature and involve the appearance of long-range correlations. These correlations are not due to thermal fluctuations but to the intricate structure of a strongly entangled ground state of the…
Quantum annealing aims to solve combinatorial optimization problems mapped on to Ising interactions between quantum spins. A critical factor that limits the success of a quantum annealer is its sensitivity to noise, and intensive research…
A recent experiment [Lanting et al., PRX, (2014)] claimed to provide evidence of up to $8$-qubit entanglement in a D-Wave quantum annealing device. However, entanglement was measured using qubit tunneling spectroscopy, a technique that…
Demonstrations of quantum advantage for certain sampling problems have generated considerable excitement for quantum computing and have further spurred the development of circuit-model quantum computers, which represent quantum programs as…
Quantum annealing is a generic name of quantum algorithms to use quantum-mechanical fluctuations to search for the solution of optimization problem. It shares the basic idea with quantum adiabatic evolution studied actively in quantum…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
Quantum annealers are emerging as programmable, dynamical experimental platforms for probing strongly correlated spin systems. Yet key thermal assumptions, chiefly a Gibbs-distributed output ensemble, remain unverified in the large-scale…