Efficient vacuum state preparation for quantum simulation of strongly interacting local quantum field theories

• URL: http://arxiv.org/abs/2310.19229v3
• Date: Fri, 1 Mar 2024 15:56:13 GMT
• Title: Efficient vacuum state preparation for quantum simulation of strongly interacting local quantum field theories
• Authors: Thomas D. Cohen, Hyunwoo Oh
• Abstract summary: We present an efficient approach for preparing ground states in the context of strongly interacting local quantum field theories on quantum computers. The approach produces the vacuum state in a time proportional to the square-root of the volume, which is a square-root improvement in speed compared to traditional approaches.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present an efficient approach for preparing ground states in the context of strongly interacting local quantum field theories on quantum computers. The approach produces the vacuum state in a time proportional to the square-root of the volume, which is a square-root improvement in speed compared to traditional approaches. The approach exploits a novel method for traversing the path in parameter space in which the resources scale linearly with a path length suitably defined in parameter space. Errors due to practical limitations are controlled and do not exhibit secular growth along the path. The final accuracy can be arbitrarily improved with an additive cost, which is independent of the volume and grows slower than logarithmically with the overlap between the state produced and the exact ground state. We expect that the method could potentially hold practical value not only within the realm of quantum field theories but also in addressing other challenges involving long path lengths.

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)
• Fast and high-fidelity transfer of edge states via dynamical control of topological phases and effects of dissipation [0.0]
  Topological edge states are robust against symmetry-preserving perturbations and noise, making them promising for quantum information and computation.<n>We propose a high-fidelity method for transferring one-dimensional topological edge states by dynamically moving a domain wall.<n>We demonstrate effectiveness of our method in transferring edge states with high fidelity using a one-dimensional quantum walk with two internal states.
  arXiv  Detail & Related papers  (2025-05-22T12:40:48Z)
• Controlled Diagonal Catalyst Improves the Efficiency of Quantum Annealing [1.342834401139078]
  We propose a method for efficiently solving instances with small energy gaps by introducing additional local terms to the Hamiltonian. The proposed method achieves an approximate square speed up in time-to-solution compared to the conventional quantum annealing.
  arXiv  Detail & Related papers  (2025-03-19T14:20:38Z)
• High ground state overlap via quantum embedding methods [2.8300641557130035]
  We investigate the preparation of guiding states in the context of quantum embedding methods. We show that the easy-to-obtain mean-field state will have a sufficiently high overlap with the target state to perform quantum phase estimation.
  arXiv  Detail & Related papers  (2024-08-04T06:29:21Z)
• Disentanglement Provides a Unified Estimation for Quantum Entropies and Distance Measures [2.14566083603001]
  This paper introduces a unified approach using Disentangling Quantum Neural Networks (DEQNN) for estimating quantum entropies and distances. Our mathematical proof demonstrates that DEQNN can preserve quantum entropies and distances in smaller partial states. This method is scalable to an arbitrary number of quantum states and is particularly effective for less complex quantum systems.
  arXiv  Detail & Related papers  (2024-01-15T14:33:03Z)
• SpacePulse: Combining Parameterized Pulses and Contextual Subspace for More Practical VQE [16.890279629884493]
  We explore the integration of parameterized quantum pulses with the contextual subspace method. Working with pulses allows us to potentially access areas of the Hilbert space that are inaccessible with a CNOT-based circuit decomposition.
  arXiv  Detail & Related papers  (2023-11-29T07:55:31Z)
• Real-time dynamics of false vacuum decay [49.1574468325115]
  We investigate false vacuum decay of a relativistic scalar field in the metastable minimum of an asymmetric double-well potential. We employ the non-perturbative framework of the two-particle irreducible (2PI) quantum effective action at next-to-leading order in a large-N expansion.
  arXiv  Detail & Related papers  (2023-10-06T12:44:48Z)
• Competition of decoherence and quantum speed limits for quantum-gate fidelity in the Jaynes-Cummings model [1.2891210250935148]
  We show that entanglement-induced error scales inversely with the energy of the drive. We also prove that, in order to attain a given target state at a chosen fidelity, it is energetically more efficient to perform a single driven evolution of the logical qubits.
  arXiv  Detail & Related papers  (2023-05-08T19:56:21Z)
• 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)
• A Quantum Optimal Control Problem with State Constrained Preserving Coherence [68.8204255655161]
  We consider a three-level $Lambda$-type atom subjected to Markovian decoherence characterized by non-unital decoherence channels. We formulate the quantum optimal control problem with state constraints where the decoherence level remains within a pre-defined bound.
  arXiv  Detail & Related papers  (2022-03-24T21:31:34Z)
• Stochastic approximate state conversion for entanglement and general quantum resource theories [41.94295877935867]
  An important problem in any quantum resource theory is to determine how quantum states can be converted into each other. Very few results have been presented on the intermediate regime between probabilistic and approximate transformations. We show that these bounds imply an upper bound on the rates for various classes of states under probabilistic transformations. We also show that the deterministic version of the single copy bounds can be applied for drawing limitations on the manipulation of quantum channels.
  arXiv  Detail & Related papers  (2021-11-24T17:29:43Z)
• Bosonic field digitization for quantum computers [62.997667081978825]
  We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
  arXiv  Detail & Related papers  (2021-08-24T15:30:04Z)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)
• Quantum reinforcement learning in continuous action space [1.4893633973966713]
  We introduce a quantum Deep Deterministic Policy Gradient algorithm that efficiently addresses both classical and quantum sequential decision problems. A one-time optimization produces a model that outputs the control sequence required to drive a fixed initial state to any desired target state. We demonstrate the effectiveness of our method through simulations and discuss its potential applications in quantum control.
  arXiv  Detail & Related papers  (2020-12-19T15:16:17Z)

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.