A Semidefinite Programming algorithm for the Quantum Mechanical
Bootstrap
- URL: http://arxiv.org/abs/2209.14332v1
- Date: Wed, 28 Sep 2022 18:02:58 GMT
- Title: A Semidefinite Programming algorithm for the Quantum Mechanical
Bootstrap
- Authors: David Berenstein, George Hulsey
- Abstract summary: We present a semidefinite program (SDP) algorithm to find eigenvalues of Schr"odinger operators within the bootstrap approach to quantum mechanics.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We present a semidefinite program (SDP) algorithm to find eigenvalues of
Schr\"{o}dinger operators within the bootstrap approach to quantum mechanics.
The bootstrap approach involves two ingredients: a nonlinear set of constraints
on the variables (expectation values of operators in an energy eigenstate),
plus positivity constraints (unitarity) that need to be satisfied. By fixing
the energy we linearize all the constraints and show that the feasability
problem can be presented as an optimization problem for the variables that are
not fixed by the constraints and one additional slack variable that measures
the failure of positivity. To illustrate the method we are able to obtain
high-precision, sharp bounds on eigenenergies for arbitrary confining
polynomial potentials in 1-D.
Related papers
- Uncertainty relation and the constrained quadratic programming [3.397254718930225]
We find that the tight state-independent lower bound of the variance sum can be characterized as a quadratic programming problem with nonlinear constraints in optimization theory.
We introduce a numerical algorithm tailored for solving these quadratic programming instances, highlighting its efficiency and accuracy.
arXiv Detail & Related papers (2024-04-29T13:11:20Z) - Quantum eigenvalue processing [0.0]
Problems in linear algebra can be solved on a quantum computer by processing eigenvalues of the non-normal input matrices.
We present a Quantum EigenValue Transformation (QEVT) framework for applying arbitrary transformations on eigenvalues of block-encoded non-normal operators.
We also present a Quantum EigenValue Estimation (QEVE) algorithm for operators with real spectra.
arXiv Detail & Related papers (2024-01-11T19:49:31Z) - Scalable Bayesian Meta-Learning through Generalized Implicit Gradients [64.21628447579772]
Implicit Bayesian meta-learning (iBaML) method broadens the scope of learnable priors, but also quantifies the associated uncertainty.
Analytical error bounds are established to demonstrate the precision and efficiency of the generalized implicit gradient over the explicit one.
arXiv Detail & Related papers (2023-03-31T02:10:30Z) - Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
We study the problem of designing worst-case to average-case reductions for quantum algorithms.
We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
arXiv Detail & Related papers (2022-12-06T22:01:49Z) - Quantum Goemans-Williamson Algorithm with the Hadamard Test and
Approximate Amplitude Constraints [62.72309460291971]
We introduce a variational quantum algorithm for Goemans-Williamson algorithm that uses only $n+1$ qubits.
Efficient optimization is achieved by encoding the objective matrix as a properly parameterized unitary conditioned on an auxilary qubit.
We demonstrate the effectiveness of our protocol by devising an efficient quantum implementation of the Goemans-Williamson algorithm for various NP-hard problems.
arXiv Detail & Related papers (2022-06-30T03:15:23Z) - Adiabatic quantum computing with parameterized quantum circuits [0.0]
We propose a discrete version of adiabatic quantum computing that can be implemented in a near-term device.
We compare our proposed algorithm with the Variational Quantum Eigensolver on two classical optimization problems.
arXiv Detail & Related papers (2022-06-09T09:31:57Z) - On optimization of coherent and incoherent controls for two-level
quantum systems [77.34726150561087]
This article considers some control problems for closed and open two-level quantum systems.
The closed system's dynamics is governed by the Schr"odinger equation with coherent control.
The open system's dynamics is governed by the Gorini-Kossakowski-Sudarshan-Lindblad master equation.
arXiv Detail & Related papers (2022-05-05T09:08:03Z) - Q-FW: A Hybrid Classical-Quantum Frank-Wolfe for Quadratic Binary
Optimization [44.96576908957141]
We present a hybrid classical-quantum framework based on the Frank-Wolfe algorithm, Q-FW, for solving quadratic, linear iterations problems on quantum computers.
arXiv Detail & Related papers (2022-03-23T18:00:03Z) - 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) - A Stochastic Composite Augmented Lagrangian Method For Reinforcement
Learning [9.204659134755795]
We consider the linear programming (LP) formulation for deep reinforcement learning.
The augmented Lagrangian method suffers the double-sampling obstacle in solving the LP.
A deep parameterized augment Lagrangian method is proposed.
arXiv Detail & Related papers (2021-05-20T13:08:06Z) - Preparing Bethe Ansatz Eigenstates on a Quantum Computer [0.0]
We present a quantum algorithm for preparing Bethe ansatz eigenstates of the spin-1/2 XXZZ spin chain that correspond to real-valued solutions of the Bethe equations.
Although the algorithm is probabilistic, with a success rate that decreases with increasing eigenstate energy, we employ amplification to boost the success probability.
arXiv Detail & Related papers (2021-03-24T17:58:21Z)
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.