Bang-bang preparation of a quantum many-body ground state in a finite lattice: optimization of the algorithm with a tensor network

• URL: http://arxiv.org/abs/2505.08226v1
• Date: Tue, 13 May 2025 05:01:49 GMT
• Title: Bang-bang preparation of a quantum many-body ground state in a finite lattice: optimization of the algorithm with a tensor network
• Authors: Ihor Sokolov, Jacek Dziarmaga,
• Abstract summary: A bang-bang (BB) algorithm prepares the ground state of a lattice quantum many-body Hamiltonian $H=H_1+H$.<n>We optimize the algorithm with tensor networks in one and two dimensions.<n>We test the procedure in the 1D and 2D quantum Ising model near its quantum critical point employing, respectively, the matrix product state (MPS) and the pair-entangled projected state (PEPS)
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A bang-bang (BB) algorithm prepares the ground state of a lattice quantum many-body Hamiltonian $H=H_1+H_2$ by evolving an initial product state alternating between $H_1$ and $H_2$. We optimize the algorithm with tensor networks in one and two dimensions. The optimization has two stages. In stage one, a shallow translationally-invariant circuit is optimized in an infinite lattice. In stage two, the infinite-lattice gate sequence is used as a starting point for a finite lattice where it remains optimal in the bulk. The prepared state requires optimization only at its boundary, within a healing length from lattice edges, and the gate sequence needs to be modified only within the causal cone of the boundary. We test the procedure in the 1D and 2D quantum Ising model near its quantum critical point employing, respectively, the matrix product state (MPS) and the pair-entangled projected state (PEPS). At the boundary already the infinite-lattice sequence turns out to provide a more accurate state than in the bulk.

Related papers

• Algebraic Reduction to Improve an Optimally Bounded Quantum State Preparation Algorithm [0.6875312133832078]
  Preparation of $n$-qubit quantum states is a cross-cutting subroutine for many quantum algorithms.<n>A simpler algebraic decomposition is proposed to separate the preparation of the real part of the desired state from the complex one.<n>The reduction in complexity is due to the use of a single operator $$ for each uniformly controlled gate, instead of the three in the original decomposition.
  arXiv  Detail & Related papers  (2026-02-06T09:40:09Z)
• Learning Feasible Quantum States for Quadratic Constrained Binary Optimization Problems [41.23247424467223]
  We develop a variational approach that creates an equal superposition of quantum states that satisfy constraints in a QCBO.<n>The resulting equal superposition can be used as an initial state for quantum algorithms that solve QUBOs/QCBOs.
  arXiv  Detail & Related papers  (2025-08-04T16:44:53Z)
• Gate generation for open quantum systems via a monotonic algorithm with time optimization [0.0]
  We present a monotonic numerical algorithm for generating quantum gates for open systems. Preliminary implementations indicate that this algorithm is well suited for cat-qubit gates.
  arXiv  Detail & Related papers  (2024-03-29T07:43:29Z)
• Bang-bang preparation of quantum many-body ground states in two dimensions: optimization of the algorithm with a two-dimensional tensor network [0.0]
  A bang-bang (BB) algorithm prepares the ground state of a two-dimensional (2D) quantum many-body Hamiltonian $H=H1-+H$. We use the neighborhood tensor update to simulate the BB evolution with an infinite pair-dentangle projected state (iPEPS) The optimal BB energy converges with the number of bangs much faster than the optimal AP energy.
  arXiv  Detail & Related papers  (2024-01-17T12:04:10Z)
• Polynomial-time Solver of Tridiagonal QUBO and QUDO problems with Tensor Networks [41.94295877935867]
  We present an algorithm for solving tridiagonal Quadratic Unconstrained Binary Optimization (QUBO) problems and Quadratic Unconstrained Discrete Optimization (QUDO) problems with one-neighbor interactions. Our method is based on the simulation of a quantum state to which we will apply an imaginary time evolution and perform a series of partial traces to obtain the state of maximum amplitude.
  arXiv  Detail & Related papers  (2023-09-19T10:45:15Z)
• GRAPE optimization for open quantum systems with time-dependent decoherence rates driven by coherent and incoherent controls [77.34726150561087]
  The GRadient Ascent Pulse Engineering (GRAPE) method is widely used for optimization in quantum control. We adopt GRAPE method for optimizing objective functionals for open quantum systems driven by both coherent and incoherent controls. The efficiency of the algorithm is demonstrated through numerical simulations for the state-to-state transition problem.
  arXiv  Detail & Related papers  (2023-07-17T13:37:18Z)
• Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent and Incoherent Photons Found with Gradient Search [77.34726150561087]
  We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control. We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
  arXiv  Detail & Related papers  (2023-02-28T07:36:02Z)
• An entanglement perspective on the quantum approximate optimization algorithm [0.0]
  We study the entanglement growth and spread resulting from randomized and optimized QAOA circuits. We also investigate the entanglement spectrum in connection with random matrix theory.
  arXiv  Detail & Related papers  (2022-06-14T17:37:44Z)
• Quantum algorithms for grid-based variational time evolution [36.136619420474766]
  We propose a variational quantum algorithm for performing quantum dynamics in first quantization. Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
  arXiv  Detail & Related papers  (2022-03-04T19:00:45Z)
• Quantum walk in a reinforced free-energy landscape: Quantum annealing with reinforcement [0.0]
  Reinforcement is one of the strategies that can be used to circumvent the exponentially small energy gaps of the system. In this study, we take a local entropy in the configuration space for the reinforcement and apply the algorithm to a number of easy and hard optimization problems.
  arXiv  Detail & Related papers  (2022-02-22T14:16:27Z)
• Lower Bounds and Optimal Algorithms for Smooth and Strongly Convex Decentralized Optimization Over Time-Varying Networks [79.16773494166644]
  We consider the task of minimizing the sum of smooth and strongly convex functions stored in a decentralized manner across the nodes of a communication network. We design two optimal algorithms that attain these lower bounds. We corroborate the theoretical efficiency of these algorithms by performing an experimental comparison with existing state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-06-08T15:54:44Z)
• Single-Timescale Stochastic Nonconvex-Concave Optimization for Smooth Nonlinear TD Learning [145.54544979467872]
  We propose two single-timescale single-loop algorithms that require only one data point each step. Our results are expressed in a form of simultaneous primal and dual side convergence.
  arXiv  Detail & Related papers  (2020-08-23T20:36:49Z)
• 2D Qubit Placement of Quantum Circuits using LONGPATH [1.6631602844999722]
  Two algorithms are proposed to optimize the number of SWAP gates in any arbitrary quantum circuit. Our approach has a significant reduction in number of SWAP gates in 1D and 2D NTC architecture.
  arXiv  Detail & Related papers  (2020-07-14T04:09:52Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)
• Lagrangian Decomposition for Neural Network Verification [148.0448557991349]
  A fundamental component of neural network verification is the computation of bounds on the values their outputs can take. We propose a novel approach based on Lagrangian Decomposition. We show that we obtain bounds comparable with off-the-shelf solvers in a fraction of their running time.
  arXiv  Detail & Related papers  (2020-02-24T17:55:10Z)

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.