相关论文: Simulating adiabatic evolution of gapped spin syst…
We propose a strategy for modeling the behavior of an adiabatic quantum computer described by an Ising Hamiltonian with $N$ sites and the coordination number $Z$. The method is based on the $1/Z$ expansion for the density matrix of the…
A new and intuitive perturbative approach to time-dependent quantum mechanics problems is presented, which is useful in situations where the evolution of the Hamiltonian is slow. The state of a system which starts in an instantaneous…
The simulation of various properties of quantum field theories is rapidly becoming a testing ground for demonstrating the prowess of quantum algorithms. Some examples include the preparation of ground states, as well as the investigation of…
Recently, Singh and Chandrasekharan showed that fixed points of the non-linear O(3) sigma model can be reproduced near a quantum phase transition of a spin model with just two qubits per lattice site. In a paper by the NuQS collaboration,…
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…
The lattice compact Abelian Higgs model is a non-perturbative regularized formulation of low-energy scalar quantum electrodynamics. In 1+1 dimensions, this model can be quantum simulated using a ladder-shaped optical lattice with…
We analyze some crucial questions regarding the practical feasibility of quantum simulation for lattice gauge models. Our analysis focuses on two models suitable for the quantum simulation of the Schwinger Hamiltonian, or QED in 1+1…
In this paper, we study two different nonlinear interpolating paths in adiabatic evolution algorithms for solving a particular class of quantum search problems where both the initial and final Hamiltonian are one-dimensional projector…
We study the problem of simulating the dynamics of spin systems when the initial state is supported on a subspace of low energy of a Hamiltonian $H$. This is a central problem in physics with vast applications in many-body systems and…
We give a careful proof that a parallelized version of adiabatic quantum computation can efficiently simulate universal gate model quantum computation. The proof specifies an explicit parameter-dependent Hamiltonian $H({\lambda})$ that is…
We analyze the ground state entanglement in a quantum adiabatic evolution algorithm designed to solve the NP-complete Exact Cover problem. The entropy of entanglement seems to obey linear and universal scaling at the point where the mass…
Full insight into the dynamics of a coupled quantum system depends on the ability to follow the effect of a local excitation in real-time. Here, we trace the coherent evolution of a pair of coupled atomic spins by means of scanning…
Fast and robust quantum gates is the cornerstone of fault-tolerance quantum computation. In this paper, we propose to achieve quantum gates based on non-cyclic geometric evolution. Dynamical phase during the evolution is cancelled by…
The ferrimagnetic phase of the sawtooth chain with mixed ferromagnetic nearest-neighbour interactions $J$ and antiferromagnetic next-nearest-neighbour interactions $J'$ (within the isotropic Heisenberg model) was previously characterized as…
With the aim of describing real-time electron dynamics, we introduce an adiabatic approximation for the equation of motion of the one-body reduced-density matrix (one-matrix). The eigenvalues of the one-matrix, which represent the…
We present a general protocol to control closed quantum systems that is based on minimising the adiabatic action. Using tools based on the geometry of quantum evolutions through the quantum adiabatic brachistochrone, we show that high…
We introduce observable quantities, borrowing from concepts of quantum information theory, for the characterization of quantum phase transitions in spin systems. These observables are uniquely defined in terms of single spin unitary…
Adiabatic quantum computation is a paradigmatic model aiming to solve a computational problem by finding the many-body ground state encapsulating the solution. However, its use of an adiabatic evolution depending on the spectral gap of an…
Quantum algorithms for probing ground-state properties of quantum systems require good initial states. Projection-based methods such as eigenvalue filtering rely on inputs that have a significant overlap with the low-energy subspace, which…
A variety of quantum computing algorithms exist for the preparation of approximate Hamiltonian ground states. A natural and important question is how these ground-state approximations can be further improved using adiabatic state…