Different Bootstrap Matrices in Many QM Systems

• URL: http://arxiv.org/abs/2206.00767v2
• Date: Sun, 18 Sep 2022 16:32:02 GMT
• Title: Different Bootstrap Matrices in Many QM Systems
• Abstract summary: bootstrap is a technique recently developed to get energy eigenvalues of bound states and correlation functions. This article summarizes most knowledge of bootstrapping quantum mechanics (QM), and displays specific bootstrap equations and bootstrap matrices of different QM systems.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The bootstrap is a technique recently developed to get energy eigenvalues of bound states and correlation functions. There are three crucial steps - recursive equations, positivity constraints, search space. We calculate recursive equations of many representative quantum mechanics systems, such as polynomial potential, exponential potential, Yukawa potential and electromagnetic potential. Two kinds of bootstrap matrices, which are about the coordinate and coupling of the coordinate with the momentum, and their ability of constraining equations are displayed. Nextly, we analyze possible questions in numerical search, including the importance of constraints and step length, eigen-energy level and the degeneracy of energy. Finally, we try to explain why the bootstrap work well by analyzing positivity constraints of creation operator and annihilation operator in harmonic oscillator. This article summarizes most knowledge of bootstrapping quantum mechanics (QM), and displays specific bootstrap equations and bootstrap matrices of different QM systems.

Related papers

• Quantum simulation of the Liouville equation in classical mechanics with discontinuous potential via Schrödingerization [42.22857110018992]
  We develop quantum simulation algorithms for the Liouville equation of classical mechanics with discontinuous potential.<n>We combine Hamiltonian-preserving schemes by Jin and Wen in Commun. Math. Sci. 3(3), 285-315 (2005) with the Schrdingerization method, which embeds the resulting nonunitary semi-discrete dynamics into a unitary Schrdinger type system.
  arXiv  Detail & Related papers  (2026-06-13T02:49:05Z)
• Who can compete with quantum computers? Lecture notes on quantum inspired tensor networks computational techniques [0.0]
  The lectures include well-known algorithms to find eigenvectors of MPOs, solve linear problems, and recent learning algorithms that allow one to map a known function into an MPS.<n>The lectures end with a discussion of how to represent functions and perform calculus with tensor networks using the "quantics" representation.
  arXiv  Detail & Related papers  (2026-01-06T14:09:10Z)
• Bootstrapping Euclidean Two-point Correlators [1.4680035572775534]
  We develop a bootstrap approach to Euclidean two-point correlators in the thermal or ground state of quantum mechanical systems.<n>We derive rigorous bounds on continuous-time two-point correlators using a finite-dimensional semidefinite bootstrap program.
  arXiv  Detail & Related papers  (2025-11-11T18:44:51Z)
• Bootstrapping Shape Invariance: Numerical Bootstrap as a Detector of Solvable Systems [0.0]
  We analytically show that the bootstrap method can derive exact energy eigenvalues in systems with shape invariance. The information of the operators is also obtained naturally, and thus the bootstrap method tells us why the system is solvable.
  arXiv  Detail & Related papers  (2025-04-11T14:44:17Z)
• Exponential quantum speedups in quantum chemistry with linear depth [0.0]
  We prove a connection to particle number conserving matchgate circuits with fermionic magic state inputs.<n>We apply this result to quantum multi-reference methods designed for near-term hardware.<n>We discuss the implications for achieving exponential quantum advantage in quantum chemistry on near-term hardware.
  arXiv  Detail & Related papers  (2025-03-26T23:15:32Z)
• Tensor Network Techniques for Quantum Computation [41.94295877935867]
  This book serves as an introductory yet thorough guide to tensor networks and their applications in quantum computation and quantum information.<n>In Part I, foundational topics are covered, including tensor structures and network representations like Matrix Product States (MPS) and Tree Networks (TTN)<n>Part II explores practical applications of tensor networks in simulating quantum dynamics.<n>A final chapter addresses the emerging role of "quantum magic" in tensor networks.
  arXiv  Detail & Related papers  (2025-03-06T13:31:17Z)
• Capabilities of object-oriented programming for the construction of quantum-kinetic BBGKY equations of high orders [0.0]
  We present an object-oriented framework for constructing the equation of motion of the correlation matrix at a given order. It is based on the description and use of classes in the Python programming environment. It is shown that this framework allows one to derive the equations of motion of the fourth-order correlation matrix in less than a minute.
  arXiv  Detail & Related papers  (2024-11-14T15:59:11Z)
• Neutron-nucleus dynamics simulations for quantum computers [49.369935809497214]
  We develop a novel quantum algorithm for neutron-nucleus simulations with general potentials. It provides acceptable bound-state energies even in the presence of noise, through the noise-resilient training method. We introduce a new commutativity scheme called distance-grouped commutativity (DGC) and compare its performance with the well-known qubit-commutativity scheme.
  arXiv  Detail & Related papers  (2024-02-22T16:33:48Z)
• Lecture Notes on Quantum Electrical Circuits [49.86749884231445]
  Theory of quantum electrical circuits goes under the name of circuit quantum electrodynamics or circuit-QED. The goal of the theory is to provide a quantum description of the most relevant degrees of freedom. These lecture notes aim at giving a pedagogical overview of this subject for theoretically-oriented Master or PhD students in physics and electrical engineering.
  arXiv  Detail & Related papers  (2023-12-08T19:26:34Z)
• Wasserstein Quantum Monte Carlo: A Novel Approach for Solving the Quantum Many-Body Schr\"odinger Equation [56.9919517199927]
  "Wasserstein Quantum Monte Carlo" (WQMC) uses the gradient flow induced by the Wasserstein metric, rather than Fisher-Rao metric, and corresponds to transporting the probability mass, rather than teleporting it. We demonstrate empirically that the dynamics of WQMC results in faster convergence to the ground state of molecular systems.
  arXiv  Detail & Related papers  (2023-07-06T17:54:08Z)
• Should we trade off higher-level mathematics for abstraction to improve student understanding of quantum mechanics? [0.0]
  In work at Georgetown University and with edX, we have been teaching a class focused on an operator-forward viewpoint. It teaches quantum mechanics in a representation-independent fashion and allows for most of the math to be algebraic. It also allows for more advanced concepts relevant for quantum sensing, such as squeezed states, to be introduced in a simpler format than is conventionally done.
  arXiv  Detail & Related papers  (2023-04-28T19:30:19Z)
• Third quantization of open quantum systems: new dissipative symmetries and connections to phase-space and Keldysh field theory formulations [77.34726150561087]
  We reformulate the technique of third quantization in a way that explicitly connects all three methods. We first show that our formulation reveals a fundamental dissipative symmetry present in all quadratic bosonic or fermionic Lindbladians. For bosons, we then show that the Wigner function and the characteristic function can be thought of as ''wavefunctions'' of the density matrix.
  arXiv  Detail & Related papers  (2023-02-27T18:56:40Z)
• Bootstrapping the gap in quantum spin systems [0.7106986689736826]
  We use the equations of motion to develop an analogue of the conformal block expansion for matrix elements. The method can be applied to any quantum mechanical system with a local Hamiltonian.
  arXiv  Detail & Related papers  (2022-11-07T19:07:29Z)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)
• Quantum algorithms for matrix operations and linear systems of equations [65.62256987706128]
  We propose quantum algorithms for matrix operations using the "Sender-Receiver" model. These quantum protocols can be used as subroutines in other quantum schemes.
  arXiv  Detail & Related papers  (2022-02-10T08:12:20Z)
• Stochastic and Quantum Dynamics of Repulsive Particles: from Random Matrix Theory to Trapped Fermions [0.0]
  This thesis focuses on the study of three kinds of systems which display repulsive interactions: eigenvalues of random matrices, non-crossing random walks and trapped fermions. We present a combined analysis of these systems, employing tools of random matrix theory and calculus as well as tools of quantum mechanics.
  arXiv  Detail & Related papers  (2021-11-10T15:23:06Z)
• Quasienergy operators and generalized squeezed states for systems of trapped ions [0.0]
  Quantum stability is characterized by a discrete quasienergy spectrum, while quasienergy states are symplectic coherent states. We introduce the generators of the Lie algebra of the symplectic group $cal SL(2, mathbb R)$, which we use to build the coherent states associated to the system under investigation.
  arXiv  Detail & Related papers  (2021-08-26T07:48:09Z)

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.