Quantum approximate optimization for combinatorial problems with constraints

DOI10.1016/J.INS.2022.11.020MaRDI QIDQ6131994zbMATH OpenFDO

Authors Yue Ruan, Zhiqiang Yuan, Xi-Ling Xue, Zhi-Hao Liu

Publication date 18 April 2024

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.INS.2022.11.020

zbMATH Keywords

approximate optimization algorithmNP optimization problemsquantum computingquantum walks

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX)

Recommendations

• Lower bounds on circuit depth of the quantum approximate optimization algorithm
• Using an \(A^\ast\)-based framework for decomposing combinatorial optimization problems to employ NISQ computers
• A quantum walk-assisted approximate algorithm for bounded NP optimisation problems
• A study of the performance of classical minimizers in the quantum approximate optimization algorithm
• Unconstrained binary models of the travelling salesman problem variants for quantum optimization

Cited in

(5)

• A review on quantum approximate optimization algorithm and its variants
• Syndrome decoding by quantum approximate optimization
• A finite state automaton for quantum computing
• Penalty-enhanced quantum approximate optimization algorithm framework for maximization and minimization problems
• Quantum alternating operator ansatz for solving the minimum dominating set problem on sparse graphs with a specific structure

This page was built for publication: Quantum approximate optimization for combinatorial problems with constraints

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