The Power of Power-of-SWAP: Postselected Quantum Computation with the Exchange Interaction
J\k{e}drzej Burkat, Sergii Strelchuk, Micha{\l} Studzi\'nski

TL;DR
This paper introduces XQP, a quantum computation model using exchange interactions, and demonstrates its computational complexity, universality properties, and potential for near-term quantum advantage demonstrations.
Contribution
The paper defines XQP, analyzes its computational complexity, proves its hardness for classical simulation, and explores its structural and universality properties.
Findings
XQP is between BPP and BQP in computational power.
Multiplicative-error simulation of XQP would collapse the polynomial hierarchy.
XQP circuits with only √SWAP gates are hard to simulate and generate t-designs.
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 sub-universal model captures decoherence-free subspace computation without access to singlet states. We show that XQP occupies an intermediate position between BPP and BQP, as its efficient multiplicative-error simulation would collapse the polynomial hierarchy to its third level. We further provide evidence that additive-error simulation of XQP would enable efficient additive-error simulation of arbitrary BQP computations. Remarkably, the restricted family of XQP circuits consisting solely of gates remains hard to simulate to multiplicative error. We additionally prove that circuits generated by gates are semi-universal, generate -designs…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
