Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userContinuum Limits of Quantum Lattice Systems
98
0
0.0
(
0
)
Authors
Tobias J. Osborne
Ask ChatGPT about the research
No Arabic abstract
We describe a general procedure to give effective continuous descriptions of quantum lattice systems in terms of quantum fields. There are two key novelties of our method: firstly, it is framed in the hamiltonian setting and applies equally to distinguishable quantum spins, bosons, and fermions and, secondly, it works for arbitrary variational tensor network states and can easily produce computable non-gaussian quantum field states. Our construction extends the mean-field fluctuation formalism of Hepp and Lieb (developed later by Verbeure and coworkers) to identify emergent continuous large-scale degrees of freedom - the continuous degrees of freedom are not identified beforehand. We apply the construction to to tensor network states, including, matrix product states and projected entangled-pair states, where we recover their recently introduced continuous counterparts, and also for tree tensor networks and the multi-scale entanglement renormalisation ansatz. Finally, extending the continuum limit to include dynamics we obtain a strict light cone for the propagation of information.
rate research
Read More
It is imperative that useful quantum computers be very difficult to simulate classically; otherwise classical computers could be used for the applications envisioned for the quantum ones. Perfect quantum computers are unarguably exponentially difficult to simulate: the classical resources required grow exponentially with the number of qubits $N$ or the depth $D$ of the circuit. Real quantum computing devices, however, are characterized by an exponentially decaying fidelity $mathcal{F} sim (1-epsilon)^{ND}$ with an error rate $epsilon$ per operation as small as $approx 1%$ for current devices. In this work, we demonstrate that real quantum computers can be simulated at a tiny fraction of the cost that would be needed for a perfect quantum computer. Our algorithms compress the representations of quantum wavefunctions using matrix product states (MPS), which capture states with low to moderate entanglement very accurately. This compression introduces a finite error rate $epsilon$ so that the algorithms closely mimic the behavior of real quantum computing devices. The computing time of our algorithm increases only linearly with $N$ and $D$. We illustrate our algorithms with simulations of random circuits for qubits connected in both one and two dimensional lattices. We find that $epsilon$ can be decreased at a polynomial cost in computing power down to a minimum error $epsilon_infty$. Getting below $epsilon_infty$ requires computing resources that increase exponentially with $epsilon_infty/epsilon$. For a two dimensional array of $N=54$ qubits and a circuit with Control-Z gates, error rates better than state-of-the-art devices can be obtained on a laptop in a few hours. For more complex gates such as a swap gate followed by a controlled rotation, the error rate increases by a factor three for similar computing time.
We introduce a new method for representing the low energy subspace of a bosonic field theory on the qubit space of digital quantum computers. This discretization leads to an exponentially precise description of the subspace of the continuous theory thanks to the Nyquist-Shannon sampling theorem. The method makes the implementation of quantum algorithms for purely bosonic systems as well as fermion-boson interacting systems feasible. We present algorithmic circuits for computing the time evolution of these systems. The complexity of the algorithms scales polynomially with the system size. The algorithm is a natural extension of the existing quantum algorithms for simulating fermion systems in quantum chemistry and condensed matter physics to systems involving bosons and fermion-boson interactions and has a broad variety of potential applications in particle physics, condensed matter, etc. Due to the relatively small amount of additional resources required by the inclusion of bosons in our algorithm, the simulation of electron-phonon and similar systems can be placed in the same near-future reach as the simulation of interacting electron systems. We benchmark our algorithm by implementing it for a $2$-site Holstein polaron problem on an Atos Quantum Learning Machine (QLM) quantum simulator. The polaron quantum simulations are in excellent agreement with the results obtained by exact diagonalization.
We present an algorithm that extends existing quantum algorithms for simulating fermion systems in quantum chemistry and condensed matter physics to include bosons in general and phonons in particular. We introduce a qubit representation for the low-energy subspace of phonons which allows an efficient simulation of the evolution operator of the electron-phonon systems. As a consequence of the Nyquist-Shannon sampling theorem, the phonons are represented with exponential accuracy on a discretized Hilbert space with a size that increases linearly with the cutoff of the maximum phonon number. The additional number of qubits required by the presence of phonons scales linearly with the size of the system. The additional circuit depth is constant for systems with finite-range electron-phonon and phonon-phonon interactions and linear for long-range electron-phonon interactions. Our algorithm for a Holstein polaron problem was implemented on an Atos Quantum Learning Machine (QLM) quantum simulator employing the Quantum Phase Estimation method. The energy and the phonon number distribution of the polaron state agree with exact diagonalization results for weak, intermediate and strong electron-phonon coupling regimes.
Local constraints play an important role in the effective description of many quantum systems. Their impact on dynamics and entanglement thermalization are just beginning to be unravelled. We develop a large $N$ diagrammatic formalism to exactly evaluate the bipartite entanglement of random pure states in large constrained Hilbert spaces. The resulting entanglement spectra may be classified into `phases depending on their singularities. Our closed solution for the spectra in the simplest class of constraints reveals a non-trivial phase diagram with a Marchenko-Pastur (MP) phase which terminates in a critical point with new singularities. The much studied Rydberg-blockaded/Fibonacci chain lies in the MP phase with a modified Page correction to the entanglement entropy, $Delta S_1 = 0.513595cdots$. Our results predict the entanglement of infinite temperature eigenstates in thermalizing constrained systems and provide a baseline for numerical studies.
The solution of gauge theories is one of the most promising applications of quantum technologies. Here, we discuss the approach to the continuum limit for $U(1)$ gauge theories regularized via finite-dimensional Hilbert spaces of quantum spin-$S$ operators, known as quantum link models. For quantum electrodynamics (QED) in one spatial dimension, we numerically demonstrate the continuum limit by extrapolating the ground state energy, the scalar, and the vector meson masses to large spin lengths $S$, large volume $N$, and vanishing lattice spacing $a$. By analytically solving Gauss law for arbitrary $S$, we obtain a generalized PXP spin model and count the physical Hilbert space dimension analytically. This allows us to quantify the required resources for reliable extrapolations to the continuum limit on quantum devices. We use a functional integral approach to relate the model with large values of half-integer spins to the physics at topological angle $Theta=pi$. Our findings indicate that quantum devices will in the foreseeable future be able to quantitatively probe the QED regime with quantum link models.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
