The following pages link to Quantum stochastic optimization (Q1825139):
Displaying 28 items.
- Do multipartite correlations speed up adiabatic quantum computation or quantum annealing? (Q331871) (← links)
- Quantum computing vs. coherent computing (Q468590) (← links)
- The power of quantum systems on a line (Q842451) (← links)
- Emergent quantumness in neural networks (Q2062464) (← links)
- Quantum algorithm for Feynman loop integrals (Q2094711) (← links)
- Entangling problem Hamiltonian for adiabatic quantum computation (Q2095868) (← links)
- Unconstrained binary models of the travelling salesman problem variants for quantum optimization (Q2102287) (← links)
- Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing (Q2104772) (← links)
- Benchmarking advantage and D-wave 2000Q quantum annealers with exact cover problems (Q2107098) (← links)
- Quantum approximate optimization algorithm for Bayesian network structure learning (Q2111010) (← links)
- Phase transitions and gaps in quantum random energy models (Q2155394) (← links)
- Tunneling time from spin fluctuations in Larmor clock (Q2172131) (← links)
- Opposition-based quantum firework algorithm for continuous optimisation problems (Q2224022) (← links)
- Trajectory optimization using quantum computing (Q2274880) (← links)
- Engineering local optimality in quantum Monte Carlo algorithms (Q2381271) (← links)
- Benchmarking the quantum approximate optimization algorithm (Q2681529) (← links)
- Combinatorial optimization through variational quantum power method (Q2685645) (← links)
- D-Wave and predecessors: from simulated to quantum annealing (Q2925838) (← links)
- An introduction to quantum annealing (Q3006161) (← links)
- <i>Colloquium</i>: Quantum annealing and analog quantum computation (Q3077047) (← links)
- Deterministic quantum annealing expectation-maximization algorithm (Q3302904) (← links)
- Mathematical foundation of quantum annealing (Q3624670) (← links)
- On One Method of Optimization of Quantum Systems Based on the Search for Fixed Points (Q5054160) (← links)
- Why adiabatic quantum annealing is unlikely to yield speed-up (Q6059153) (← links)
- A degree reduction method for an efficient QUBO formulation for the graph coloring problem (Q6546089) (← links)
- Adiabatic theorem for classical stochastic processes (Q6561794) (← links)
- Multicommodity information flow through quantum annealer (Q6617048) (← links)
- Deciding finiteness of bosonic dynamics with tunable interactions (Q6670414) (← links)
