Curve fitting on a quantum annealer for an advanced navigation method
From MaRDI portal
Cites work
- A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
- Adiabatic quantum computation is equivalent to standard quantum computation
- Beitrag zur Theorie des Ferromagnetismus
- DGM: a deep learning algorithm for solving partial differential equations
- DYNAMIC PROGRAMMING AND A NEW FORMALISM IN THE CALCULUS OF VARIATIONS
- Dynamic programming and optimal control. Vol. 1.
- Dynamic programming and optimal control. Vol. 2
- Generalized inverses. Theory and applications.
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
- New advances for quantum-inspired optimization
- NIST handbook of mathematical functions
- Numerical mathematics.
- On the Theory of Dynamic Programming
- Physics-informed neural networks: a deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations
- Quadratic unconstrained binary optimization problem preprocessing: theory and empirical analysis
- Quantum annealing versus digital computing. An experimental comparison
- Quantum stochastic optimization
- Recent developments in bound-state calculations using the Dyson-Schwinger and Bethe-Salpeter equations
- Reinforcement learning. An introduction
- Some Functional Equations in the Theory of Dynamic Programming
- Statistical Field Theory
- Tabu Search—Part I
- Tabu Search—Part II
- The unconstrained binary quadratic programming problem: a survey
This page was built for publication: Curve fitting on a quantum annealer for an advanced navigation method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6847541)