Hybrid Ground-State Quantum Algorithms based on Neural Schrödinger Forging

• URL: http://arxiv.org/abs/2307.02633v2
• Date: Thu, 4 Apr 2024 16:27:08 GMT
• Title: Hybrid Ground-State Quantum Algorithms based on Neural Schrödinger Forging
• Authors: Paulin de Schoulepnikoff, Oriel Kiss, Sofia Vallecorsa, Giuseppe Carleo, Michele Grossi,
• Abstract summary: Entanglement forging based variational algorithms leverage the bi- partition of quantum systems. We propose a new method for entanglement forging employing generative neural networks to identify the most pertinent bitstrings. We show that the proposed algorithm achieves comparable or superior performance compared to the existing standard implementation of entanglement forging.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Entanglement forging based variational algorithms leverage the bi-partition of quantum systems for addressing ground state problems. The primary limitation of these approaches lies in the exponential summation required over the numerous potential basis states, or bitstrings, when performing the Schmidt decomposition of the whole system. To overcome this challenge, we propose a new method for entanglement forging employing generative neural networks to identify the most pertinent bitstrings, eliminating the need for the exponential sum. Through empirical demonstrations on systems of increasing complexity, we show that the proposed algorithm achieves comparable or superior performance compared to the existing standard implementation of entanglement forging. Moreover, by controlling the amount of required resources, this scheme can be applied to larger, as well as non permutation invariant systems, where the latter constraint is associated with the Heisenberg forging procedure. We substantiate our findings through numerical simulations conducted on spins models exhibiting one-dimensional ring, two-dimensional triangular lattice topologies, and nuclear shell model configurations.

Related papers

• Biorthogonal Neural Network Approach to Two-Dimensional Non-Hermitian Systems [5.513161407069216]
  Non-Hermitian quantum many-body systems exhibit a rich array of physical phenomena.<n>Non-Hermitian skin effects and exceptional points remain largely inaccessible to existing numerical techniques.
  arXiv  Detail & Related papers  (2025-08-01T21:02:41Z)
• Excitation Amplitude Sampling for Low Variance Electronic Structure on Quantum Computers [0.0]
  We combine classicalenergetics with partial shadow tomography to enable efficient protocols for extracting information from correlated ab initio electronic systems encoded on quantum devices.<n>We can demonstrate an almost two order of magnitude of reduction in required number of shots for a given quantum state excitation amplitudes.<n>We find a high-degree of noise resilience of these estimators on real quantum devices, with up to an order of magnitude increase in the tolerated noise compared to traditional techniques.
  arXiv  Detail & Related papers  (2025-06-18T13:13:09Z)
• Quantum Entanglement with Geometric Measures [0.0]
  This thesis extends the geometric measure of entanglement (GME) to introduce and investigate a suite of monotone entanglements tailored for diverse quantum contexts.<n>These monotones are applicable to both bipartite and multipartite systems, offering a unified framework for characterizing entanglement across various scenarios.
  arXiv  Detail & Related papers  (2025-06-13T04:05:03Z)
• Efficiency of Dynamical Decoupling for (Almost) Any Spin-Boson Model [44.99833362998488]
  We analytically study the dynamical decoupling of a two-level system coupled with a structured bosonic environment. We find sufficient conditions under which dynamical decoupling works for such systems. Our bounds reproduce the correct scaling in various relevant system parameters.
  arXiv  Detail & Related papers  (2024-09-24T04:58:28Z)
• Entropy-driven entanglement forging [0.0]
  We show how entropy-driven entanglement forging can be used to adjust quantum simulations to the limitations of noisy intermediate-scale quantum devices. Our findings indicate that our method, entropy-driven entanglement forging, can be used to adjust quantum simulations to the limitations of noisy intermediate-scale quantum devices.
  arXiv  Detail & Related papers  (2024-09-06T16:54:41Z)
• Avoiding barren plateaus via Gaussian Mixture Model [6.0599055267355695]
  Variational quantum algorithms are one of the most representative algorithms in quantum computing. They face challenges when dealing with large numbers of qubits, deep circuit layers, or global cost functions, making them often untrainable.
  arXiv  Detail & Related papers  (2024-02-21T03:25:26Z)
• Systematic Computation of Braid Generator Matrix in Topological Quantum Computing [0.0]
  We provide a comprehensive systematic method for the numerical computation of elementary braid operations in topological quantum computation (TQC) Our proposed method addresses this challenge, first in the special case of sparse encoding, allowing for the inclusion of an arbitrary number of anyons per qudit. The method plays a key role in a broad topological quantum circuit simulator, enabling the examination and study of complex quantum circuits.
  arXiv  Detail & Related papers  (2023-07-04T19:33:17Z)
• 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)
• Optimal quantum control via genetic algorithms for quantum state engineering in driven-resonator mediated networks [68.8204255655161]
  We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms. We consider a network of qubits -- encoded in the states of artificial atoms with no direct coupling -- interacting via a common single-mode driven microwave resonator. We observe high quantum fidelities and resilience to noise, despite the algorithm being trained in the ideal noise-free setting.
  arXiv  Detail & Related papers  (2022-06-29T14:34:00Z)
• Provably efficient variational generative modeling of quantum many-body systems via quantum-probabilistic information geometry [3.5097082077065003]
  We introduce a generalization of quantum natural gradient descent to parameterized mixed states. We also provide a robust first-order approximating algorithm, Quantum-Probabilistic Mirror Descent. Our approaches extend previously sample-efficient techniques to allow for flexibility in model choice.
  arXiv  Detail & Related papers  (2022-06-09T17:58:15Z)
• Numerical estimation of reachable and controllability sets for a two-level open quantum system driven by coherent and incoherent controls [77.34726150561087]
  The article considers a two-level open quantum system governed by the Gorini--Kossakowski--Lindblad--Sudarshan master equation. The system is analyzed using Bloch parametrization of the system's density matrix.
  arXiv  Detail & Related papers  (2021-06-18T14:23:29Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Autoregressive Transformer Neural Network for Simulating Open Quantum Systems via a Probabilistic Formulation [5.668795025564699]
  We present an approach for tackling open quantum system dynamics. We compactly represent quantum states with autoregressive transformer neural networks. Efficient algorithms have been developed to simulate the dynamics of the Liouvillian superoperator.
  arXiv  Detail & Related papers  (2020-09-11T18:00:00Z)
• A Neural-Network Variational Quantum Algorithm for Many-Body Dynamics [15.435967947933404]
  We propose a neural-network variational quantum algorithm to simulate the time evolution of quantum many-body systems. The proposed algorithm can be efficiently implemented in near-term quantum computers with low measurement cost.
  arXiv  Detail & Related papers  (2020-08-31T02:54:09Z)
• Quantitative Propagation of Chaos for SGD in Wide Neural Networks [39.35545193410871]
  In this paper, we investigate the limiting behavior of a continuous-time counterpart of the Gradient Descent (SGD) We show 'propagation of chaos' for the particle system defined by this continuous-time dynamics under different scenarios. We identify two under which different mean-field limits are obtained, one of them corresponding to an implicitly regularized version of the minimization problem at hand.
  arXiv  Detail & Related papers  (2020-07-13T12:55:21Z)
• 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)
• Active Model Estimation in Markov Decision Processes [108.46146218973189]
  We study the problem of efficient exploration in order to learn an accurate model of an environment, modeled as a Markov decision process (MDP) We show that our Markov-based algorithm outperforms both our original algorithm and the maximum entropy algorithm in the small sample regime.
  arXiv  Detail & Related papers  (2020-03-06T16:17: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.