Quantum approaches to graph colouring
From MaRDI portal
Publication:1004074
DOI10.1016/J.TCS.2008.09.055zbMATH Open1169.68018OpenAlexW2140813986MaRDI QIDQ1004074FDOQ1004074
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
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
Graph algorithms (graph-theoretic aspects) (05C85) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Exponential algorithmic speedup by a quantum walk
- Title not available (Why is that?)
- Title not available (Why is that?)
- Strengths and Weaknesses of Quantum Computing
- QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
- Title not available (Why is that?)
- Quantum Query Complexity of Some Graph Problems
- Title not available (Why is that?)
- The measurement calculus
- Quantum computing and hidden variables
Cited In (8)
- A quantum-inspired ant colony algorithm for graph coloring problem
- Title not available (Why is that?)
- On the quantum chromatic number of a graph
- 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
- Title not available (Why is that?)
- Estimating quantum chromatic numbers
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)
