Related papers: Efficient Adiabatic Preparation of Tensor Network …
In many quantum technologies adiabatic processes are used for coherent quantum state operations, offering inherent robustness to errors in the control parameters. The main limitation is the long operation time resulting from the requirement…
Shortcuts to adiabaticity (STA) are fast methods to realize the same final state evolution of quantum adiabatic process. We develop a general theory to construct a new kind of STA by solely sampling the points of the adiabatic path of the…
Counterdiabatic (CD) driving enables efficient quantum state preparation, but it requires implementing highly nonlocal adiabatic gauge potentials (AGP) that are impractical to compute and realize in large many-body systems. We introduce a…
We devise a quantum-circuit algorithm to solve the ground state and ground energy of artificial graphene. The algorithm implements a Trotterized adiabatic evolution from a purely tight-binding Hamiltonian to one including kinetic,…
Adiabatic state preparation provides an analytical solution for generating the ground state of a target Hamiltonian, starting from an easily prepared ground state of the initial Hamiltonian. While effective for time-dependent Hamiltonians…
Local counterdiabatic driving (CD) provides a feasible approach for realizing approximate reversible/adiabatic processes like quantum state preparation using only local controls and without demanding excessively long protocol times.…
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…
Constructing quantum circuits for efficient state preparation belongs to the central topics in the field of quantum information and computation. As the number of qubits grows fast, methods to derive large-scale quantum circuits are strongly…
Quantum state preparation is a fundamental component of quantum algorithms, particularly in quantum machine learning and data processing, where classical data must be encoded efficiently into quantum states. Existing amplitude encoding…
We propose a method to obtain optimal protocols for adiabatic ground-state preparation near the adiabatic limit, extending earlier ideas from [D. A. Sivak and G. E. Crooks, Phys. Rev. Lett. 108, 190602 (2012)] to quantum non-dissipative…
We develop a scheme of fast forward of adiabatic spin dynamics of quantum entangled states. We settle the quasi-adiabatic dynamics by adding the regularization terms to the original Hamiltonian and then accelerate it with use of a large…
Using the Matrix Product State framework, we generalize the Affleck-Kennedy-Lieb-Tasaki (AKLT) construction to one-dimensional spin liquids with global color ${\rm SU}(N)$ symmetry, finite correlation lengths, and edge states that can…
We present a coherent counter-diabatic quantum protocol to prepare ground states in the lattice gauge mapping of all-to-all Ising models (LHZ) with considerably enhanced final ground state fidelity compared to a quantum annealing protocol.…
The propagation of errors severely compromises the reliability of quantum computations. The quantum adiabatic algorithm is a physically motivated method to prepare ground states of classical and quantum Hamiltonians. Here, we analyze the…
Adiabatic quantum computation (AQC), which is particularly useful for combinatorial optimization, becomes more powerful by using excited states, instead of ground states. However, the excited-state AQC is prone to errors due to dissipation.…
We propose a quantum algorithm for many-body state preparation. It is especially suited for injective PEPS and thermal states of local commuting Hamiltonians on a lattice. We show that for a uniform gap and sufficiently smooth paths, an…
Quantum phase transitions materialize as level crossings in the ground-state energy when the parameters of the Hamiltonian are varied. The resulting ground-state phase diagrams are straightforward to determine by exact diagonalization on…
This paper explores several aspects of the adiabatic quantum computation model. We first show a way that directly maps any arbitrary circuit in the standard quantum computing model to an adiabatic algorithm of the same depth. Specifically,…
Quantum state preparation is a key step in all digital quantum simulation algorithms. Here we propose methods to initialize on a gate-based quantum computer a general class of quantum spin wave functions, the so-called Valence-Bond-Solid…
Universal quantum computation can be achieved by simply performing single-spin measurements on a highly entangled resource state, such as cluster states. The family of Affleck-Kennedy-Lieb-Tasaki (AKLT) states has recently been explored;…