Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Computational and Theoretical Nanoscience

A Molecular Computing Model for Graph Coloring Problem Using DNA Quantum Dot

Jiawei Li, Zhichao Song, Cheng Zhang, Jing Yang, H. Iñaki Schlaberg, Liu Shi

Published Apr 24, 2015• 1 citation
Publisher
DOI
10.1166/jctn.2015.3885

Related papers

Quantum Circuit Compilation for the Graph Coloring Problem

Angelo Oddi, Riccardo Rasconi, Marco Baioletti +2 more

Lecture notes in computer science•Jan 1, 2023•3 citations

Quantum annealing of the graph coloring problem

Olawale Titiloye, Alan J. Crispin

Discrete Optimization•Jan 8, 2011•114 citations

Exponential-Time Quantum Algorithms for Graph Coloring Problems

Kazuya Shimizu, Ryuhei Mori

Lecture notes in computer science•Jan 1, 2020•10 citations

Molecular solutions to the binary integer programming problem based on DNA computation

Chung-Wei Yeh, Chih‐Ping Chu, Kee-Rong Wu

Biosystems•Oct 18, 2005•36 citations

Hierarchical quantum approximation optimization algorithm for solving graph-coloring problems

刘冬梅 Liu Dongmei, Jian Li, XIUBO CHEN +3 more

Physical Review A•Jan 26, 2026•3 citations

A Resource-Efficient Quantum Framework for Graph Coloring and Chromatic Number Estimation

Francesco Turro, Daniele Dragoni

Many industrial optimization tasks can be modeled as graph coloring, where adjacent vertices must have different colors. This NP-hard problem is challenging for large graphs. We present a quantum encoding requiring qubits that scale logarithmically with the number of colors and linearly with vertices. Using adiabatic evolution with a novel mixer Hamiltonian and vertex terms, we compute the chromatic number and demonstrate robustness by solving constrained truck loading problems.

quant-pharXiv:2608.08694•Aug 11, 2026•0 citations