Simulating Field Theories with Quantum Computers
- URL: http://arxiv.org/abs/2401.01962v1
- Date: Wed, 3 Jan 2024 20:07:31 GMT
- Title: Simulating Field Theories with Quantum Computers
- Authors: Muhammad Asaduzzaman, Simon Catterall, Yannick Meurice, Goksu Can Toga
- Abstract summary: We identify different sources of errors prevalent in various quantum processing units and discuss challenges to scale up the size of the computation.
We present benchmark results obtained on a variety of platforms and employ a range of error mitigation techniques to address coherent and incoherent noise.
- Score: 1.0377683220196874
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: In this study, we investigate Trotter evolution in the Gross-Neveu and
hyperbolic Ising models in two spacetime dimensions, using quantum computers.
We identify different sources of errors prevalent in various quantum processing
units and discuss challenges to scale up the size of the computation. We
present benchmark results obtained on a variety of platforms and employ a range
of error mitigation techniques to address coherent and incoherent noise. By
comparing these mitigated outcomes with exact diagonalization results and
density matrix renormalization group calculations, we assess the effectiveness
of our approaches. Moreover, we demonstrate the implementation of an
out-of-time-ordered correlator (OTOC) protocol using IBM's quantum computers.
Related papers
- Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties?
We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.
We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
arXiv Detail & Related papers (2024-08-22T08:21:28Z) - Distributed computing quantum unitary evolution [0.0]
A distributed computing approach to solve the curse of dimensionality, caused by the complex quantum system modeling, is discussed.
Based on the Tavis-Cummings model, a large number of atoms are added into the optical cavity to obtain a high-dimensional quantum closed system, implemented on the supercomputer platform.
arXiv Detail & Related papers (2024-03-11T17:24:47Z) - Multimodal deep representation learning for quantum cross-platform
verification [60.01590250213637]
Cross-platform verification, a critical undertaking in the realm of early-stage quantum computing, endeavors to characterize the similarity of two imperfect quantum devices executing identical algorithms.
We introduce an innovative multimodal learning approach, recognizing that the formalism of data in this task embodies two distinct modalities.
We devise a multimodal neural network to independently extract knowledge from these modalities, followed by a fusion operation to create a comprehensive data representation.
arXiv Detail & Related papers (2023-11-07T04:35:03Z) - Quantum simulation of dissipative collective effects on noisy quantum
computers [0.0]
We put forward the first fully quantum simulation of dissipative collective phenomena on a real quantum computer.
The quantum simulation is based on the recently introduced multipartite collision model.
We implement the algorithm on some IBM quantum computers to simulate superradiance and subradiance between a pair of qubits.
arXiv Detail & Related papers (2022-01-27T15:50:58Z) - Orders of magnitude reduction in the computational overhead for quantum
many-body problems on quantum computers via an exact transcorrelated method [0.0]
We show that the Hamiltonian becomes non-Hermitian, posing problems for quantum algorithms based on the variational principle.
We overcome these limitations with the ansatz-based quantum imaginary time evolution algorithm.
Our work paves the way for the use of exact transcorrelated methods for the simulations of ab initio systems on quantum computers.
arXiv Detail & Related papers (2022-01-09T16:37:32Z) - Measuring NISQ Gate-Based Qubit Stability Using a 1+1 Field Theory and
Cycle Benchmarking [50.8020641352841]
We study coherent errors on a quantum hardware platform using a transverse field Ising model Hamiltonian as a sample user application.
We identify inter-day and intra-day qubit calibration drift and the impacts of quantum circuit placement on groups of qubits in different physical locations on the processor.
This paper also discusses how these measurements can provide a better understanding of these types of errors and how they may improve efforts to validate the accuracy of quantum computations.
arXiv Detail & Related papers (2022-01-08T23:12:55Z) - 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) - Benchmarking Small-Scale Quantum Devices on Computing Graph Edit
Distance [52.77024349608834]
Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical.
In this paper we present a comparative study of two quantum approaches to computing GED.
arXiv Detail & Related papers (2021-11-19T12:35:26Z) - An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem.
The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
arXiv Detail & Related papers (2020-05-06T14:18:44Z)
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.