English
Related papers

Related papers: Excited-State Adiabatic Quantum Computation Starte…

200 papers

Adiabatic quantum control is a powerful tool for quantum engineering and a key component in some quantum computation models, where accurate control over the timing of the involved pulses is not needed. However, the adiabatic condition…

Quantum Physics · Physics 2017-06-14 Bao-Jie Liu , Zhen-Hua Huang , Zheng-Yuan Xue , Xin-Ding Zhang

Estimating molecular ground-state energies is a central application of quantum computing, requiring both the preparation of accurate quantum states and efficient energy readout. Understanding the effect of hardware noise on these…

Quantum Physics · Physics 2025-12-23 Ludwig Nützel , Michael J. Hartmann , Henrik Dreyer , Etienne Granet

Entangled many-body states are a key resource for quantum technologies. Yet their preparation through analog control of interacting quantum systems is often hindered by experimental imperfections. Here, we introduce the adiabatic echo…

We review recent theoretical work on two closely related issues: excitation of an isolated quantum condensed matter system driven adiabatically across a continuous quantum phase transition or a gapless phase, and apparent relaxation of an…

Quantum Gases · Physics 2015-05-14 Jacek Dziarmaga

Quantum pumping, in its different forms, is attracting attention from different fields, from fundamental quantum mechanics, to nanotechnology, to superconductivity. We investigate the crossover of quantum pumping from the adiabatic to the…

Quantum computing may provide advantage in solving classical optimization problems. One promising algorithm is the quantum approximate optimization algorithm (QAOA). There have been many proposals for improving this algorithm, such as using…

Quantum Physics · Physics 2023-10-17 Vishvesha K. Sridhar , Yanzhu Chen , Bryan Gard , Edwin Barnes , Sophia E. Economou

Preparing the ground state of a Hamiltonian is a problem of great significance in physics with deep implications in the field of combinatorial optimization. The adiabatic algorithm is known to return the ground state for sufficiently long…

Quantum Physics · Physics 2023-08-02 Benjamin F. Schiffer , Jordi Tura , J. Ignacio Cirac

The evolution of a driven quantum system is said to be adiabatic whenever the state of the system stays close to an instantaneous eigenstate of its time-dependent Hamiltonian. The celebrated quantum adiabatic theorem ensures that such pure…

Quantum Physics · Physics 2021-10-04 Nikolai Il`in , Anastasia Aristova , Oleg Lychkovskiy

Adiabatic quantum computing is a promising route to the computational power afforded by quantum information processing. The recent availability of adiabatic hardware has raised challenging questions about how to evaluate adiabatic quantum…

Drawing inspiration from the Lyapunov control technique for quantum systems, feedback-based quantum algorithms have been proposed for calculating the ground states of Hamiltonians. In this work, we consider extending these algorithms to…

Quantum Physics · Physics 2024-07-23 Salahuddin Abdul Rahman , Özkan Karabacak , Rafal Wisniewski

Shortcuts to adiabaticity (STA) are powerful quantum control methods, allowing quick evolution into target states of otherwise slow adiabatic dynamics. Such methods have widespread applications in quantum technologies, and various STA…

Quantum Physics · Physics 2022-02-02 Zelong Yin , Chunzhen Li , Jonathan Allcock , Yicong Zheng , Xiu Gu , Maochun Dai , Shengyu Zhang , Shuoming An

The preparation of quantum states using short quantum circuits is one of the most promising near-term applications of small quantum computers, especially if the circuit is short enough and the fidelity of gates high enough that it can be…

Quantum Physics · Physics 2015-10-07 D. Wecker , M. B. Hastings , M. Troyer

In quantum adiabatic evolution algorithms, the quantum computer follows the ground state of a slowly varying Hamiltonian. The ground state of the initial Hamiltonian is easy to construct; the ground state of the final Hamiltonian encodes…

Quantum Physics · Physics 2007-05-23 Edward Farhi , Jeffrey Goldstone , Sam Gutmann

Quantum dot cellular automata (QCA) computing schemes use arrays of quantum dots as computational devices. Typically, these operate ideally by maintaining arrays in their ground state to ensure correct computational output. For large QCA…

Quantum Physics · Physics 2017-04-14 Daniel Brox

We present the first direct comparison between gate-based quantum computing (GQC) and adiabatic quantum computing (AQC) paradigms for solving the AC power flow (PF) equations. The PF problem is reformulated as a combinatorial optimization…

Quantum Physics · Physics 2026-03-09 Zeynab Kaseb , Matthias Moller , Peter Palensky , Pedro P. Vergara

The blind quantum computing protocols (BQC) enable a classical client with limited quantum technology to delegate a computation to the quantum server(s) in such a way that the privacy of the computation is preserved. Here we present a new…

Quantum Physics · Physics 2014-11-19 Tomoyuki Morimae , Vedran Dunjko , Elham Kashefi

Adiabatic state engineering is a powerful technique in quantum information and quantum control. However, its performance is limited by the adiabatic theorem of quantum mechanics. In this scenario, shortcuts to adiabaticity, such as provided…

Quantum Physics · Physics 2015-11-03 Alan C. Santos , Marcelo S. Sarandy

Quantum electrodynamics in 1 + 1D (QED2) shares intriguing properties with QCD, including confinement, string breaking, and interesting phase diagram when the non-trivial topological $\theta$-term is considered. Its lattice regularization…

High Energy Physics - Lattice · Physics 2024-11-05 Matteo D'Anna , Marina Krstic Marinkovic , Joao C. Pinto Barros

We consider the optimal driving of the ground state of a many-body quantum system across a quantum phase transition in finite time. In this context, excitations caused by the breakdown of adiabaticity can be minimized by adjusting the…

Quantum Physics · Physics 2025-02-17 András Grabarits , Federico Balducci , Barry C. Sanders , Adolfo del Campo

The discrete formulation of adiabatic quantum computing is compared with other search methods, classical and quantum, for random satisfiability (SAT) problems. With the number of steps growing only as the cube of the number of variables,…

Quantum Physics · Physics 2009-11-07 Tad Hogg