Parallel Quantum Simulation of Large Systems on Small Quantum Computers

• URL: http://arxiv.org/abs/2003.12087v2
• Date: Mon, 7 Jun 2021 15:07:25 GMT
• Title: Parallel Quantum Simulation of Large Systems on Small Quantum Computers
• Authors: Fergus Barratt, James Dborin, Matthias Bal, Vid Stojevic, Frank Pollmann, Andrew G. Green
• Abstract summary: NISQ networks permit computational and entanglement resources to be concentrated in interesting regions of Hilbert space. We provide Cirq and Qiskit code that translate infinite, translationally invariant matrix product state (iMPS) algorithms to finite-depth quantum circuit machines. Illustrative simulated output of these codes for achievable circuit sizes is given.
• Score: 0.2348805691644085
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Tensor networks permit computational and entanglement resources to be concentrated in interesting regions of Hilbert space. Implemented on NISQ machines they allow simulation of quantum systems that are much larger than the computational machine itself. This is achieved by parallelising the quantum simulation. Here, we demonstrate this in the simplest case; an infinite, translationally invariant quantum spin chain. We provide Cirq and Qiskit code that translate infinite, translationally invariant matrix product state (iMPS) algorithms to finite-depth quantum circuit machines, allowing the representation, optimisation and evolution arbitrary one-dimensional systems. Illustrative simulated output of these codes for achievable circuit sizes is given.

Related papers

• Parallelizing quantum simulation with decision diagrams [2.5999037208435705]
  Classical computers face a critical obstacle in simulating quantum algorithms. Quantum states reside in a Hilbert space whose size grows exponentially to the number of subsystems, i.e., qubits. This work explores several strategies for parallelizing decision diagram operations, specifically for quantum simulations.
  arXiv  Detail & Related papers  (2023-12-04T02:00:24Z)
• tqix.pis: A toolbox for large-scale quantum simulation platforms [0.0]
  tqix.pis is a library of tqix for executing various algorithms in large-scale quantum simulation platforms. It emulates basic functions of a quantum circuit, including qubits, quantum gates, and measurements.
  arXiv  Detail & Related papers  (2022-09-02T16:57:22Z)
• Recompilation-enhanced simulation of electron-phonon dynamics on IBM Quantum computers [62.997667081978825]
  We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems. We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling. Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
  arXiv  Detail & Related papers  (2022-02-16T19:00:00Z)
• Separation of gates in quantum parallel programming [1.4821822452801385]
  Ying conceived of using two or more small-capacity quantum computers to produce a larger-capacity quantum computing system by quantum parallel programming. Main obstacle is separating the quantum gates in the whole circuit to produce a tensor product of the local gates. We theoretically analyse the (sufficient and necessary) separability conditions of multipartite quantum gates in finite or infinite dimensional systems.
  arXiv  Detail & Related papers  (2021-10-28T09:11:41Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• Adiabatic Quantum Graph Matching with Permutation Matrix Constraints [75.88678895180189]
  Matching problems on 3D shapes and images are frequently formulated as quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard. We propose several reformulations of QAPs as unconstrained problems suitable for efficient execution on quantum hardware. The proposed algorithm has the potential to scale to higher dimensions on future quantum computing architectures.
  arXiv  Detail & Related papers  (2021-07-08T17:59:55Z)
• Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits at Exascale [57.84751206630535]
  We present a modernized version of the Quantum Virtual Machine (TNQVM) which serves as a quantum circuit simulation backend in the e-scale ACCelerator (XACC) framework. The new version is based on the general purpose, scalable network processing library, ExaTN, and provides multiple quantum circuit simulators. By combining the portable XACC quantum processors and the scalable ExaTN backend we introduce an end-to-end virtual development environment which can scale from laptops to future exascale platforms.
  arXiv  Detail & Related papers  (2021-04-21T13:26:42Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)
• Quantum walk processes in quantum devices [55.41644538483948]
  We study how to represent quantum walk on a graph as a quantum circuit. Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
  arXiv  Detail & Related papers  (2020-12-28T18:04:16Z)
• Bit-Slicing the Hilbert Space: Scaling Up Accurate Quantum Circuit Simulation to a New Level [10.765480856320018]
  We enhance quantum circuit simulation in two dimensions: accuracy and scalability. Experimental results demonstrate that our method can be superior to the state-of-the-art for various quantum circuits.
  arXiv  Detail & Related papers  (2020-07-18T01:26:40Z)
• Efficient Simulation of Loop Quantum Gravity -- A Scalable Linear-Optical Approach [0.0]
  A leading approach is Loop Quantum Gravity (LQG) We design a linear-optical simulator such that the evolution of the optical quantum gates simulates the spinfoam amplitudes of LQG. This work opens a new way to relate quantum gravity to quantum information and will expand our understanding of the theory.
  arXiv  Detail & Related papers  (2020-03-06T20:04:20Z)

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.