English
Related papers

Related papers: Adiabatic state preparation from general initial s…

200 papers

In this paper we study up to which extent we can apply adiabatic control strategies to a quantum control model obtained by rotating wave approximation. In particular, we show that, under suitable assumptions on the asymptotic regime between…

Optimization and Control · Mathematics 2021-01-12 Nicolas Augier , Ugo Boscain , Mario Sigalotti

Quantum algorithms for ground-state energy estimation of chemical systems require a high-quality initial state. However, initial state preparation is commonly either neglected entirely, or assumed to be solved by a simple product state like…

Adiabatic passage employs a slowly varying time-dependent Hamiltonian to control the evolution of a quantum system along the Hamiltonian eigenstates. For processes of finite duration, the exact time evolving state may deviate from the…

Quantum Physics · Physics 2021-06-18 Albert Benseny , Klaus Mølmer

Exploring the ground state properties of many-body quantum systems conventionally involves adiabatic processes, alongside exact diagonalization, in the context of quantum annealing or adiabatic quantum computation. Shortcuts to adiabaticity…

Adiabatic process has found many important applications in modern physics, the distinct merit of which is that it does not need accurate control over the timing of the process. However, it is a slow process, which limits the application in…

Quantum Physics · Physics 2017-10-11 Xiao Zhou , Bao-Jie Liu , L. -B. Shao , Xin-Ding Zhang , Zheng-Yuan Xue

Finding a local Hamiltonian $\hat{\mathcal{H}}$ having a given many-body wavefunction $|\psi\rangle$ as its ground state, i.e. a parent Hamiltonian, is a challenge of fundamental importance in quantum technologies. Here we introduce a…

We use local adiabatic evolution to experimentally create and determine the ground state spin ordering of a fully-connected Ising model with up to 14 spins. Local adiabatic evolution -- in which the system evolution rate is a function of…

Quantum Physics · Physics 2013-09-02 Philip Richerme , Crystal Senko , Jacob Smith , Aaron Lee , Simcha Korenblit , Christopher Monroe

A method is presented to transfer a system of two-level atoms from a spin coherent state to a maximally spin squeezed Dicke state, relevant for quantum metrology and quantum information processing. The initial state is the ground state of…

Quantum Physics · Physics 2016-03-23 Tomáš Opatrný , Hamed Saberi , Etienne Brion , Klaus Mølmer

Recently, the technique of counterdiabatic driving, which provides an effective strategy for accelerating adiabatic quantum evolution, has been widely applied in the preparation of many-body quantum states. In this work, we propose a…

Quantum Physics · Physics 2026-05-15 Fengzhe Tang , Gangcheng Wang

We present two applications of emergent local Hamiltonians to speed up quantum adiabatic protocols for isolated noninteracting and weakly interacting fermionic systems in one-dimensional lattices. We demonstrate how to extract maximal work…

Statistical Mechanics · Physics 2017-10-31 Ranjan Modak , Lev Vidmar , Marcos Rigol

This thesis investigates quantum algorithms for eigenstate preparation, with a focus on solving eigenvalue problems such as the Schrodinger equation by utilizing near-term quantum computing devices. These problems are ubiquitous in several…

Quantum Physics · Physics 2024-12-20 Joey Bonitati

The adiabatic approximation is well-known method for effective study of few-body systems in molecular, atomic and nuclear physics, using the idea of separation of "fast" and "slow" variables. The generalization of the standard adiabatic…

Mesoscale and Nanoscale Physics · Physics 2015-03-17 A. A. Gusev , O. Chuluunbaatar , V. P. Gerdt , B. L. Markovski , V. V. Serov , S. I. Vinitsky

We describe a protocol for preparing the ground state of a Hamiltonian $H$ on a quantum computer. This is done by designing a quantum algorithm that implements the imaginary time evolution operator: $e^{-\tau H}$. The method relies on the…

Quantum Physics · Physics 2023-06-28 Charles Marteau

By performing a slow adiabatic change between two traps of a quantum particle, it is possible to transform an eigenstate of the original trap into the corresponding eigenstate of the final trap. If no level crossings are involved, the…

Quantum Physics · Physics 2016-12-28 S. Martínez-Garaot , M. Palmero , J. G. Muga , D. Guéry-Odelin

The efficient preparation of quantum states is an important step in the execution of many quantum algorithms. In the noisy intermediate-scale quantum (NISQ) computing era, this is a significant challenge given quantum resources are scarce…

Quantum Physics · Physics 2023-02-23 Floyd M. Creevey , Charles D. Hill , Lloyd C. L. Hollenberg

Preparation of Gibbs distributions is an important task for quantum computation. It is a necessary first step in some types of quantum simulations and further is essential for quantum algorithms such as quantum Boltzmann training. Despite…

Quantum Physics · Physics 2020-02-04 Anirban N. Chowdhury , Guang Hao Low , Nathan Wiebe

The simulation of the dynamics of a system coupled to a low-temperature environment is a promising application of quantum computers to determine ground-state properties of physical systems. However, this approach requires not only the…

Quantum Physics · Physics 2025-05-15 Tianren Wang , Zongkang Zhang , Bing-Nan Lu , Mauro Cirio , Ying Li

Within the present noisy intermediate-scale quantum-computing era, hybrid quantum-classical-processor algorithms have emerged as promising avenues for tackling electronic-structure eigenproblems. Among them, the so-called…

Quantum Physics · Physics 2026-05-21 Christophe Soule , Bruno Senjean , Benjamin Lasorne

Preparation of quantum thermal states of many-body systems is a key computational challenge for quantum processors, with applications in physics, chemistry, and classical optimization. We provide a simple and efficient algorithm for thermal…

Quantum Physics · Physics 2026-03-18 Jerome Lloyd , Dmitry A. Abanin

We construct a set of instances of 3SAT which are not solved efficiently using the simplest quantum adiabatic algorithm. These instances are obtained by picking random clauses all consistent with two disparate planted solutions and then…

Quantum Physics · Physics 2012-03-30 Edward Farhi , Jeffrey Goldstone , David Gosset , Sam Gutmann , Harvey B. Meyer , Peter Shor