Quantum stochastic optimization

DOI10.1016/0304-4149(89)90040-9MaRDI QIDQ1825139zbMATH OpenOpenAlexFDO

Authors Yanyan Li

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

zbMATH Keywords

graph partitioningquantum spinapproximate optimization strategydistorted random walkpotential energy termquantum tunnel effectSchrödinger Hamiltonian

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Quantum optimization
• An introduction to quantum annealing
• The quantum adiabatic optimization algorithm and local minima
• Optimization using quantum mechanics: quantum annealing through adiabatic evolution
• Quantum annealing and related optimization methods

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3265711 (Why is no real title available?)
• Energy forms, Hamiltonians, and distorted Brownian paths
• Equation of state calculations by fast computing machines
• New approach to the semiclassical limit of quantum mechanics. I: Multiple tunnelings in one dimension
• ON SMALL RANDOM PERTURBATIONS OF DYNAMICAL SYSTEMS
• On Convergence of Stochastic Processes
• Optimization by simulated annealing
• Simulated annealing via Sobolev inequalities
• Some simplified NP-complete graph problems
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm

Cited in

(31)

• 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
• Stochastic multivalued network for optimization. Application to the Graph MaxCut problem
• Adiabatic theorem for classical stochastic processes
• Quantum approximate optimization algorithm for Bayesian network structure learning
• D-Wave and predecessors: from simulated to quantum annealing
• Colloquium: Quantum annealing and analog quantum computation
• Multicommodity information flow through quantum annealer
• Phase transitions and gaps in quantum random energy models
• Quantum computing vs. coherent computing
• Engineering local optimality in quantum Monte Carlo algorithms
• Do multipartite correlations speed up adiabatic quantum computation or quantum annealing?
• Trajectory optimization using quantum computing
• An introduction to quantum annealing
• Opposition-based quantum firework algorithm for continuous optimisation problems
• Tunneling time from spin fluctuations in Larmor clock
• scientific article; zbMATH DE number 2013817 (Why is no real title available?)
• Efficient population transfer via non-ergodic extended states in quantum spin glass
• Why adiabatic quantum annealing is unlikely to yield speed-up
• Emergent quantumness in neural networks
• Combinatorial optimization through variational quantum power method
• On One Method of Optimization of Quantum Systems Based on the Search for Fixed Points
• Mathematical foundation of quantum annealing
• The power of quantum systems on a line
• Deciding finiteness of bosonic dynamics with tunable interactions
• Benchmarking the quantum approximate optimization algorithm
• Deterministic quantum annealing expectation-maximization algorithm
• Quantum algorithm for Feynman loop integrals
• Entangling problem Hamiltonian for adiabatic quantum computation
• A degree reduction method for an efficient QUBO formulation for the graph coloring problem

This page was built for publication: Quantum stochastic optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1825139)