Generalized Ramsey numbers through adiabatic quantum optimization

DOI10.1007/S11128-016-1363-3zbMath1348.81176arXiv1606.01078OpenAlexW2417068188MaRDI QIDQ331397

Mani Ranjbar, William G. Macready, Frank Gaitan, Lane H. Clark

Publication date: 27 October 2016

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

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

zbMATH Keywords

combinatorial optimizationRamsey theorygeneralized Ramsey numbersadiabatic quantum algorithmstree Ramsey numbers

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Quantum computation (81P68) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Quantum algorithms and complexity in the theory of computing (68Q12)

Uses Software

• OEIS

Cites Work

• Generalized Ramsey theory for graphs, X: Double stars
• Small Ramsey numbers
• Some tree-star Ramsey numbers
• Practical graph isomorphism. II.
• Generalized Ramsey theory for graphs. III: Small off-diagonal numbers
• SIMULATION OF QUANTUM ADIABATIC SEARCH IN THE PRESENCE OF NOISE
• Ramsey numbers for graphs with five vertices
• Tabu Search—Part I
• Some small ramsey numbers
• Generalized Ramsey Theory for Graphs. II. Small Diagonal Numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalized Ramsey numbers through adiabatic quantum optimization