Code-space recovery for sample-based quantum diagonalization beyond native symmetry constraints

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.

arXiv:2607.10227 [quant-ph]

(or arXiv:2607.10227v2 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2607.10227 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.