Simulation of quantum physics with Tensor Processing Units: brute-force computation of ground states and time evolution

• URL: http://arxiv.org/abs/2111.10466v1
• Date: Fri, 19 Nov 2021 22:41:04 GMT
• Title: Simulation of quantum physics with Tensor Processing Units: brute-force computation of ground states and time evolution
• Authors: Markus Hauru, Alan Morningstar, Jackson Beall, Martin Ganahl, Adam Lewis, and Guifre Vidal
• Abstract summary: Processing Units (TPUs) were developed by Google exclusively to support large-scale machine learning tasks. In this paper we repurpose TPUs for the challenging problem of simulating quantum spin systems. With a TPU v3 pod, with 2048 cores, we simulate wavefunctions $|Psirangle$ of up to $N=38$ qubits.
• Score: 0.3232625980782302
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Tensor Processing Units (TPUs) were developed by Google exclusively to support large-scale machine learning tasks. TPUs can, however, also be used to accelerate and scale up other computationally demanding tasks. In this paper we repurpose TPUs for the challenging problem of simulating quantum spin systems. Consider a lattice model made of $N$ spin-$\frac{1}{2}$ quantum spins, or qubits, with a Hamiltonian $H = \sum_i h_i$ that is a sum of local terms $h_i$ and a wavefunction $|\Psi\rangle$ consisting of $2^N$ complex amplitudes. We demonstrate the usage of TPUs for both (i) computing the ground state $|\Psi_{gs}\rangle$ of the Hamiltonian $H$, and (ii) simulating the time evolution $|\Psi(t)\rangle=e^{-itH}|\Psi(0)\rangle$ generated by this Hamiltonian starting from some initial state $|\Psi(0)\rangle$. The bottleneck of the above tasks is computing the product $H |\Psi\rangle$, which can be implemented with remarkable efficiency utilising the native capabilities of TPUs. With a TPU v3 pod, with 2048 cores, we simulate wavefunctions $|\Psi\rangle$ of up to $N=38$ qubits. The dedicated matrix multiplication units (MXUs), the high bandwidth memory (HBM) on each core, and the fast inter-core interconnects (ICIs) together provide performance far beyond the capabilities of general purpose processors.

Related papers

• GPU-accelerated Effective Hamiltonian Calculator [70.12254823574538]
  We present numerical techniques inspired by Nonperturbative Analytical Diagonalization (NPAD) and the Magnus expansion for the efficient calculation of effective Hamiltonians. Our numerical techniques are available as an open-source Python package, $rm qCH_eff$.
  arXiv  Detail & Related papers  (2024-11-15T06:33:40Z)
• Bayesian Inference with Deep Weakly Nonlinear Networks [57.95116787699412]
  We show at a physics level of rigor that Bayesian inference with a fully connected neural network is solvable. We provide techniques to compute the model evidence and posterior to arbitrary order in $1/N$ and at arbitrary temperature.
  arXiv  Detail & Related papers  (2024-05-26T17:08:04Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• End-to-end complexity for simulating the Schwinger model on quantum computers [0.6449786007855248]
  We propose an efficient implementation of block-encoding of the Schwinger model Hamiltonian. As an end-to-end application, we compute the vacuum persistence amplitude. Our results provide insights into predictions about the performance of quantum computers in the FTQC era.
  arXiv  Detail & Related papers  (2023-11-29T06:36:11Z)
• Simulation of IBM's kicked Ising experiment with Projected Entangled Pair Operator [71.10376783074766]
  We perform classical simulations of the 127-qubit kicked Ising model, which was recently emulated using a quantum circuit with error mitigation. Our approach is based on the projected entangled pair operator (PEPO) in the Heisenberg picture. We develop a Clifford expansion theory to compute exact expectation values and use them to evaluate algorithms.
  arXiv  Detail & Related papers  (2023-08-06T10:24:23Z)
• Fully $1\times1$ Convolutional Network for Lightweight Image Super-Resolution [79.04007257606862]
  Deep models have significant process on single image super-resolution (SISR) tasks, in particular large models with large kernel ($3times3$ or more) $1times1$ convolutions bring substantial computational efficiency, but struggle with aggregating local spatial representations. We propose a simple yet effective fully $1times1$ convolutional network, named Shift-Conv-based Network (SCNet)
  arXiv  Detail & Related papers  (2023-07-30T06:24:03Z)
• On sampling determinantal and Pfaffian point processes on a quantum computer [49.1574468325115]
  DPPs were introduced by Macchi as a model in quantum optics the 1970s. Most applications require sampling from a DPP, and given their quantum origin, it is natural to wonder whether sampling a DPP on a classical computer is easier than on a classical one. Vanilla sampling consists in two steps, of respective costs $mathcalO(N3)$ and $mathcalO(Nr2)$ operations on a classical computer, where $r$ is the rank of the kernel matrix.
  arXiv  Detail & Related papers  (2023-05-25T08:43:11Z)
• Recipes for the Digital Quantum Simulation of Lattice Spin Systems [0.0]
  We describe methods to construct digital quantum simulation algorithms for quantum spin systems on a regular lattice with local interactions. We provide resource estimates and quantum circuit elements for the most important cases and classes of spin systems.
  arXiv  Detail & Related papers  (2022-09-16T13:30:09Z)
• Density Matrix Renormalization Group with Tensor Processing Units [0.0]
  Google's Processing Units (TPUs) are integrated circuits specifically built to accelerate and scale up machine learning workloads. In this work we demonstrate the use of TPUs for accelerating and scaling up the density matrix renormalization group (DMRG), a powerful numerical approach to compute the ground state of a local quantum many-body Hamiltonian.
  arXiv  Detail & Related papers  (2022-04-12T10:40:14Z)
• Simulation of quantum many-body dynamics with Tensor Processing Units: Floquet prethermalization [0.3078264203938486]
  We demonstrate the usage of TPUs for massively parallel, classical simulations of quantum many-body dynamics on long timescales. We simulate the dynamics of L=34 qubits for over $105$ Floquet periods, corresponding to circuits with millions of two-qubit gates. Our work demonstrates that TPUs can offer significant advantages for state-of-the-art simulations of quantum many-body dynamics.
  arXiv  Detail & Related papers  (2021-11-15T19:02:54Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.