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
- 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?)
- 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
- 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
- ``Neural computation of decisions in optimization problems
Cited in
(37)- A quantum online portfolio optimization algorithm
- A quantum adiabatic algorithm for multiobjective combinatorial optimization
- Mapping a logical representation of TSP to quantum annealing
- A search for quantum coin-flipping protocols using optimization techniques
- Quantum circuit design for objective function maximization in gate-model quantum computers
- A quantum inspired gravitational search algorithm for numerical function optimization
- Quantum branch-and-bound algorithm and its application to the travelling salesman problem
- A study of heuristic guesses for adiabatic quantum computation
- Improving quantum computation by optimized qubit routing
- Some properties of q-Gaussian distributions
- Iterative classical superadiabatic algorithm for combinatorial optimization
- Evaluating the convergence of tabu enhanced hybrid quantum optimization
- 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
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- Quantum computation and quantum information†
- QUANTUM ALGORITHMS FOR OPTIMIZATION USING ASYMPTOTIC QUANTUM SEARCH
- A quantum computing approach for the unit commitment problem
- A quantum interior-point predictor–corrector algorithm for linear programming
- scientific article; zbMATH DE number 2033237 (Why is no real title available?)
- Non-Boolean quantum amplitude amplification and quantum mean estimation
- Detecting unstable periodic orbits of nonlinear mappings by a novel quantum-behaved particle swarm optimization non-Lyapunov way
- Optimal Seating Assignment in the COVID-19 Era via Quantum Computing
- ON THE PRACTICALITY OF ADIABATIC QUANTUM COMPUTING WITH OPTICAL SCHEMES
- A practitioner’s guide to quantum algorithms for optimisation problems
- Trajectory optimization using quantum computing
- Opposition-based quantum firework algorithm for continuous optimisation problems
- scientific article; zbMATH DE number 2013817 (Why is no real title available?)
- Adapting the traveling salesman problem to an adiabatic quantum computer
- Efficient population transfer via non-ergodic extended states in quantum spin glass
- Towards quantum computing based community detection
- Combinatorial optimization through variational quantum power method
- On One Method of Optimization of Quantum Systems Based on the Search for Fixed Points
- Unrelated parallel machine scheduling -- perspectives and progress
- Benchmarking the quantum approximate optimization algorithm
- Quantum stochastic optimization
- A quantum walk-assisted approximate algorithm for bounded NP optimisation problems
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)
