Stout Smearing on a Quantum Computer

• URL: http://arxiv.org/abs/2211.05607v1
• Date: Thu, 10 Nov 2022 14:30:06 GMT
• Title: Stout Smearing on a Quantum Computer
• Abstract summary: I develop a representation method for quantum smearing. I show that it reduces the coupling to high energy modes in the discrete nonabelian gauge theory.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Smearing of gauge-field configurations in lattice field theory improves the results of lattice simulations by suppressing high energy modes from correlation functions. In quantum simulations, high kinetic energy eigenstates are introduced when the time evolution operator is approximated such as Trotterization. While improved Trotter product formulae exist to reduce the errors, they have diminishing accuracy returns with respect to resource costs. Therefore having an algorithm that has fewer resources than an improved Trotter formula is desirable. In this work I develop a representation agnostic method for quantum smearing and show that it reduces the coupling to high energy modes in the discrete nonabelian gauge theory $D_4$

Related papers

• Hybrid Gaussian-exponential zero-noise extrapolation for periodic circuits [2.932287734903261]
  We introduce a hybrid Gaussian-exponential extrapolation scheme tailored for quantum circuits with periodic structure.<n>For moderate to large circuit depths, the hybrid model yields measurable reductions in bias relative to previous extrapolation variants.
  arXiv  Detail & Related papers  (2026-05-28T02:01:03Z)
• Quantum simulation of nanographenes and Trotter error cancellation [1.2314765641075438]
  We propose quantum simulation of nanographene $$-systems to span the gap between early and large-scale fault-tolerant quantum computing.<n>We examine the efficiency of Trotterized quantum simulation, present an analysis of worst-case, average-case and energy eigenvalue Trotter errors, and show that these Trotter error estimates vary by orders of magnitude.
  arXiv  Detail & Related papers  (2026-05-01T15:49:52Z)
• Performance Guarantees for Quantum Neural Estimation of Entropies [31.955071410400947]
  Quantum neural estimators (QNEs) combine classical neural networks with parametrized quantum circuits.<n>We study formal guarantees for QNEs of measured relative entropies in the form of non-asymptotic error risk bounds.<n>Our theory aims to facilitate principled implementation of QNEs for measured relative entropies.
  arXiv  Detail & Related papers  (2025-11-24T16:36:06Z)
• Fast simulations of X-ray absorption spectroscopy for battery materials on a quantum computer [36.21999915593711]
  This work proposes a highly-optimized implementation of the time-domain algorithm for X-ray absorption.<n>The low cost of our algorithm makes it attractive to use on fault-tolerant quantum devices to accelerate the development and commercialization of high-capacity battery cathodes.
  arXiv  Detail & Related papers  (2025-06-18T18:00:29Z)
• Symmetry-Aware Trotterization for Simulating the Heisenberg Model on IBM Quantum Devices [3.495405394644691]
  We propose a hardware-efficient Trotterization scheme for the time evolution of a 3-site, $J=1$ XXX Heisenberg model.<n>By exploiting the symmetry of the Hamiltonian, we derive an effective Hamiltonian that acts on a reduced subspace.<n>We also test our method on the IBM Quantum device ibmq_jakarta.
  arXiv  Detail & Related papers  (2025-05-07T16:31:39Z)
• Optimal-order Trotter-Suzuki decomposition for quantum simulation on noisy quantum computers [0.05343200742664294]
  We show that when the gate error is decreased by approximately an order of magnitude relative to typical modern values, higher-order Trotterization becomes advantageous. This form of Trotterization yields a global minimum of the overall simulation error.
  arXiv  Detail & Related papers  (2024-05-02T09:48:52Z)
• Simulating scalar field theories on quantum computers with limited resources [62.997667081978825]
  We present a quantum algorithm for implementing $phi4$ lattice scalar field theory on qubit computers. The algorithm allows efficient $phi4$ state preparation for a large range of input parameters in both the normal and broken symmetry phases.
  arXiv  Detail & Related papers  (2022-10-14T17:28:15Z)
• Quantum error mitigation by hidden inverses protocol in superconducting quantum devices [0.2867517731896504]
  We present a method to improve the convergence of variational algorithms based on hidden inverses to mitigate coherent errors. This approach improves performance in a variety of two-qubit error models where the noise operator also inverts with the gate inversion. We apply the mitigation scheme on superconducting quantum processors running the variational quantum eigensolver (VQE) algorithm.
  arXiv  Detail & Related papers  (2022-04-26T16:05:34Z)
• Variational Adiabatic Gauge Transformation on real quantum hardware for effective low-energy Hamiltonians and accurate diagonalization [68.8204255655161]
  We introduce the Variational Adiabatic Gauge Transformation (VAGT) VAGT is a non-perturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit. The accuracy of VAGT is tested trough numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.
  arXiv  Detail & Related papers  (2021-11-16T20:50:08Z)
• Average-case Speedup for Product Formulas [69.68937033275746]
  Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states. Our results open doors to the study of quantum algorithms in the average case.
  arXiv  Detail & Related papers  (2021-11-09T18:49:48Z)
• Quantum imaginary time evolution steered by reinforcement learning [0.47831562043724657]
  We propose a deep reinforcement learning-based method to steer the quantum imaginary time evolution. In our scheme, the well-trained agent can find the subtle evolution path where most algorithmic errors cancel out. The philosophy of our method, eliminating errors with errors, sheds light on error reduction on near-term quantum devices.
  arXiv  Detail & Related papers  (2021-05-18T17:32:33Z)
• Spectral Analysis of Product Formulas for Quantum Simulation [0.0]
  We show that the Trotter step size needed to estimate an energy eigenvalue within precision can be improved in scaling from $epsilon$ to $epsilon1/2$ for a large class of systems. Results partially generalize to diabatic processes, which remain in a narrow energy band separated from the rest of the spectrum by a gap.
  arXiv  Detail & Related papers  (2021-02-25T03:17:25Z)
• Benchmarking adaptive variational quantum eigensolvers [63.277656713454284]
  We benchmark the accuracy of VQE and ADAPT-VQE to calculate the electronic ground states and potential energy curves. We find both methods provide good estimates of the energy and ground state. gradient-based optimization is more economical and delivers superior performance than analogous simulations carried out with gradient-frees.
  arXiv  Detail & Related papers  (2020-11-02T19:52:04Z)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)
• Term Grouping and Travelling Salesperson for Digital Quantum Simulation [6.945601123742983]
  Digital simulation of quantum dynamics by evaluating the time evolution of a Hamiltonian is the initially proposed application of quantum computing. The large number of quantum gates required for emulating the complete second quantization form of the Hamiltonian makes such an approach unsuitable for near-term devices. We propose a new term ordering strategy, max-commute-tsp, that simultaneously mitigates both algorithmic and physical errors.
  arXiv  Detail & Related papers  (2020-01-16T18:33:24Z)

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.