{"paper":{"title":"From Constraint to Code: DQI-Kit -- A Software Framework for Decoded Quantum Interferometry","license":"http://creativecommons.org/licenses/by/4.0/","headline":"DQI-Kit automatically encodes constrained optimization problems into Max-LINSAT for Decoded Quantum Interferometry.","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Simon Thelen, Wolfgang Mauerer","submitted_at":"2026-05-16T12:14:30Z","abstract_excerpt":"Trying to solve hard optimisation problems with quantum techniques requires transformations of domain objectives and constraints into formats compatible with a chosen quantum algorithm. This often introduces inefficiencies and overheads that limit or even endanger potential quantum advantage for current and future approaches. To understand and mitigate these inefficiencies, software toolchains are essential for implementing transformations, analysing overheads and eventually selecting optimal transformation paths. Decoded Quantum Interferometry (DQI) is a novel approach that achieves apparent "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We present DQI-Kit, a software framework that provides a unified, extensible interface for automatically encoding constrained optimisation problems into Max-LINSAT. Users can describe the various types of objectives and constraints that are common in industrial optimisation problems. Our framework converts these into Max-LINSAT instances via a series of problem transformations and computes an estimate of the expected performance of DQI on these instances.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The transformations implemented in DQI-Kit will produce Max-LINSAT instances whose DQI performance estimates meaningfully reflect the overheads and potential advantage of the original constrained problem.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"DQI-Kit automates encoding of objectives and constraints into Max-LINSAT instances and estimates expected DQI performance on the resulting problems.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"DQI-Kit automatically encodes constrained optimization problems into Max-LINSAT for Decoded Quantum Interferometry.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"f139413b2b0c476d121b925c73173329a4682a35507e744d78393e7b7d328736"},"source":{"id":"2605.16955","kind":"arxiv","version":1},"verdict":{"id":"0920f2ac-3f1f-48a3-b707-5548e9aa188b","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T20:48:30.935616Z","strongest_claim":"We present DQI-Kit, a software framework that provides a unified, extensible interface for automatically encoding constrained optimisation problems into Max-LINSAT. Users can describe the various types of objectives and constraints that are common in industrial optimisation problems. Our framework converts these into Max-LINSAT instances via a series of problem transformations and computes an estimate of the expected performance of DQI on these instances.","one_line_summary":"DQI-Kit automates encoding of objectives and constraints into Max-LINSAT instances and estimates expected DQI performance on the resulting problems.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The transformations implemented in DQI-Kit will produce Max-LINSAT instances whose DQI performance estimates meaningfully reflect the overheads and potential advantage of the original constrained problem.","pith_extraction_headline":"DQI-Kit automatically encodes constrained optimization problems into Max-LINSAT for Decoded Quantum Interferometry."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16955/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T21:01:19.091514Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T21:00:54.240351Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T19:51:58.761937Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T18:41:56.235065Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.319503Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"7f04590f33b04f76bee004a2981a806a7bc921bf9b9a7d0244edbed6736e1bb3"},"references":{"count":65,"sample":[{"doi":"","year":2022,"title":"Quantum annealing for industry applications: Introduction and review,","work_id":"5c66e762-9e13-44e2-ba20-12d4847a9cbd","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1016/j.physrep.2024.03.002","year":2024,"title":"Physics Reports1068, 1–66 (2024)","work_id":"c9399f36-b380-4e5c-afd4-811e1e360f6e","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Predict and conquer: Navigating algorithm trade-offs with quantum design automation,","work_id":"2cda8a9e-6813-4a56-a69d-bc0046d1a9b3","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Approximating under the influence of quantum noise and compute power,","work_id":"91ec12c2-58da-485b-a07a-d537aa82aa79","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1140/epjqt/s40507-021-00114-x","year":2021,"title":"Industry quantum computing applications,","work_id":"f53ec419-6fbb-4219-9ae3-35865f911421","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":65,"snapshot_sha256":"81c324dfd9212109158c2fffde7a515ee28b27fa28859934c5aaab5e6c1a3df0","internal_anchors":3},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}