Optimization on large interconnected graphs and networks using adiabatic quantum computation

DOI10.1142/S0219749923500260arXiv2202.02774OpenAlexW4377137235MaRDI QIDQ6096100

Rupak Chatterjee, Unnamed Author

Publication date: 11 September 2023

Published in: International Journal of Quantum Information (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2202.02774

zbMATH Keywords

graph algorithmsquantum optimizationscale free networkscomputational complexity theoryquantum machine

Mathematics Subject Classification ID

Computational learning theory (68Q32) Network design and communication in computer systems (68M10) Quantum computation (81P68) Graph algorithms (graph-theoretic aspects) (05C85) Adiabatic invariants for problems in Hamiltonian and Lagrangian mechanics (70H11) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum gates (81P65)

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Optimization on large interconnected graphs and networks using adiabatic quantum computation