Towards the real-time evolution of gauge-invariant $\mathbb{Z}_2$ and $U(1)$ quantum link models on NISQ Hardware with error-mitigation

• URL: http://arxiv.org/abs/2109.15065v3
• Date: Thu, 17 Nov 2022 19:19:45 GMT
• Title: Towards the real-time evolution of gauge-invariant $\mathbb{Z}_2$ and $U(1)$ quantum link models on NISQ Hardware with error-mitigation
• Authors: Emilie Huffman, Miguel Garc\'ia Vera, Debasish Banerjee
• Abstract summary: We benchmark the real-time dynamics of $mathbbZ$ and $U(1)$ gauge in plaquette models using noisy intermediate scale quantum (NISQ) hardware. We design quantum circuits for models of increasing complexity and measure physical observables such as the return probability to the initial state, and locally conserved charges.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Practical quantum computing holds clear promise in addressing problems not generally tractable with classical simulation techniques, and some key physically interesting applications are those of real-time dynamics in strongly coupled lattice gauge theories. In this article, we benchmark the real-time dynamics of $\mathbb{Z}_2$ and $U(1)$ gauge invariant plaquette models using noisy intermediate scale quantum (NISQ) hardware, specifically the superconducting-qubit-based quantum IBM Q computers. We design quantum circuits for models of increasing complexity and measure physical observables such as the return probability to the initial state, and locally conserved charges. NISQ hardware suffers from significant decoherence and corresponding difficulty to interpret the results. We demonstrate the use of hardware-agnostic error mitigation techniques, such as circuit folding methods implemented via the Mitiq package, and show what they can achieve within the quantum volume restrictions for the hardware. Our study provides insight into the choice of Hamiltonians, construction of circuits, and the utility of error mitigation methods to devise large-scale quantum computation strategies for lattice gauge theories.

Related papers

• Quantum Circuit-Based Adaptation for Credit Risk Analysis [27.308408027453012]
  Noisy and Intermediate-Scale Quantum, or NISQ, processors are sensitive to noise, prone to quantum decoherence, and are not yet capable of continuous quantum error correction for fault-tolerant quantum computation.<n>We experimentally study how hardware-aware variational quantum circuits on a superconducting quantum processing unit can model distributions relevant to specific use-case applications for Credit Risk Analysis.
  arXiv  Detail & Related papers  (2026-01-11T11:17:37Z)
• Resource Estimation for VQE on Small Molecules: Impact of Fermion Mappings and Hamiltonian Reductions [0.0]
  Variational Quantumsolver (VQE) represents a leading hybrid quantum-classical paradigm for addressing this challenge.<n>Resource requirements for VQE implementations employing the Unitary Coupled Cluster Singles and Doubles (UCCSD) ansatz are systematically analyzed.<n>Hamiltonian reduction strategies, including $mathbbZ$ tapering and frozen-core approximations, are examined to assess their effect on quantum resource scaling.
  arXiv  Detail & Related papers  (2025-12-01T12:24:00Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [60.996803677584424]
  Variational Quantum Circuits (VQCs) offer a novel pathway for quantum machine learning.<n>Their practical application is hindered by inherent limitations such as constrained linear expressivity, optimization challenges, and acute sensitivity to quantum hardware noise.<n>This work introduces VQC-MLPNet, a scalable and robust hybrid quantum-classical architecture designed to overcome these obstacles.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Trapped-ion quantum simulation of the Fermi-Hubbard model as a lattice gauge theory using hardware-aware native gates [0.3370543514515051]
  Trotterization-based quantum simulations have shown promise, but implementations on current hardware are limited by noise. A mapping of the Fermi-Hubbard model to a Z2 LGT was recently proposed that restricts the dynamics to a subspace protected by additional symmetries, and its ability for post-selection error mitigation was verified through noisy classical simulations. In particular, a novel combination of iteratively preconditioned gradient descent (IPG) and subsystem von Neumann Entropy compression reduces the 2-qubit gate count of FHM quantum simulation by 35%.
  arXiv  Detail & Related papers  (2024-11-12T13:21:12Z)
• 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)
• 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)
• Simulating quantum field theories on gate-based quantum computers [0.0]
  We implement a simulation of a quantum field theory in 1+1 space-time dimensions on a gate-based quantum computer. We show that experimentally relevant quantities like cross-sections for various processes, survival probabilities of various states, etc. can be computed.
  arXiv  Detail & Related papers  (2024-01-09T11:17:08Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Towards Neural Variational Monte Carlo That Scales Linearly with System Size [67.09349921751341]
  Quantum many-body problems are central to demystifying some exotic quantum phenomena, e.g., high-temperature superconductors. The combination of neural networks (NN) for representing quantum states, and the Variational Monte Carlo (VMC) algorithm, has been shown to be a promising method for solving such problems. We propose a NN architecture called Vector-Quantized Neural Quantum States (VQ-NQS) that utilizes vector-quantization techniques to leverage redundancies in the local-energy calculations of the VMC algorithm.
  arXiv  Detail & Related papers  (2022-12-21T19:00:04Z)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)
• State preparation and evolution in quantum computing: a perspective from Hamiltonian moments [5.774827369850958]
  Recent efforts highlight the development of quantum algorithms based upon quantum computed Hamiltonian moments. This tutorial review focuses on the typical ways of computing Hamiltonian moments using quantum hardware and improving the accuracy of the estimated state energies.
  arXiv  Detail & Related papers  (2021-09-27T04:24:19Z)
• Towards a NISQ Algorithm to Simulate Hermitian Matrix Exponentiation [0.0]
  A practical fault-tolerant quantum computer is worth looking forward to as it provides applications that outperform their known classical counterparts. It would take decades to make it happen, exploiting the power of noisy intermediate-scale quantum(NISQ) devices, which already exist, is becoming one of current goals. In this article, a method is reported as simulating a hermitian matrix exponentiation using parametrized quantum circuit.
  arXiv  Detail & Related papers  (2021-05-28T06:37:12Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Quantum simulation of open quantum systems in heavy-ion collisions [0.0]
  We present a framework to simulate the dynamics of hard probes such as heavy quarks or jets in a hot, strongly-coupled quark-gluon plasma (QGP) on a quantum computer. Our work demonstrates the feasibility of simulating open quantum systems on current and near-term quantum devices.
  arXiv  Detail & Related papers  (2020-10-07T18:00:02Z)

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.