Constructions for universal quantum computation in the [[n,n-2,2]] error-detecting code detect single-gate errors at computation end, providing weak fault tolerance with reduced overhead versus full error correction.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2024 2verdicts
UNVERDICTED 2representative citing papers
In the large-N limit, spin squeezing torsion yields a nonlinear qubit governed by the two-state Gross-Pitaevskii equation that solves single-input state discrimination on the Bloch sphere.
citing papers explorer
-
Weakly Fault-Tolerant Computation in a Quantum Error-Detecting Code
Constructions for universal quantum computation in the [[n,n-2,2]] error-detecting code detect single-gate errors at computation end, providing weak fault tolerance with reduced overhead versus full error correction.
-
From spin squeezing to fast state discrimination
In the large-N limit, spin squeezing torsion yields a nonlinear qubit governed by the two-state Gross-Pitaevskii equation that solves single-input state discrimination on the Bloch sphere.