Computing hypergraph Ramsey numbers by using quantum circuit

DOI10.1007/S11128-013-0541-9MaRDI QIDQ356909zbMATHOpenAlexFDO

Authors Ri Qu, Zong-shang Li, Yan-ru Bao, Xiao-chun Cao, Juan Wang

Publication date 26 July 2013

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

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

zbMATH Keywords

Ramsey numbers\(r\)-uniform hypergraphsquantum countingquantum search algorithm

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Searching and sorting (68P10) Quantum computation (81P68) Ramsey theory (05D10)

Abstract: Gaitan and Clark [Phys. Rev. Lett. 108, 010501 (2012)] have recently shown a quantum algorithm for the computation of the Ramsey numbers using adiabatic quantum evolution. We present a quantum algorithm to compute the two-color Ramsey numbers for r-uniform hypergraphs by using the quantum counting circuit.

Recommendations

• Hypergraph Ramsey numbers and adiabatic quantum algorithm
• Generalized Ramsey numbers through adiabatic quantum optimization
• Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs
• Quantum algorithms for finding constant-sized sub-hypergraphs
• A Quantum Algorithm for Finding a Hamilton Circuit

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 46958 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• Hypergraph Ramsey numbers and adiabatic quantum algorithm
• Ramsey numbers involving cycles

Cited in

(2)

• Hypergraph Ramsey numbers and adiabatic quantum algorithm
• Generalized Ramsey numbers through adiabatic quantum optimization

This page was built for publication: Computing hypergraph Ramsey numbers by using quantum circuit

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