The ability to perform quantum error correction (QEC) and robust gate operations on encoded qubits opens the door to demonstrations of quantum algorithms. Contemporary QEC schemes typically require mid-circuit measurements with feed-forward control, which are challenging for qubit control, often slow, and susceptible to relatively high error rates. In this work, we propose and experimentally demonstrate a universal toolbox of fault-tolerant logical operations on error-detecting codes without mid-circuit measurements on a trapped-ion quantum processor. We present modular logical state teleportation between two four-qubit error-detecting codes without measurements during algorithm execution. Moreover, we realize a fault-tolerant universal gate set on an eight-qubit error-detecting code hosting three logical qubits, based on state injection, which can be executed by coherent gate operations only. We apply this toolbox to experimentally realize Grover's quantum search algorithm fault-tolerantly on three logical qubits encoded in eight physical qubits, with the implementation displaying clear identification of the desired solution states. Our work demonstrates the practical feasibility and provides first steps into the largely unexplored direction of measurement-free quantum computation.The ability to perform quantum error correction (QEC) and robust gate operations on encoded qubits opens the door to demonstrations of quantum algorithms. Contemporary QEC schemes typically require mid-circuit measurements with feed-forward control, which are challenging for qubit control, often slow, and susceptible to relatively high error rates. In this work, we propose and experimentally demonstrate a universal toolbox of fault-tolerant logical operations on error-detecting codes without mid-circuit measurements on a trapped-ion quantum processor. We present modular logical state teleportation between two four-qubit error-detecting codes without measurements during algorithm execution. Moreover, we realize a fault-tolerant universal gate set on an eight-qubit error-detecting code hosting three logical qubits, based on state injection, which can be executed by coherent gate operations only. We apply this toolbox to experimentally realize Grover's quantum search algorithm fault-tolerantly on three logical qubits encoded in eight physical qubits, with the implementation displaying clear identification of the desired solution states. Our work demonstrates the practical feasibility and provides first steps into the largely unexplored direction of measurement-free quantum computation.

Nature CommunicationsJan 26, 20262 citations

Measurement-Based Quantum Computation and Undecidable Logic

Maarten Van den Nest, Hans J. Briegel

arXiv:quant-ph/0610040Foundations of PhysicsMar 13, 200817 citations

The Power of Power-of-SWAP: Postselected Quantum Computation with the Exchange Interaction

Jędrzej Burkat, Sergii Strelchuk, Michał Studziński

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.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.

quant-pharXiv:2603.28527Mar 31, 20260 citations

\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.