On post-processing the results of quantum optimizers

DOI10.1007/978-3-030-34500-6_16MaRDI QIDQ6536368zbMATH OpenFDO

Authors Ajinkya Borle, Josh McCarter

Publication date 19 April 2024

Full work available at URL https://doi.org/10.1007/978-3-030-34500-6_16

zbMATH Keywords

approximationD-waveevolutionary algorithmQAOAquantum annealingquantum optimization

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Quantum computation (81P68)

Recommendations

• A practitioner’s guide to quantum algorithms for 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
• Enhancing quantum annealing performance for the molecular similarity problem
• Lower bounds on circuit depth of the quantum approximate optimization algorithm

Cites work

• Boosting quantum annealer performance via sample persistence
• Quantum spin glasses, annealing and computation
• The elimination form of the inverse and its application to linear programming

This page was built for publication: On post-processing the results of quantum optimizers

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