Discrete-time quantum walk-based optimization algorithm

DOI10.1007/S11128-023-04234-4MaRDI QIDQ6128065zbMATH OpenOpenAlexWikidataFDO

Authors Ioannis Liliopoulos, Georgios D. Varsamis, Ioannis G. Karafyllidis

Publication date 15 April 2024

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11128-023-04234-4

zbMATH Keywords

binary classificationquantum optimizationquantum walks

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• A study of the performance of classical minimizers in the quantum approximate optimization algorithm
• A quantum walk-assisted approximate algorithm for bounded NP optimisation problems
• Solving the traveling salesman problem with a hybrid quantum-classical feedforward neural network
• A new hybrid classical-quantum algorithm for continuous global optimization problems
• Quantum approximate optimization algorithm for Bayesian network structure learning

Cited in

(2)

• Realization of arbitrary unitary operations using discrete-time quantum walks
• Coherent wave-particle quantum walks

This page was built for publication: Discrete-time quantum walk-based optimization algorithm

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