For a family of spherically symmetric quantum errors, any non-degenerate quantum code leaves the corrected state no closer to the ideal, and any detected syndrome randomizes the logical qubits.
Universal Fault-Tolerant Computation on Decoherence-Free Subspaces
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
A general scheme to perform universal quantum computation within decoherence-free subspaces (DFSs) of a system's Hilbert space is presented. This scheme leads to the first fault-tolerant realization of universal quantum computation on DFSs with the properties that (i) only one- and two-qubit interactions are required, and (ii) the system remains within the DFS throughout the entire implementation of a quantum gate. We show explicitly how to perform universal computation on clusters of the four-qubit DFS encoding one logical qubit each under "collective decoherence" (qubit-permutation-invariant system-bath coupling). Our results have immediate relevance to a number of solid-state quantum computer implementations, in particular those in which quantum logic is implemented through exchange interactions, such as the recently proposed spin-spin coupled GaAs quantum dot arrays and the Si:$^{31}$P nuclear spin arrays.
fields
quant-ph 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Quantum codes do not fix isotropic errors
For a family of spherically symmetric quantum errors, any non-degenerate quantum code leaves the corrected state no closer to the ideal, and any detected syndrome randomizes the logical qubits.