Deep Quantum Circuit Simulations of Low-Energy Nuclear States
- URL: http://arxiv.org/abs/2310.17739v1
- Date: Thu, 26 Oct 2023 19:10:58 GMT
- Title: Deep Quantum Circuit Simulations of Low-Energy Nuclear States
- Authors: Ang Li and Alessandro Baroni and Ionel Stetcu and Travis S. Humble
- Abstract summary: We present advances in high-performance numerical simulations of deep quantum circuits.
circuits up to 21 qubits and more than 115,000,000 gates can be efficiently simulated.
- Score: 51.823503818486394
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Numerical simulation is an important method for verifying the quantum
circuits used to simulate low-energy nuclear states. However, real-world
applications of quantum computing for nuclear theory often generate deep
quantum circuits that place demanding memory and processing requirements on
conventional simulation methods. Here, we present advances in high-performance
numerical simulations of deep quantum circuits to efficiently verify the
accuracy of low-energy nuclear physics applications. Our approach employs
several novel methods for accelerating the numerical simulation including 1-
and 2-qubit gate fusion techniques as well as management of simulated
mid-circuit measurements to verify state preparation circuits. We test these
methods across a variety of high-performance computing systems and our results
show that circuits up to 21 qubits and more than 115,000,000 gates can be
efficiently simulated.
Related papers
- Quantum Tunneling: From Theory to Error-Mitigated Quantum Simulation [49.1574468325115]
This study presents the theoretical background and the hardware aware circuit implementation of a quantum tunneling simulation.
We use error mitigation techniques (ZNE and REM) and multiprogramming of the quantum chip for solving the hardware under-utilization problem.
arXiv Detail & Related papers (2024-04-10T14:27:07Z) - Quantum Simulation of Dissipative Energy Transfer via Noisy Quantum
Computer [0.40964539027092917]
We propose a practical approach to simulate the dynamics of an open quantum system on a noisy computer.
Our method leverages gate noises on the IBM-Q real device, enabling us to perform calculations using only two qubits.
In the last, to deal with the increasing depth of quantum circuits when doing Trotter expansion, we introduced the transfer tensor method(TTM) to extend our short-term dynamics simulation.
arXiv Detail & Related papers (2023-12-03T13:56:41Z) - A Reorder Trick for Decision Diagram Based Quantum Circuit Simulation [0.4358626952482686]
We study two classes of quantum circuits on which the state-of-the-art decision diagram based simulators failed to perform well in terms of simulation time.
We propose a simple and powerful reorder trick to boost the simulation of such quantum circuits.
arXiv Detail & Related papers (2022-11-14T04:55:25Z) - Reconstructing complex states of a 20-qubit quantum simulator [0.6646556786265893]
We demonstrate an efficient method for reconstruction of significantly entangled multi-qubit quantum states.
We observe superior state reconstruction quality and faster convergence compared to the methods based on neural network quantum state representations.
Our results pave the way towards efficient experimental characterization of complex states produced by the quench dynamics of many-body quantum systems.
arXiv Detail & Related papers (2022-08-09T15:52:20Z) - Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most.
We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
arXiv Detail & Related papers (2022-04-12T19:39:31Z) - 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) - Numerical Simulations of Noisy Quantum Circuits for Computational
Chemistry [51.827942608832025]
Near-term quantum computers can calculate the ground-state properties of small molecules.
We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
arXiv Detail & Related papers (2021-12-31T16:33:10Z) - Logical Abstractions for Noisy Variational Quantum Algorithm Simulation [25.515765956985188]
Existing quantum circuit simulators do not address the common traits of variational algorithms.
We present a quantum circuit simulation toolchain based on logical abstractions targeted for simulating variational algorithms.
arXiv Detail & Related papers (2021-03-31T17:20:13Z) - Low-depth Hamiltonian Simulation by Adaptive Product Formula [3.050399782773013]
Various Hamiltonian simulation algorithms have been proposed to efficiently study the dynamics of quantum systems on a quantum computer.
Here, we propose an adaptive approach to construct a low-depth time evolution circuit.
Our work sheds light on practical Hamiltonian simulation with noisy-intermediate-scale-quantum devices.
arXiv Detail & Related papers (2020-11-10T18:00:42Z) - Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
Random quantum circuits are commonly viewed as hard to simulate classically.
We show that approximate simulation of typical instances is almost as hard as exact simulation.
We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
arXiv Detail & Related papers (2019-12-31T19:00:00Z)
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.