Quantum approximate optimization for combinatorial problems with constraints

DOI10.1016/J.INS.2022.11.020MaRDI QIDQ6131994FDOQ6131994

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)

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

zbMATH Keywords

quantum computingquantum walksNP optimization problemsapproximate optimization algorithm

Mathematics Subject Classification ID

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

Cited In (2)

• Syndrome decoding by quantum approximate optimization
• A review on quantum approximate optimization algorithm and its variants

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)