{
  "abstract": "Quantum algorithms that sample basis states and diagonalize a Hamiltonian in their span depend on repairing noisy measurement outcomes, using a constraint native to the target problem$\\unicode{x2014}$typically particle-number symmetry. Many eigenvalue problems possess no such constraint. Here we show that the constraint can instead be engineered into the sampling representation. Using dual-rail encoding, $|0\\rangle\\to|01\\rangle$ and $|1\\rangle\\to|10\\rangle$, we implement sampling operations in encoded form, making code-space violations local recovery signals for self-consistent, reference-based repair. On transverse- and mixed-field Ising models of up to 36 spin sites, which lack a $U(1)$ symmetry usable for recovery, code-space recovery reached lower Ritz energies than diagonalization over the full observed support of matched unencoded samples while using 38-84% fewer basis states, despite a twofold qubit overhead. The margin was largest for the two-dimensional and 36-site systems and was already present in the first recovery iteration. Recoverable structure can be engineered rather than inherited.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2607.10227",
  "author_total": 4,
  "authors": [
    {
      "name": "Byeongyong Park"
    },
    {
      "name": "Sanha Kang"
    },
    {
      "name": "Doyeol Ahn"
    },
    {
      "name": "Keunhong Jeong"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/52n0rwszvh5v7.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2607.10227",
  "fulltext_url": null,
  "id": "52n0rwszvh5v7",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2607.10227",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7168320965",
  "pdf_url": "https://arxiv.org/pdf/2607.10227",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-29",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/52n0rwszvh5v7.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:25:31Z",
      "native_id": "2607.10227",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2607.10227"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Code-space recovery for sample-based quantum diagonalization beyond native symmetry constraints",
  "title_text": "Code-space recovery for sample-based quantum diagonalization beyond native symmetry constraints",
  "type": "preprint",
  "updated_at": "2026-10-30T12:25:31Z",
  "url": "https://research.draconitic.com/paper/52n0rwszvh5v7",
  "venue": "arXiv",
  "versions": []
}