Isogeometric Analysis of Bound States of a Quantum Three-Body Problem in 1D

• URL: http://arxiv.org/abs/2202.09986v2
• Date: Thu, 31 Mar 2022 00:50:39 GMT
• Title: Isogeometric Analysis of Bound States of a Quantum Three-Body Problem in 1D
• Authors: Quanling Deng
• Abstract summary: We represent the wavefunctions by linear combinations of B-spline basis functions and solve the problem as a matrix eigenvalue problem. The eigenvalue gives the eigenstate energy while the eigenvector gives the coefficients of the B-splines that lead to the eigenstate. We demonstrate through various numerical experiments that IGA provides a promising technique to solve the three-body problem.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this paper, we initiate the study of isogeometric analysis (IGA) of a quantum three-body problem that has been well-known to be difficult to solve. In the IGA setting, we represent the wavefunctions by linear combinations of B-spline basis functions and solve the problem as a matrix eigenvalue problem. The eigenvalue gives the eigenstate energy while the eigenvector gives the coefficients of the B-splines that lead to the eigenstate. The major difficulty of isogeometric or other finite-element-method-based analyses lies in the lack of boundary conditions and a large number of degrees of freedom for accuracy. For a typical many-body problem with attractive interaction, there are bound and scattering states where bound states have negative eigenvalues. We focus on bound states and start with the analysis for a two-body problem. We demonstrate through various numerical experiments that IGA provides a promising technique to solve the three-body problem.

Related papers

• An Analysis of Quantum Annealing Algorithms for Solving the Maximum Clique Problem [49.1574468325115]
  We analyse the ability of quantum D-Wave annealers to find the maximum clique on a graph, expressed as a QUBO problem. We propose a decomposition algorithm for the complementary maximum independent set problem, and a graph generation algorithm to control the number of nodes, the number of cliques, the density, the connectivity indices and the ratio of the solution size to the number of other nodes.
  arXiv  Detail & Related papers  (2024-06-11T04:40:05Z)
• Quantum Eigensolver for General Matrices [5.811990276393904]
  We present a novel family of quantum algorithms tailored for solving the eigenvalue problem for general matrices. Our algorithms find applications in diverse domains, including estimating the relaxation time of Markov chains. These applications underscore the significance of our quantum eigensolvers for problems across various disciplines.
  arXiv  Detail & Related papers  (2024-01-22T16:29:08Z)
• Quantum algorithms for the generalized eigenvalue problem [6.111964049119244]
  generalized eigenvalue (GE) problems are of particular importance in various areas of science engineering and machine learning. We present a variational quantum algorithm for finding the desired generalized eigenvalue of the GE problem, $mathcalA|psirangle=lambdamathcalB|psirangle$, by choosing suitable loss functions. We numerically implement our algorithms to conduct a 2-qubit simulation and successfully find the generalized eigenvalues of the matrix pencil $(mathcalA,,mathcalB)$
  arXiv  Detail & Related papers  (2021-12-05T12:12:49Z)
• On the properties of the asymptotic incompatibility measure in multiparameter quantum estimation [62.997667081978825]
  Incompatibility (AI) is a measure which quantifies the difference between the Holevo and the SLD scalar bounds. We show that the maximum amount of AI is attainable only for quantum statistical models characterized by a purity larger than $mu_sf min = 1/(d-1)$.
  arXiv  Detail & Related papers  (2021-07-28T15:16:37Z)
• Minimax Estimation of Linear Functions of Eigenvectors in the Face of Small Eigen-Gaps [95.62172085878132]
  Eigenvector perturbation analysis plays a vital role in various statistical data science applications. We develop a suite of statistical theory that characterizes the perturbation of arbitrary linear functions of an unknown eigenvector. In order to mitigate a non-negligible bias issue inherent to the natural "plug-in" estimator, we develop de-biased estimators.
  arXiv  Detail & Related papers  (2021-04-07T17:55:10Z)
• Analysis of Truncated Orthogonal Iteration for Sparse Eigenvector Problems [78.95866278697777]
  We propose two variants of the Truncated Orthogonal Iteration to compute multiple leading eigenvectors with sparsity constraints simultaneously. We then apply our algorithms to solve the sparse principle component analysis problem for a wide range of test datasets.
  arXiv  Detail & Related papers  (2021-03-24T23:11:32Z)
• Gross misinterpretation of a conditionally solvable eigenvalue equation [0.0]
  We solve an eigenvalue equation that appears in several papers about a wide range of physical problems. We compare the resulting eigenvalues with those provided by the truncation condition. In this way we prove that those physical predictions are merely artifacts of the truncation condition.
  arXiv  Detail & Related papers  (2020-11-12T15:08:11Z)
• Hilbert-space geometry of random-matrix eigenstates [55.41644538483948]
  We discuss the Hilbert-space geometry of eigenstates of parameter-dependent random-matrix ensembles. Our results give the exact joint distribution function of the Fubini-Study metric and the Berry curvature. We compare our results to numerical simulations of random-matrix ensembles as well as electrons in a random magnetic field.
  arXiv  Detail & Related papers  (2020-11-06T19:00:07Z)
• Unsupervised Neural Networks for Quantum Eigenvalue Problems [1.2891210250935146]
  We present a novel unsupervised neural network for discovering eigenfunctions and eigenvalues for differential eigenvalue problems. A scanning mechanism is embedded allowing the method to find an arbitrary number of solutions.
  arXiv  Detail & Related papers  (2020-10-10T19:34:37Z)
• Eigendecomposition-Free Training of Deep Networks for Linear Least-Square Problems [107.3868459697569]
  We introduce an eigendecomposition-free approach to training a deep network. We show that our approach is much more robust than explicit differentiation of the eigendecomposition. Our method has better convergence properties and yields state-of-the-art results.
  arXiv  Detail & Related papers  (2020-04-15T04:29:34Z)
• Quantum phase estimation for a class of generalized eigenvalue problems [0.0]
  Quantum phase estimation provides a path to quantum computation of solutions to Hermitian eigenvalue problems. A restricted class of generalized eigenvalue problems could be solved as efficiently as standard eigenvalue problems.
  arXiv  Detail & Related papers  (2020-02-19T23:24:07Z)

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.