Hypergraph Ramsey numbers and adiabatic quantum algorithm

DOI10.1142/S0219749912500670MaRDI QIDQ4911258zbMATH OpenFDO

Authors Ri Qu, Su-Li Zhao, Yan-ru Bao, Xiao-chun Cao

Publication date 14 March 2013

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

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

zbMATH Keywords

\(r\)-uniform hypergraphsadiabatic quantum evolutionRamsey numbers

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Hypergraphs (05C65) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Abstract: Gaitan and Clark [Phys. Rev. Lett. 108, 010501 (2012)] have recently presented a quantum algorithm for the computation of the Ramsey numbers R(m, n) using adiabatic quantum evolution. We consider that the two-color Ramsey numbers R(m, n; r) for r-uniform hypergraphs can be computed by using the similar ways in [Phys. Rev. Lett. 108, 010501 (2012)]. In this comment, we show how the computation of R(m, n; r) can be mapped to a combinatorial optimization problem whose solution be found using adiabatic quantum evolution.

Recommendations

• Computing hypergraph Ramsey numbers by using quantum circuit
• Generalized Ramsey numbers through adiabatic quantum optimization
• scientific article; zbMATH DE number 5320186
• An alternative adiabatic quantum algorithm for the Hamiltonian cycle problem
• scientific article; zbMATH DE number 19184

Cites work

• Should Tables Be Sorted?
• SIMULATION OF QUANTUM ADIABATIC SEARCH IN THE PRESENCE OF NOISE
• The Complexity of the Local Hamiltonian Problem

Cited in

(2)

• Generalized Ramsey numbers through adiabatic quantum optimization
• Computing hypergraph Ramsey numbers by using quantum circuit

This page was built for publication: Hypergraph Ramsey numbers and adiabatic quantum algorithm

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