A Euclidean Monte-Carlo-informed route to ground-state preparation for quantum simulation of scalar field theory

• URL: http://arxiv.org/abs/2510.24875v1
• Date: Tue, 28 Oct 2025 18:24:50 GMT
• Title: A Euclidean Monte-Carlo-informed route to ground-state preparation for quantum simulation of scalar field theory
• Authors: Navya Gupta, Christopher David White, Zohreh Davoudi,
• Abstract summary: Quantum simulators hold great promise for studying real-time (Minkowski) dynamics of quantum field theories.<n>In this work, we exploit classical information to bridge Euclidean and Minkowski descriptions for a (1+1)-dimensional interacting scalar field theory.<n>By selected wavefunction moments with Monte-Carlo data, we obtain ansatzes that can be efficiently translated into quantum circuits.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum simulators hold great promise for studying real-time (Minkowski) dynamics of quantum field theories. Nonetheless, preparing non-trivial initial states remains a major obstacle. Euclidean-time Monte-Carlo methods yield ground-state spectra and static correlation functions that can, in principle, guide state preparation. In this work, we exploit this classical information to bridge Euclidean and Minkowski descriptions for a (1+1)-dimensional interacting scalar field theory. We propose variational ansatz families which achieve comparable ground-state energies, yet exhibit distinct correlations and local non-Gaussianity. By optimizing selected wavefunction moments with Monte-Carlo data, we obtain ansatzes that can be efficiently translated into quantum circuits. Our algorithmic cost analysis shows these circuits' gate complexity scales polynomially in system size. Our work paves the way for systematically leveraging classically-computed information to prepare initial states in quantum field theories of interest in nature.

Related papers

• Entanglement renormalization circuits for $2d$ Gaussian Fermion States [0.0]
  This work introduces a quantum circuit compression algorithm for Gaussian fermion states based on the multi-scale entanglement renormalization ansatz (MERA)<n>The algorithm is shown to accurately capture area-law entangled states including topologically trivial insulators, Chern insulators, and critical Dirac semimetals.<n>We also develop a novel fermion-to-qubit encoding scheme, based on an expanding $2d$ topological order, that enables implementing fermionic rotations via qubit Pauli rotations with constant Pauli weight independent of system size.
  arXiv  Detail & Related papers  (2025-06-04T17:44:17Z)
• Euclidean-Monte-Carlo-informed ground-state preparation for quantum simulation of scalar field theory [0.0]
  We present a fully classical pipeline for generating efficient quantum circuits for preparing the ground state of a quantum field theory in 1+1 dimensions.<n>The work opens the way to systematically applying classically obtained knowledge of states to prepare accurate initial states in quantum field of theories of interest in nature.
  arXiv  Detail & Related papers  (2025-06-02T23:02:45Z)
• Real-Time Scattering Processes with Continuous-Variable Quantum Computers [0.0]
  We propose a framework for simulating the real-time dynamics of quantum field theories.<n>We implement non-Gaussian operations for continuous-variable quantum computing platforms.
  arXiv  Detail & Related papers  (2025-02-03T19:11:38Z)
• Operationally classical simulation of quantum states [41.94295877935867]
  A classical state-preparation device cannot generate superpositions and hence its emitted states must commute.<n>We show that no such simulation exists, thereby certifying quantum coherence.<n>Our approach is a possible avenue to understand how and to what extent quantum states defy generic models based on classical devices.
  arXiv  Detail & Related papers  (2025-02-03T15:25:03Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Entanglement Structure of Non-Gaussian States and How to Measure It [0.0]
  We present a protocol that constrains quantum states by experimentally measured correlation functions.<n>This method enables measurement of a quantum state's entanglement structure.<n>We show the protocol's usefulness in conjunction with current and forthcoming experimental capabilities.
  arXiv  Detail & Related papers  (2024-07-16T18:00:01Z)
• Solving reaction dynamics with quantum computing algorithms [42.408991654684876]
  We study quantum algorithms for response functions, relevant for describing different reactions governed by linear response.<n>We focus on nuclear-physics applications and consider a qubit-efficient mapping on the lattice, which can efficiently represent the large volumes required for realistic scattering simulations.
  arXiv  Detail & Related papers  (2024-03-30T00:21:46Z)
• Direct Characteristic-Function Tomography of the Quantum States of Quantum Fields [5.145146101802871]
  We propose a strategy for implementing a direct readout of the symmetric characteristic function of the quantum states of quantum fields. This strategy may serve as an essential in understanding and optimizing the control of quantum fields for relativistic quantum information applications.
  arXiv  Detail & Related papers  (2023-10-20T14:15:14Z)
• 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)
• Quantum state inference from coarse-grained descriptions: analysis and an application to quantum thermodynamics [101.18253437732933]
  We compare the Maximum Entropy Principle method, with the recently proposed Average Assignment Map method. Despite the fact that the assigned descriptions respect the measured constraints, the descriptions differ in scenarios that go beyond the traditional system-environment structure.
  arXiv  Detail & Related papers  (2022-05-16T19:42:24Z)
• Quantum Simulation of Conformal Field Theory [77.34726150561087]
  We describe a quantum algorithm to simulate the dynamics of conformal field theories. A full analysis of the approximation errors suggests near-term applicability.
  arXiv  Detail & Related papers  (2021-09-29T06:44:33Z)
• Quantum simulation of gauge theory via orbifold lattice [47.28069960496992]
  We propose a new framework for simulating $textU(k)$ Yang-Mills theory on a universal quantum computer. We discuss the application of our constructions to computing static properties and real-time dynamics of Yang-Mills theories.
  arXiv  Detail & Related papers  (2020-11-12T18:49:11Z)
• State preparation and measurement in a quantum simulation of the O(3) sigma model [65.01359242860215]
  We show that fixed points of the non-linear O(3) sigma model can be reproduced near a quantum phase transition of a spin model with just two qubits per lattice site. We apply Trotter methods to obtain results for the complexity of adiabatic ground state preparation in both the weak-coupling and quantum-critical regimes. We present and analyze a quantum algorithm based on non-unitary randomized simulation methods.
  arXiv  Detail & Related papers  (2020-06-28T23:44:12Z)

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.