analiza aiqbench
This research establishes the universality of quantum computation using only the isotropic Heisenberg exchange interaction and computational basis measurements, defining a new model called Exchange Quantum Polynomial Time (XQP). The study proves that circuits based solely on $\sqrt{\mathrm{SWAP}}$ gates can achieve full universality under polynomial overheads while generating $t$-designs for SU(2)-invariant unitaries. These findings are significant for near-term quantum hardware, as they offer a robust framework for demonstrating quantum advantage without relying on singlet states or complex control sequences.
The Power of Power-of-SWAP: Postselected Quantum Computation with the Exchange Interaction
arXiv:2603.28527v2 Announce Type: replace Abstract: We introduce Exchange Quantum Polynomial Time (XQP) circuits, which comprise quantum computation using only computational basis SPAM and the isotropic Heisenberg exchange interaction. Structurally, this restricted model captures decoherence-free subspace computation without access to singlet states. We prove that XQP, as well as its constrained family consisting solely of $\sqrt{\mathrm{SWAP}}$ gates, is universal for quantum computation under polynomial overheads in circuit depth and size. This establishes the universality of the $\sqrt{\mathrm{SWAP}}$ gate on its own under a logical encoding of qubits. We further prove that circuits generated by $\sqrt{\mathrm{SWAP}}$ gates are semi-universal, and thus generate $t$-designs for the uniform distribution over SU(2)-invariant unitaries. Finally, we study additional properties of the XQP model, including its relation to the six-vertex and Potts model in statistical physics. Our findings suggest that XQP circuits are naturally suited to near-term hardware and provide a simple platform for experimental demonstrations of quantum advantage.
Abstract:We introduce Exchange Quantum Polynomial Time (XQP) circuits, which comprise quantum computation using only computational basis SPAM and the isotropic Heisenberg exchange interaction. Structurally, this restricted model captures decoherence-free subspace computation without access to singlet states. We prove that XQP, as well as its constrained family consisting solely of $\sqrt{\mathrm{SWAP}}$ gates, is universal for quantum computation under polynomial overheads in circuit depth and size. This establishes the universality of the $\sqrt{\mathrm{SWAP}}$ gate on its own under a logical encoding of qubits. We further prove that circuits generated by $\sqrt{\mathrm{SWAP}}$ gates are semi-universal, and thus generate $t$-designs for the uniform distribution over SU(2)-invariant unitaries. Finally, we study additional properties of the XQP model, including its relation to the six-vertex and Potts model in statistical physics. Our findings suggest that XQP circuits are naturally suited to near-term hardware and provide a simple platform for experimental demonstrations of quantum advantage.
arXiv:2603.28527 [quant-ph]
(or arXiv:2603.28527v2 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2603.28527 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.
Text integral sub licența deschisă a publicației · 236 cuvinte
Subiecte conexe
News Archive 2026
Quantum Computing Report · 25 iul. 2026

Researchers Build Entangled Bell Pair Spanning 100 Qubits with 59% Fidelity
Quantum Zeitgeist · 6 oct. 2026

News
Quantum Computing Report · 25 iul. 2026

Researchers Link Environmental Records to Universal Quantum Computation
Quantum Zeitgeist · 19 sept. 2026