Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAdiabatic approximation with exponential accuracy for many-body systems and quantum computation
143
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We derive a version of the adiabatic theorem that is especially suited for applications in adiabatic quantum computation, where it is reasonable to assume that the adiabatic interpolation between the initial and final Hamiltonians is controllable. Assuming that the Hamiltonian is analytic in a finite strip around the real time axis, that some number of its time-derivatives vanish at the initial and final times, and that the target adiabatic eigenstate is non-degenerate and separated by a gap from the rest of the spectrum, we show that one can obtain an error between the final adiabatic eigenstate and the actual time-evolved state which is exponentially small in the evolution time, where this time itself scales as the square of the norm of the time-derivative of the Hamiltonian, divided by the cube of the minimal gap.
rate research
Read More
We study the adiabatic-impulse approximation (AIA) as a tool to approximate the time evolution of quantum states, when driven through a region of small gap. The AIA originates from the Kibble-Zurek theory applied to continuous quantum phase transitions. The Kibble-Zurek mechanism was developed to predict the power-law scaling of the defect density across a continuous quantum phase transition. Instead here, we quantify the accuracy of the AIA via the trace norm distance with respect to the exact evolved state. As expected, we find that for short times/fast protocols, the AIA outperforms the simple adiabatic approximation. However, for large times/slow protocols, the situation is actually reversed and the AIA provides a worse approximation. Nevertheless, we found a variation of the AIA that can perform better than the adiabatic one. This counter-intuitive modification consists in crossing twice the region of small gap. Our findings are illustrated by several examples of driven closed and open quantum systems.
We present a general scheme for the study of frustration in quantum systems. We introduce a universal measure of frustration for arbitrary quantum systems and we relate it to a class of entanglement monotones via an exact inequality. If all the (pure) ground states of a given Hamiltonian saturate the inequality, then the system is said to be inequality saturating. We introduce sufficient conditions for a quantum spin system to be inequality saturating and confirm them with extensive numerical tests. These conditions provide a generalization to the quantum domain of the Toulouse criteria for classical frustration-free systems. The models satisfying these conditions can be reasonably identified as geometrically unfrustrated and subject to frustration of purely quantum origin. Our results therefore establish a unified framework for studying the intertwining of geometric and quantum contributions to frustration.
We discuss classical algorithms for approximating the largest eigenvalue of quantum spin and fermionic Hamiltonians based on semidefinite programming relaxation methods. First, we consider traceless $2$-local Hamiltonians $H$ describing a system of $n$ qubits. We give an efficient algorithm that outputs a separable state whose energy is at least $lambda_{max}/O(log n)$, where $lambda_{max}$ is the maximum eigenvalue of $H$. We also give a simplified proof of a theorem due to Lieb that establishes the existence of a separable state with energy at least $lambda_{max}/9$. Secondly, we consider a system of $n$ fermionic modes and traceless Hamiltonians composed of quadratic and quartic fermionic operators. We give an efficient algorithm that outputs a fermionic Gaussian state whose energy is at least $lambda_{max}/O(nlog n)$. Finally, we show that Gaussian states can vastly outperform Slater determinant states commonly used in the Hartree-Fock method. We give a simple family of Hamiltonians for which Gaussian states and Slater determinants approximate $lambda_{max}$ within a fraction $1-O(n^{-1})$ and $O(n^{-1})$ respectively.
Using Bell-inequalities as a tool to explore non-classical physical behaviours, in this paper we analyze what one can expect to find in many-body quantum physics. Concretely, framing the usual correlation scenarios as a concrete spin-lattice, we want to know whether or not it is possible to violate a Bell-inequality restricted to this scenario. Using clustering theorems, we are able to show that a large family of quantum many-body systems behave almost locally, violating Bell-inequalities (if so) only by a non-significant amount. We also provide examples, explain some of our assumptions via counter-examples and present all the proofs for our theorems. We hope the paper is self-contained.
Modeling many-body quantum systems with strong interactions is one of the core challenges of modern physics. A range of methods has been developed to approach this task, each with its own idiosyncrasies, approximations, and realm of applicability. Perhaps the most successful and ubiquitous of these approaches is density functional theory (DFT). Its Kohn-Sham formulation has been the basis for many fundamental physical insights, and it has been successfully applied to fields as diverse as quantum chemistry, condensed matter and dense plasmas. Despite the progress made by DFT and related schemes, however, there remain many problems that are intractable for existing methods. In particular, many approaches face a huge computational barrier when modeling large numbers of coupled electrons and ions at finite temperature. Here, we address this shortfall with a new approach to modeling many-body quantum systems. Based on the Bohmian trajectories formalism, our new method treats the full particle dynamics with a considerable increase in computational speed. As a result, we are able to perform large-scale simulations of coupled electron-ion systems without employing the adiabatic Born-Oppenheimer approximation.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
