Quantum stochastic optimization
From MaRDI portal
Publication:1825139
DOI10.1016/0304-4149(89)90040-9zbMath0683.90067OpenAlexW2001524816MaRDI QIDQ1825139
Publication date: 1989
Published in: Stochastic Processes and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-4149(89)90040-9
graph partitioningquantum spinSchrödinger Hamiltonianapproximate optimization strategydistorted random walkpotential energy termquantum tunnel effect
Related Items
The power of quantum systems on a line, Do multipartite correlations speed up adiabatic quantum computation or quantum annealing?, Phase transitions and gaps in quantum random energy models, D-Wave and predecessors: From simulated to quantum annealing, Tunneling time from spin fluctuations in Larmor clock, Why adiabatic quantum annealing is unlikely to yield speed-up, Quantum computing vs. coherent computing, Deterministic quantum annealing expectation-maximization algorithm, An introduction to quantum annealing, Colloquium: Quantum annealing and analog quantum computation, Mathematical foundation of quantum annealing, Emergent quantumness in neural networks, Quantum algorithm for Feynman loop integrals, Entangling problem Hamiltonian for adiabatic quantum computation, Unconstrained binary models of the travelling salesman problem variants for quantum optimization, Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing, Benchmarking advantage and D-wave 2000Q quantum annealers with exact cover problems
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Simulated annealing via Sobolev inequalities
- New approach to the semiclassical limit of quantum mechanics. I: Multiple tunnelings in one dimension
- Some simplified NP-complete graph problems
- ON SMALL RANDOM PERTURBATIONS OF DYNAMICAL SYSTEMS
- Energy forms, Hamiltonians, and distorted Brownian paths
- Equation of State Calculations by Fast Computing Machines
- On Convergence of Stochastic Processes