Pith. sign in

REVIEW 4 major objections 5 minor 42 references

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

T0 review · 4 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The paper claims that a Hamiltonian whose ground state minimizes the sum of color labels will reveal the chromatic number of any graph in one shot, using only logarithmically many qubits per vertex.

desk verdict The chromatic-number result is unsound: the one-body term minimizes sum of color labels, not the number of colors, so the central claim of Sec. III is false despite a reasonable encoding and mixer. read the letter →

arxiv 2608.08694 v1 pith:XB56MLDS submitted 2026-08-09 quant-ph

Francesco Turro , Daniele Dragoni This is my paper · ORCID
classification quant-ph
keywords graphcoloringchromaticnumberquantumadiabaticalgorithmlogarithmicqubitencodingfeasible-subspacemixertruckloadingproblemHamiltoniangroundstate
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper proposes a quantum Hamiltonian formulation of graph coloring that encodes all η colors in only $\lceil\log_2\eta\rceil$ qubits per vertex. The central claim is that adding a single-vertex term that penalizes large color labels makes the ground state of the full Hamiltonian a proper coloring that uses exactly the chromatic number of colors. The authors also introduce a mixer Hamiltonian that acts only on valid color assignments, which they argue improves adiabatic performance when the encoding contains unused states. They validate the construction with small numerical simulations and extend it to constrained truck-loading problems with capacity limits. If the claim holds, the chromatic number would be obtainable from a single ground-state search rather than from a sequence of feasibility checks.

What carries the argument

The argument is carried by a compact color encoding in which each vertex has an $n$-qubit register with $n = \lceil\log_2\eta\rceil$, and only $\eta$ of the $2^n$ computational states represent valid colors; a block-diagonal mixer $H_m^{k,n} = QFT_{k,n}\, D_k\, QFT_{k,n}^\dagger$ that couples only the valid color states, built from a truncated quantum Fourier transform; the two-vertex diagonal penalty $H_C(i,j)$ that assigns positive energy to equal-color and invalid-color pairs; and the color-number operator $N_i$ whose sum over vertices penalizes large labels. The load-bearing step is the identification of the label sum with the color count: the paper assumes that minimizing $\sum_i N_i$ over proper colorings is equivalent to minimizing the number of distinct colors used.

What would settle it

Compute the ground state of the proposed Hamiltonian, for example by exact diagonalization, for a small graph where the minimum-sum coloring uses more colors than the chromatic number, such as a triangle with at least four leaves attached to each vertex; if the ground state uses four colors rather than three, the central claim is refuted.

Watch

Extended reading notes

Core claim

On the paper's own terms, the central discovery is that the Hamiltonian $H_{\mathrm{tot}}^c = \sum_{\langle i,j\rangle} H_C(i,j) + \frac{1}{\eta N_G}\sum_i N_i$ has a ground state that colors the graph with the smallest number of colors consistent with the coloring constraints, namely the chromatic number $\Gamma$. The two-vertex term $H_C(i,j)$ forbids adjacent vertices from sharing a color, while the one-vertex operator $N_i = \mathrm{Diag}[0,1,\dots,\eta-1,\dots]$ assigns an energy cost equal to the color label, so the total cost prefers low labels. The normalization factor $1/(\eta N_G)$ is chosen so that no combination of vertex terms can outweigh the penalty for an improper coloring. The authors verify on several small graphs that the sampled ground state uses exactly $\Gamma$ colors, and they report that the feasible-subspace mixer raises the ground-state probability compared with the standard $\sigma^x$ mixer.

Load-bearing premise

The paper assumes that minimizing the sum of the color labels assigned to vertices is equivalent to minimizing the number of distinct colors used, and this equivalence fails for some graphs, so the ground state could use more colors than the chromatic number.

Editorial extensions

If this is right

  • The chromatic number would be available from a single measurement of the ground state, removing the need to run separate coloring feasibility tests for each candidate number of colors.
  • The qubit count per vertex scales as $\lceil\log_2\eta\rceil$ rather than $\eta$, so the encoding is substantially cheaper than the standard QUBO formulation on near-term hardware.
  • For graphs whose optimal coloring uses fewer colors than the encoding's maximum, the feasible-subspace mixer is reported to increase ground-state sampling probability compared with the $\sigma^x$ mixer.
  • The framework extends to constraints such as truck capacities by adding weighted penalty terms, and the authors show parameter regimes where the ground state satisfies those constraints.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the label-sum shortcut is replaced by an explicit count of distinct colors, the same encoding and mixer machinery would apply to the minimum-sum coloring problem, a distinct NP-hard objective; the two objectives can be compared on the same graphs.
  • The numerical tests use small graphs, so a natural next step is to check how the adiabatic gap and required evolution time scale with graph size and degree, which the paper does not address.
  • Because the one-vertex term is a diagonal label sum, exact classical diagonalization of $H_{\mathrm{tot}}^c$ on modest graphs reveals immediately whether the ground-state color count matches the chromatic number, providing a cheap benchmark that bypasses quantum hardware.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 5 minor

Summary. The manuscript proposes a quantum framework for graph coloring in which each vertex's color is encoded in log_2(η) qubits, so that the total qubit count grows linearly in the number of vertices and logarithmically in the number of colors. It introduces a block-diagonal mixer that acts only on the feasible color subspace, and it adds a one-vertex term to the cost Hamiltonian in Eq. (12). The authors claim that the ground state of this Hamiltonian uses the smallest possible number of colors, i.e., the chromatic number, and they support this with adiabatic simulations on small graphs. The paper also extends the formulation to truck-loading problems with capacity constraints by adding Lagrangian penalty terms.

Significance. The efficient encoding and the construction of a feasible-subspace mixer are potentially useful ideas for quantum optimization. However, the central claim of the paper — that the ground state of the Hamiltonian in Eq. (12) yields the chromatic number — is mathematically incorrect. The one-vertex term minimizes the sum of color labels, which is the minimum sum coloring problem, not the minimum number of colors. These two objectives are known to diverge, and the paper provides a concrete counterexample family. Because the chromatic-number result is the main advertised contribution, the paper's significance is substantially weakened; the mixer alone may still be of interest, but the claimed breakthrough is not established.

major comments (4)
  1. [Section III, Eq. (12) and text after Eq. (13)] The assertion that the ground state of H_tot^c colors the graph with the smallest number of colors is false. The vertex term (1/(η N_G)) Σ_i N_i with N_i = Diag[0,1,...,η−1,...] penalizes the sum of the color labels, so among proper colorings it selects the minimum sum coloring, not the minimum number of colors. A concrete counterexample is a graph consisting of a clique of size r with r+1 pendant leaves attached to each clique vertex. For r=2 and η=3, the graph is bipartite (chromatic number 2), but assigning the two clique vertices labels 1 and 2 and all leaves label 0 is a proper 3-coloring with label sum 3, whereas every proper 2-coloring has label sum at least 4 (e.g., labels 0 and 1 on the clique force the three leaves of one clique vertex to have label 1 and the three leaves of the other to have label 0, giving sum 4). Thus the ground state of Eq. (12) uses three colors, contradicting the stated claim.
  2. [Section III, Eq. (13)] The inequality in Eq. (13) only proves that the ground state cannot contain an edge violation, because any edge violation costs 1, which exceeds the maximum possible contribution (η−1)/η < 1 of the one-vertex term. It does not prove that among proper colorings the minimizer of the label sum uses the fewest colors. The sentence immediately following Eq. (13) ('the Ground State ... colors the graph with the smallest number of colors') is therefore unsupported by the argument presented.
  3. [Section III-A and Table I] The numerical tests do not expose the flaw because all tested graphs have the property that the minimum sum coloring uses the same number of colors as the chromatic number. The pentagon graph is an odd cycle, so it is not 2-colorable and the minimum sum coloring must use three colors; the other graphs are small and appear to have the same coincidence. No test is performed on graphs such as the clique-with-leaves family, where the two objectives provably differ. The statement in Section III-A that the Hamiltonian 'correctly determines the chromatic number for different graphs' is therefore not substantiated.
  4. [Abstract and Conclusion] The abstract states that the method 'compute[s] the chromatic number', and Section VI repeats that the ground state is 'the optimal solution with the correct chromatic number'. Since this claim is false in general, these statements overstate the contribution. The framework may still be applicable to deciding η-colorability for a fixed number of colors and to constrained variants, but the chromatic-number estimation claim must be removed or replaced by a correct formulation, which would require a different objective than the simple one-vertex label sum.
minor comments (5)
  1. [Section II, after Eq. (10)] The text says 'the second is the (n−k)×(n−k) identity matrix' when describing the block-diagonal matrix QFT_{k,n}. The total Hilbert space dimension is 2^n, so the second block should be (2^n − k) × (2^n − k). The current statement is dimensionally inconsistent for general n.
  2. [Section IV, Eq. (17)] The sum over q uses the expression 2^{p−1}, which appears to be a typo for 2^{q−1}.
  3. [Section V, paragraph after Eq. (21)] The sentence beginning 'considering all possible permutations of colors' is a fragment that does not form a complete sentence; it should be integrated with the preceding or following text.
  4. [Table I caption] The sentence 'We use 8 for all graphs, except one of the first graph where we use 4 colors' is unclear. Please specify which graph uses 4 colors and which use 8.
  5. [Section II, paragraph on gate counting] The statement that the real-time evolution of the cost Hamiltonian uses at most N_conn 2^{2n} CNOT gates relies on the decomposition of the two-vertex interaction H(i,j); the reader would benefit from a brief explanation of why the Gray-code construction achieves this count for the specific diagonal form of H(i,j).

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the Hamiltonian and mixer are defined analytically, constants are fixed rather than fitted, and validation uses independent Gurobi solutions; the central claim's mathematical flaw is a correctness issue, not a circular reduction.

full rationale

The paper's construction is self-contained. The mixer in Eqs. (8)-(10) is an explicit QFT-based operator with analytically fixed eigenvalues, and the cost Hamiltonian in Eq. (12) is a direct sum of edge penalties and a one-body term with the analytically chosen prefactor 1/(eta N_G). No parameter is fitted to any subset of the data and then renamed a prediction. The numerical tests compare sampled ground-state probabilities against independent Gurobi solutions, so the validation is external rather than circular. No load-bearing self-citations or imported uniqueness theorems are invoked: references [33] and [34] are merely literature pointers to other formulations. The central claim that the ground state of Eq. (12) uses the fewest colors is a mathematical assertion about the objective function, not an identity forced by the definition of the Hamiltonian. In fact, the one-body term minimizes the sum of color labels, which is the minimum sum coloring objective and can use more colors than the chromatic number; this is a genuine correctness flaw in the derivation, but it does not make the prediction equivalent to an input by construction. The derivation is not circular, and the appropriate finding is no significant circularity.

Assumptions & free parameters 2 free parameters · 4 assumptions · 0 invented entities

The paper introduces no new physical entities. The central free parameters are the manually tuned Lagrangian multipliers and the fixed penalty values. The key unstated assumption is the false equivalence between minimizing label sums and minimizing color counts.

free parameters (2)
  • Lagrangian multipliers lambda_k = instance-dependent; e.g., lambda_a, lambda_b, lambda_c in Eq. (23)
    In the truck loading extension, lambda_k are tuned manually to satisfy capacity constraints; the paper gives no systematic rule, and the ground state changes with their values.
  • Penalty parameters a_i and b_j = set to 1
    All same-color and infeasible-state penalties are set to 1; this is a modeling choice, not a fit, but it defines the energy gap.
assumptions (4)
  • standard math Brooks' theorem: chromatic number is at most Delta + 1 for connected graphs that are not complete or odd cycles.
    Used in Section II to justify restricting the number of colors to Delta + 1, which sets the number of qubits per vertex.
  • ad hoc to paper Minimizing the sum of color labels over proper colorings is equivalent to minimizing the number of colors used.
    Introduced in Eq. (11) and in the claim after Eq. (13). This premise is false in general, as shown by the minimum sum coloring problem.
  • domain assumption The adiabatic evolution with the proposed mixer reaches the ground state with sufficiently high probability on practical instances.
    The paper assumes the spectral gap and Trotterization are adequate; only small emulations are provided as evidence.
  • domain assumption The QFT-based mixer preserves the feasible subspace and has the stated ground state.
    The construction in Eq. (10) is shown algebraically, but no proof is given that the mixer is efficiently implementable beyond eight colors or that it maintains the adiabatic gap.

how reviews work

0 comments
Cite this review

Pith. "Pith review of A Resource-Efficient Quantum Framework for Graph Coloring and Chromatic Number Estimation." pith.science (2026). https://pith.science/paper/XB56MLDS

@misc{pith2026260808694,
  author       = {Pith},
  title        = {Pith review of: A Resource-Efficient Quantum Framework for Graph Coloring and Chromatic Number Estimation},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/XB56MLDS}},
  note         = {Machine review of arXiv:2608.08694}
}
read the original abstract

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.

Figures

Figures reproduced from arXiv: 2608.08694 by the authors.

Figure 1
Figure 1. Illustrative example of the mapping to a graph coloring problem. Eight patients require surgery within the time windows [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. The right panels show colored graphs corresponding [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. We set p = 1000 layers in the adiabatic evolution with a final time of Tf = 5 when we use 2 qubits per colors and Tf = 10 in the case of 3 qubits. The left panel presents the probabilities of sampling the ground state for six graphs depicted in the right panels. Different colors of the bars correspond to the different mixers: blue for the −X mixer, orange and red for the reduced mixers with 3 and 6 colors, and green… view at source ↗
Figures from the paper (3 more)
Figure 2
Figure 2. Figure 2: Left panel: Sampled probabilities for a pentagon graph during adiabatic evolution. Right panels: Corresponding graph [PITH_FULL_IMAGE:figures/full_fig_p005_2.png]
Figure 3
Figure 3. Figure 3: Ground state probabilities when we use the proposed Hamiltonian to find the smallest set of colors for six graph [PITH_FULL_IMAGE:figures/full_fig_p006_3.png]
Figure 4
Figure 4. Figure 4: Ground state solutions of the same truck loading problem for different values of Lagrangian multipliers. From left to [PITH_FULL_IMAGE:figures/full_fig_p008_4.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

42 extracted references · 25 canonical work pages

  1. [30]

    Quantum optimization for the graph coloring problem with space-efficient embedding,

    Z. Tabi, K. H. El-Safty, Z. Kallus, P. H ´aga, T. Kozsik, A. Glos, and Z. Zimbor ´as, “Quantum optimization for the graph coloring problem with space-efficient embedding,” in2020 IEEE International Conference on Quantum Computing and Engineering (QCE), 2020, pp. 56–62

    work page 2020

  2. [32]

    Exponential-time quantum algorithms for graph coloring problems,

    K. Shimizu and R. Mori, “Exponential-time quantum algorithms for graph coloring problems,”Algorithmica, vol. 84, no. 12, pp. 3603–3621, 2022

    work page 2022

  3. [1]

    Recent research directions in automated timetabling,

    E. K. Burke and S. Petrovic, “Recent research directions in automated timetabling,”European Journal of Operational Research, vol. 140, no. 2, pp. 266–280, 2002. [Online]. Available: https: //www.sciencedirect.com/science/article/pii/S0377221702000693

    work page 2002

  4. [2]

    Recent developments in practical course timetabling,

    M. W. Carter and G. Laporte, “Recent developments in practical course timetabling,” inPractice and Theory of Automated Timetabling II, E. Burke and M. Carter, Eds. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998, pp. 3–19

    work page 1998

  5. [3]

    T. G. Robertazzi,Computer networks and systems: queueing theory and performance evaluation. Springer Science & Business Media, 2000

    work page 2000

  6. [4]

    Schedule path optimization for adiabatic quantum computing and optimization,

    L. Zeng, J. Zhang, and M. Sarovar, “Schedule path optimization for adiabatic quantum computing and optimization,”Journal of Physics A: Mathematical and Theoretical, vol. 49, no. 16, p. 165305, mar 2016. [Online]. Available: https://dx.doi.org/10.1088/1751-8113/49/16/165305

    work page doi:10.1088/1751-8113/49/16/165305 2016

  7. [5]

    Frequency assignment: Theory and applications,

    W. Hale, “Frequency assignment: Theory and applications,”Proceedings of the IEEE, vol. 68, no. 12, pp. 1497–1514, 1980

    work page 1980

  8. [6]

    Models and solution techniques for frequency assignment problems,

    K. I. Aardal, S. P. Van Hoesel, A. M. Koster, C. Mannino, and A. Sassano, “Models and solution techniques for frequency assignment problems,”Annals of Operations Research, vol. 153, pp. 79–129, 2007

    work page 2007

Show all 42 references
  1. [7]

    Some simplified np- complete graph problems,

    M. Garey, D. Johnson, and L. Stockmeyer, “Some simplified np- complete graph problems,”Theoretical Computer Science, vol. 1, no. 3, pp. 237–267, 1976. [Online]. Available: https://www.sciencedirect.com/ science/article/pii/0304397576900591

    1976

  2. [8]

    An upper bound for the chromatic number of a graph and its application to timetabling problems,

    D. J. A. Welsh and M. B. Powell, “An upper bound for the chromatic number of a graph and its application to timetabling problems,”The Computer Journal, vol. 10, no. 1, pp. 85–86, 01 1967. [Online]. Available: https://doi.org/10.1093/comjnl/10.1.85

    1967 doi

  3. [9]

    A generalized implicit enumeration algorithm for graph coloring,

    M. Kubale and B. Jackowski, “A generalized implicit enumeration algorithm for graph coloring,”Commun. ACM, vol. 28, no. 4, p. 412–418, Apr. 1985. [Online]. Available: https://doi.org/10.1145/3341. 3350

    1985 doi

  4. [10]

    Lewis,Guide to graph colouring

    R. Lewis,Guide to graph colouring. Springer, 2021

    2021

  5. [11]

    A graph coloring algorithm for large scheduling problems,

    F. T. Leighton, “A graph coloring algorithm for large scheduling problems,”J Res Natl Bur Stand, vol. 84, no. 6, p. 489, 1979

    1979

  6. [12]

    New methods to color the vertices of a graph,

    D. Br ´elaz, “New methods to color the vertices of a graph,”Commun. ACM, vol. 22, no. 4, p. 251–256, Apr. 1979. [Online]. Available: https://doi.org/10.1145/359094.359101

    1979

  7. [13]

    T. R. Jensen and B. Toft,Graph coloring problems. John Wiley & Sons, 2011

    2011

  8. [14]

    On the complexity of time table and multi-commodity flow problems,

    S. Even, A. Itai, and A. Shamir, “On the complexity of time table and multi-commodity flow problems,” in16th annual symposium on foundations of computer science (sfcs 1975). IEEE, 1975, pp. 184– 193

    1975

  9. [15]

    Challenges and opportunities in quantum optimization,

    A. Abbas, A. Ambainis, B. Augustino, A. B ¨artschi, H. Buhrman, C. Coffrin, G. Cortiana, V . Dunjko, D. J. Egger, B. G. Elmegreenet al., “Challenges and opportunities in quantum optimization,”Nature Reviews Physics, pp. 1–18, 2024

    2024

  10. [16]

    The unconstrained binary quadratic programming problem: a survey,

    G. Kochenberger, J.-K. Hao, F. Glover, M. Lewis, Z. L ¨u, H. Wang, and Y . Wang, “The unconstrained binary quadratic programming problem: a survey,”Journal of combinatorial optimization, vol. 28, pp. 58–81, 2014

    2014

  11. [17]

    A tutorial on formulating and using qubo models,

    F. Glover, G. Kochenberger, and Y . Du, “A tutorial on formulating and using qubo models,” 2019. [Online]. Available: https://arxiv.org/abs/ 1811.11538

    2019 arXiv

  12. [18]

    Quantum annealing in the transverse ising model,

    T. Kadowaki and H. Nishimori, “Quantum annealing in the transverse ising model,”Phys. Rev. E, vol. 58, pp. 5355–5363, Nov 1998. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevE.58.5355

    1998 doi

  13. [19]

    A quantum adiabatic evolution algorithm applied to random instances of an np-complete problem,

    E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren, and D. Preda, “A quantum adiabatic evolution algorithm applied to random instances of an np-complete problem,”Science, vol. 292, no. 5516, pp. 472–475, 2001. [Online]. Available: https: //www.science.org/doi/abs/10.112...

    2001 doi

  14. [20]

    A quantum approximate optimization algorithm,

    E. Farhi, J. Goldstone, and S. Gutmann, “A quantum approximate optimization algorithm,” 2014. [Online]. Available: https://arxiv.org/abs/ 1411.4028

    2014 arXiv

  15. [21]

    A review on quantum approximate optimization algorithm and its variants,

    K. Blekos, D. Brand, A. Ceschini, C.-H. Chou, R.-H. Li, K. Pandya, and A. Summer, “A review on quantum approximate optimization algorithm and its variants,”Physics Reports, vol. 1068, pp. 1–66, 2024

    2024

  16. [22]

    Graph coloring with quantum annealing,

    J. Kwok and K. Pudenz, “Graph coloring with quantum annealing,”

  17. [23]

    Graph coloring via quantum optimization on a rydberg-qudit atom array,

    T. Angkhanawin, A. Deger, J. D. Pritchard, and C. S. Adams, “Graph coloring via quantum optimization on a rydberg-qudit atom array,”

  18. [24]

    Hybrid quantum- classical algorithms for approximate graph coloring,

    S. Bravyi, A. Kliesch, R. Koenig, and E. Tang, “Hybrid quantum- classical algorithms for approximate graph coloring,”Quantum, vol. 6, p. 678, Mar. 2022. [Online]. Available: https://doi.org/10.22331/ q-2022-03-30-678

    2022

  19. [25]

    Mapping graph coloring to quantum annealing,

    C. Silva, A. Aguiar, P. M. Lima, and I. Dutra, “Mapping graph coloring to quantum annealing,”Quantum Machine Intelligence, vol. 2, pp. 1–19, 2020

    2020

  20. [26]

    Mapping np-hard and np-complete optimisation problems to quadratic unconstrained binary optimisation problems,

    B. Lodewijks, “Mapping np-hard and np-complete optimisation problems to quadratic unconstrained binary optimisation problems,”

  21. [27]

    Efficient hybrid variational quantum algorithm for solving graph coloring problem,

    D. Liu, J. Li, X. Cheng, S. Zhang, Y . Chang, and L. Yan, “Efficient hybrid variational quantum algorithm for solving graph coloring problem,” 2025. [Online]. Available: https://arxiv.org/abs/2504.21335

    2025 arXiv

  22. [28]

    Quantum algorithms for graph coloring and other partitioning, covering, and packing problems,

    S. Gaspers and J. Z. Li, “Quantum algorithms for graph coloring and other partitioning, covering, and packing problems,” 2023. [Online]. Available: https://arxiv.org/abs/2311.08042

    2023 arXiv

  23. [29]

    Available: https://arxiv.org/abs/1911.08043

    [Online]. Available: https://arxiv.org/abs/1911.08043

    1911 arXiv

  24. [31]

    Qudit-inspired optimization for graph coloring,

    D. Jansen, T. Heightman, L. Mortimer, I. Perito, and A. Ac ´ın, “Qudit-inspired optimization for graph coloring,”Phys. Rev. Appl., vol. 22, p. 064002, Dec 2024. [Online]. Available: https://link.aps.org/ doi/10.1103/PhysRevApplied.22.064002

    2024 doi

  25. [33]

    Testing quan- tum and simulated annealers on the drone delivery packing problem,

    S. Tarquini, D. Dragoni, M. Vandelli, and F. Tudisco, “Testing quan- tum and simulated annealers on the drone delivery packing problem,” Quantum Mach. Intell., vol. 8, no. 14, 2026

    2026

  26. [34]

    Drone delivery packing problem on a neutral-atom quantum computer,

    S. Tarquini, M. Vandelli, F. Ferrari, D. Dragoni, and F. Tudisco, “Drone delivery packing problem on a neutral-atom quantum computer,” 2026. [Online]. Available: https://arxiv.org/abs/2602.15487

    2026

  27. [35]

    Exploring the potential of qutrits for quantum optimization of graph coloring,

    G. Bottrill, M. Pandey, and O. D. Matteo, “Exploring the potential of qutrits for quantum optimization of graph coloring,” 2023. [Online]. Available: https://arxiv.org/abs/2308.08050

    2023 arXiv

  28. [36]

    Quantum computing with Qiskit,

    A. Javadi-Abhari, M. Treinish, K. Krsulich, C. J. Wood, J. Lishman, J. Gacon, S. Martiel, P. D. Nation, L. S. Bishop, A. W. Cross, B. R. Johnson, and J. M. Gambetta, “Quantum computing with Qiskit,” 2024

    2024

  29. [37]

    Quantum circuits for general multiqubit gates,

    M. M ¨ott¨onen, J. J. Vartiainen, V . Bergholm, and M. M. Salomaa, “Quantum circuits for general multiqubit gates,”Phys. Rev. Lett., vol. 93, p. 130502, Sep 2004. [Online]. Available: https://link.aps.org/ doi/10.1103/PhysRevLett.93.130502

    2004 doi

  30. [38]

    On colouring the nodes of a network,

    R. L. Brooks, “On colouring the nodes of a network,”Mathematical Proceedings of the Cambridge Philosophical Society, vol. 37, no. 2, p. 194–197, 1941

    1941

  31. [41]

    Gurobi Optimizer Reference Manual,

    Gurobi Optimization, LLC, “Gurobi Optimizer Reference Manual,”

  32. [2020]

    Available: https://arxiv.org/abs/2012.04470

    [Online]. Available: https://arxiv.org/abs/2012.04470

    2012 arXiv

  33. [2024]

    Available: https://www.gurobi.com APPENDIX Table II reports the data plotted in Fig

    [Online]. Available: https://www.gurobi.com APPENDIX Table II reports the data plotted in Fig. 3. Graph mixer X Mixer M(3,4) Mixer M(4,4) Mixer M(6,8) Mixer M(8,8) a 0.59571(7) 0.79920(6) 0.54206(7) b 0.1763(4) 0.3754(5) 0.1884(4) c 0.0958(3) 0.5208(5) 0.0573(3) d 0.1375(3) 0....

  34. [2025]

    Available: https://arxiv.org/abs/2504.08598

    [Online]. Available: https://arxiv.org/abs/2504.08598

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.