Quick Navigation
Topics
Trapped Ion Quantum Computing
Quantum Simulation
Quantum Optimization for the Graph Coloring Problem with Space-Efficient Embedding
arXiv
Authors: Zsolt Tabi, Kareem H. El-Safty, Zsófia Kallus, Péter Hága, Tamás Kozsik, Adam Glos, Zoltán Zimborás
Year
2020
Paper ID
20676
Status
Preprint
Abstract Read
~2 min
Abstract Words
103
Citations
N/A
Abstract
Current quantum computing devices have different strengths and weaknesses depending on their architectures. This means that flexible approaches to circuit design are necessary. We address this task by introducing a novel space-efficient quantum optimization algorithm for the graph coloring problem. Our circuits are deeper than the ones of the standard approach. However, the number of required qubits is exponentially reduced in the number of colors. We present extensive numerical simulations demonstrating the performance of our approach. Furthermore, to explore currently available alternatives, we perform a study of random graph coloring on a quantum annealer to test the limiting factors of that approach, too.
Why This Paper Matters
- This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
- It adds a 2020 reference point for readers tracking recent quantum research.
- Current quantum computing devices have different strengths and weaknesses depending on their architectures.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.