Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn Calculating the Dynamics of Very Large Quantum Systems
63
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Due to the exponential growth of the state space of coupled quantum systems it is not possible, in general, to numerically store the state of a very large number of quantum systems within a classical computer. We demonstrate a method for modelling the dynamical behaviour of measurable quantities for very large numbers of interacting quantum systems. Our approach makes use of a symbolic non-commutative algebra engine that we have recently developed in conjunction with the well-known Ehrenfest theorem. Here we show the possibility of determining the dynamics of experimentally observable quantities, without approximation, for very large numbers of interacting harmonic oscillators. Our analysis removes a large number of significant constraints present in previous analysis of this example system (such as having no entanglement in the initial state). This method will be of value in simulating the operation of large quantum machines, emergent behaviour in quantum systems, open quantum systems and quantum chemistry to name but a few.
rate research
Read More
It is shown how to formulate the ubiquitous quantum chemistry problem of calculating the thermal rate constant on a quantum computer. The resulting exact algorithm scales exponentially faster with the dimensionality of the system than all known ``classical algorithms for this problem.
We present a quantum algorithm for calculating the vibronic spectrum of a molecule, a useful but classically hard problem in chemistry. We show several advantages over previous quantum approaches: vibrational anharmonicity is naturally included; after measurement, some state information is preserved for further analysis; and there are potential error-related benefits. Considering four triatomic molecules, we numerically study truncation errors in the harmonic approximation. Further, in order to highlight the fact that our quantum algorithms primary advantage over classical algorithms is in simulating anharmonic spectra, we consider the anharmonic vibronic spectrum of sulfur dioxide. In the future, our approach could aid in the design of materials with specific light-harvesting and energy transfer properties, and the general strategy is applicable to other spectral calculations in chemistry and condensed matter physics.
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.
Predicting features of complex, large-scale quantum systems is essential to the characterization and engineering of quantum architectures. We present an efficient approach for constructing an approximate classical description, called the classical shadow, of a quantum system from very few quantum measurements that can later be used to predict a large collection of features. This approach is guaranteed to accurately predict M linear functions with bounded Hilbert-Schmidt norm from only order of log(M) measurements. This is completely independent of the system size and saturates fundamental lower bounds from information theory. We support our theoretical findings with numerical experiments over a wide range of problem sizes (2 to 162 qubits). These highlight advantages compared to existing machine learning approaches.
We study the short-time evolution of the bipartite entanglement in quantum lattice systems with local interactions in terms of the purity of the reduced density matrix. A lower bound for the purity is derived in terms of the eigenvalue spread of the interaction Hamiltonian between the partitions. Starting from an initially separable state the purity decreases as $1 - (t/tau)^2$, i.e. quadratically in time, with a characteristic time scale $tau$ that is inversly proportional to the boundary size of the subsystem, i.e., as an area-law. For larger times an exponential lower bound is derived corresponding to the well-known linear-in-time bound of the entanglement entropy. The validity of the derived lower bound is illustrated by comparison to the exact dynamics of a 1D spin lattice system as well as a pair of coupled spin ladders obtained from numerical simulations.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
