Computing hypergraph Ramsey numbers by using quantum circuit
From MaRDI portal
Publication:356909
DOI10.1007/S11128-013-0541-9zbMATH Open1270.81063arXiv1210.3419OpenAlexW2056117314MaRDI QIDQ356909FDOQ356909
Yan-ru Bao, Zong-shang Li, Juan Wang, Xiao-chun Cao, Ri Qu
Publication date: 26 July 2013
Published in: Quantum Information Processing (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1210.3419
Directed graphs (digraphs), tournaments (05C20) Searching and sorting (68P10) Quantum computation (81P68) Ramsey theory (05D10)
Cites Work
Cited In (1)
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 π π
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)