Quantum stochastic optimization
From MaRDI portal
Recommendations
Cites work
- Energy forms, Hamiltonians, and distorted Brownian paths
- Equation of state calculations by fast computing machines
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3265711 (Why is no real title available?)
- New approach to the semiclassical limit of quantum mechanics. I: Multiple tunnelings in one dimension
- On Convergence of Stochastic Processes
- ON SMALL RANDOM PERTURBATIONS OF DYNAMICAL SYSTEMS
- 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
(34)- 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
- Quantum approximate optimization algorithm for Bayesian network structure learning
- Phase transitions and gaps in quantum random energy models
- Tunneling time from spin fluctuations in Larmor clock
- Opposition-based quantum firework algorithm for continuous optimisation problems
- Trajectory optimization using quantum computing
- Engineering local optimality in quantum Monte Carlo algorithms
- Benchmarking the quantum approximate optimization algorithm
- Combinatorial optimization through variational quantum power method
- D-Wave and predecessors: from simulated to quantum annealing
- An introduction to quantum annealing
- Colloquium: Quantum annealing and analog quantum computation
- Deterministic quantum annealing expectation-maximization algorithm
- Do multipartite correlations speed up adiabatic quantum computation or quantum annealing?
- Stochastic multivalued network for optimization. Application to the Graph MaxCut problem
- Mathematical foundation of quantum annealing
- scientific article; zbMATH DE number 2013817 (Why is no real title available?)
- Quantum computing vs. coherent computing
- On One Method of Optimization of Quantum Systems Based on the Search for Fixed Points
- Efficient population transfer via non-ergodic extended states in quantum spin glass
- Why adiabatic quantum annealing is unlikely to yield speed-up
- A degree reduction method for an efficient QUBO formulation for the graph coloring problem
- Adiabatic theorem for classical stochastic processes
- Multicommodity information flow through quantum annealer
- Deciding finiteness of bosonic dynamics with tunable interactions
- Curve fitting on a quantum annealer for an advanced navigation method
- Circuit lower bounds for low-energy states of quantum code Hamiltonians
- Classical computation over quantum architectures. From graph encoding to declarative languages compilation
- The power of quantum systems on a line
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)
