{
  "abstract": "Recently, a hybrid qudit-qubit algorithm [1] was presented for solving the integer programming problem with a polynomial quantum advantage. In this work, we investigate the algorithm [1] to understand the role of qudits ($d$-dimensional quantum system) by conducting a comparative resource analysis with its qubit-only implementation and the classical simulability of the algorithm by exploring the entanglement structure. The resource analysis part is performed in terms of logical gate counts, and fault-tolerant physical resources, including non-Clifford gates. The hybrid qudit-qubit implementation has a more compact structure of the unitary operators as opposed to its qubit-only simulation which reduces the logical and fault-tolerant resource requirements. Two example problems, one with qutrits ($d=3$) and the other with ququint ($d=5$), when contrasted with their qubit-only implementation, within a simplified fault-tolerant resource model, showed $\\sim 180 \\times $ and $\\sim 2220\\times$ fewer total resource count, respectively. For the entanglement study, volume-law-like entropy growth and signatures of multi-partite entanglement is observed leading to increasing difficulty in the classical simulation of the algorithm. The algorithm generates synergistic tri-partite entanglement even for a quadratic problem, revealing that the algorithmic structure itself can generate higher-order entanglement in the system independent of the problem.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.23243",
  "author_total": 3,
  "authors": [
    {
      "name": "Kapil Goswami"
    },
    {
      "name": "Rick Mukherjee"
    },
    {
      "name": "Peter Schmelcher"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/2ycmmhdjjmdq1.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.23243",
  "fulltext_url": null,
  "id": "2ycmmhdjjmdq1",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.23243",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "physics.comp-ph"
    ],
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7214054669",
  "pdf_url": "https://arxiv.org/pdf/2609.23243",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-19",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/2ycmmhdjjmdq1.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:23:19Z",
      "native_id": "2609.23243",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.23243"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:physics.comp-ph",
      "subfield": "computational"
    },
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Resource and entanglement study of a hybrid qudit-qubit quantum algorithm for solving the integer programming problem",
  "title_text": "Resource and entanglement study of a hybrid qudit-qubit quantum algorithm for solving the integer programming problem",
  "type": "preprint",
  "updated_at": "2026-10-30T12:23:19Z",
  "url": "https://research.draconitic.com/paper/2ycmmhdjjmdq1",
  "venue": "arXiv",
  "versions": []
}