相关论文: A relation between fidelity and quantum adiabatic …

For multi-level time-dependent quantum systems one can construct superadiabatic representations in which the coupling between separated levels is exponentially small in the adiabatic limit. Based on results from [BeTe1] for special…

In these lecture notes, we review the adiabatic theorem in quantum mechanics, focusing on a recent extension to many-body systems. The role of locality is emphasized and the relation to the quasi-adiabatic flow discussed. An important…

Adiabatic quantum control protocols have been of wide interest to quantum computation due to their robustness and insensitivity to their actual duration of execution. As an extension of previous quantum learning algorithms, this work…

The main challenge in deterministic quantum state transfer in long-distance quantum communications is the transmission losses in the communication channel. To overcome this limitation, here we use the adiabatic theorem and find a lossless…

The goal of this paper is to study the effect of entanglement on the running time of a quantum computation. Adiabatic quantum computation is suited to this kind of study, since it allows us to explicitly calculate the time evolution of the…

Adiabatic quantum computing enables the preparation of many-body ground states. This is key for applications in chemistry, materials science, and beyond. Realisation poses major experimental challenges: Direct analog implementation requires…

We study under what conditions the quantum adiabaticity is maintained in a closed many-body system consisting of a one-dimensional fluid and an impurity particle dragged through the latter by an external force. We employ an effective theory…

We present straightforward proofs of estimates used in the adiabatic approximation. The gap dependence is analyzed explicitly. We apply the result to interpolating Hamiltonians of interest in quantum computing.

The quantum speed limit provides a fundamental bound on how fast a quantum system can evolve between the initial and the final states under any physical operation. The celebrated Mandelstam-Tamm (MT) bound has been widely studied for…

The quantitative adiabatic condition (QAC), or quantitative condition, is a convenient (a priori) tool for estimating the adiabaticity of quantum evolutions. However, the range of the applicability of QAC is not well understood. It has been…

The adiabatic theorem provides the basis for the adiabatic model of quantum computation. Recently the conditions required for the adiabatic theorem to hold have become a subject of some controversy. Here we show that the reported violations…

Digitizing an adiabatic evolution is a strategy able to combine the good performance of gate-based quantum processors with the advantages of adiabatic algorithms, providing then a hybrid model for efficient quantum information processing.…

We give a sufficient condition for the quantum adiabatic approximation, which is quantitative and can be used to estimate error caused by this approximation. We also discuss when the traditional condition is sufficient.

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…

The adiabatic theorem states that an initial eigenstate of a slowly varying Hamiltonian remains close to an instantaneous eigenstate of the Hamiltonian at a later time. We show that a perfunctory application of this statement is problematic…

We present two quantum algorithms based on evolution randomization, a simple variant of adiabatic quantum computing, to prepare a quantum state $\vert x \rangle$ that is proportional to the solution of the system of linear equations $A…

The adiabatic theorem of quantum mechanics states that the error between an instantaneous eigenstate of a time-dependent Hamiltonian and the state given by quantum evolution of duration $\tau$ is upper bounded by $C/\tau$ for some positive…

Adiabatic quantum computing is a powerful framework for state preparation, while its evolution time often scales quadratically in the inverse Hamiltonian spectral gap, leading to sub-optimal computational complexity. In this work, we…

A central challenge in the successful implementation of adiabatic quantum algorithms is to maintain the quantum adiabaticity during the entire evolution. However, the energy gap between the ground and the excited states of interacting…

Adiabatic techniques are known to allow for engineering quantum states with high fidelity. This requirement is currently of large interest, as applications in quantum information require the preparation and manipulation of quantum states…