Quantum approaches to graph colouring

DOI10.1016/J.TCS.2008.09.055MaRDI QIDQ1004074zbMATH OpenOpenAlexFDO

Authors Ellie D'Hondt

Publication date 2 March 2009

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2008.09.055

zbMATH Keywords

graph algorithmsquantum computing

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Quantum annealing of the graph coloring problem
• Exponential-time quantum algorithms for graph coloring problems
• Exponential-time quantum algorithms for graph coloring problems
• On the quantum chromatic number of a graph
• Deterministic quantum non-locality and graph colorings
• Spectral bounds for the quantum chromatic number of quantum graphs
• Estimating quantum chromatic numbers
• Quantum Query Complexity of Some Graph Problems

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 5899272 (Why is no real title available?)
• scientific article; zbMATH DE number 5910656 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 1142299 (Why is no real title available?)
• Exponential algorithmic speedup by a quantum walk
• QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
• Quantum Query Complexity of Some Graph Problems
• Quantum computing and hidden variables
• Strengths and Weaknesses of Quantum Computing
• The measurement calculus

Cited in

(8)

• Estimating quantum chromatic numbers
• A quantum-inspired ant colony algorithm for graph coloring problem
• On the quantum chromatic number of a graph
• scientific article; zbMATH DE number 1929929 (Why is no real title available?)
• Reformulating the harmonious colouring problem for quantum annealing
• Exponential-time quantum algorithms for graph coloring problems
• Colouring the rational quantum sphere and the Kochen-Specker theorem
• scientific article; zbMATH DE number 6744339 (Why is no real title available?)

This page was built for publication: Quantum approaches to graph colouring

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