Quantum optimization
From MaRDI portal
Abstract: We present a quantum algorithm for combinatorial optimization using the cost structure of the search states. Its behavior is illustrated for overconstrained satisfiability and asymmetric traveling salesman problems. Simulations with randomly generated problem instances show each step of the algorithm shifts amplitude preferentially towards lower cost states, thereby concentrating amplitudes into low-cost states, on average. These results are compared with conventional heuristics for these problems.
Recommendations
- Optimization using quantum mechanics: quantum annealing through adiabatic evolution
- An introduction to quantum annealing
- QUANTUM ALGORITHMS FOR OPTIMIZATION USING ASYMPTOTIC QUANTUM SEARCH
- scientific article; zbMATH DE number 1149422
- Adapting the traveling salesman problem to an adiabatic quantum computer
Cites work
- ``Neural computation of decisions in optimization problems
- A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
- A study of complexity transitions on the asymmetric traveling salesman problem
- Critical Behavior in the Satisfiability of Random Boolean Expressions
- scientific article; zbMATH DE number 3898613 (Why is no real title available?)
- scientific article; zbMATH DE number 3748431 (Why is no real title available?)
- scientific article; zbMATH DE number 45877 (Why is no real title available?)
- scientific article; zbMATH DE number 67483 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Nested quantum search and NP-hard problems
- Optimization by simulated annealing
- Phase transitions and the search problem
- Quantum computation
- Quantum search on structured problems
- Quantum theory, the Church–Turing principle and the universal quantum computer
- TOOLS FOR QUANTUM ALGORITHMS
Cited in
(39)- Quantum stochastic optimization
- Towards quantum computing based community detection
- Mapping a logical representation of TSP to quantum annealing
- Quantum circuit design for objective function maximization in gate-model quantum computers
- Opposition-based quantum firework algorithm for continuous optimisation problems
- Trajectory optimization using quantum computing
- A quantum adiabatic algorithm for multiobjective combinatorial optimization
- Quantum branch-and-bound algorithm and its application to the travelling salesman problem
- A quantum inspired gravitational search algorithm for numerical function optimization
- A search for quantum coin-flipping protocols using optimization techniques
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- Benchmarking the quantum approximate optimization algorithm
- Combinatorial optimization through variational quantum power method
- Quantum computation and quantum information†
- Adapting the traveling salesman problem to an adiabatic quantum computer
- QUANTUM ALGORITHMS FOR OPTIMIZATION USING ASYMPTOTIC QUANTUM SEARCH
- scientific article; zbMATH DE number 1285153 (Why is no real title available?)
- scientific article; zbMATH DE number 1149422 (Why is no real title available?)
- scientific article; zbMATH DE number 2013817 (Why is no real title available?)
- scientific article; zbMATH DE number 2033237 (Why is no real title available?)
- Unrelated parallel machine scheduling -- perspectives and progress
- On One Method of Optimization of Quantum Systems Based on the Search for Fixed Points
- ON THE PRACTICALITY OF ADIABATIC QUANTUM COMPUTING WITH OPTICAL SCHEMES
- Iterative classical superadiabatic algorithm for combinatorial optimization
- A quantum interior-point predictor–corrector algorithm for linear programming
- Efficient population transfer via non-ergodic extended states in quantum spin glass
- Detecting unstable periodic orbits of nonlinear mappings by a novel quantum-behaved particle swarm optimization non-Lyapunov way
- A practitioner’s guide to quantum algorithms for optimisation problems
- Optimal Seating Assignment in the COVID-19 Era via Quantum Computing
- A quantum online portfolio optimization algorithm
- Evaluating the convergence of tabu enhanced hybrid quantum optimization
- Improving quantum computation by optimized qubit routing
- Non-Boolean quantum amplitude amplification and quantum mean estimation
- A study of heuristic guesses for adiabatic quantum computation
- Some properties of q-Gaussian distributions
- A quantum computing approach for the unit commitment problem
- A quantum walk-assisted approximate algorithm for bounded NP optimisation problems
- Double chains quantum genetic algorithm with application to neuro-fuzzy controller design
- Pattern classifications using Grover's and Ventura's algorithms in a two-qubits system
This page was built for publication: Quantum optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5946294)
