Recursive encoding and decoding of the noiseless subsystem for qudits
arXiv:1310.4401 · doi:10.1103/PhysRevA.89.042301
Abstract
We give a full explanation of the noiseless subsystem that protects a single-qubit against collective errors and the corresponding recursive scheme described by C.-K. Li et. al. [Phys. Rev. A 84, 044301 (2011)] from a representation theory point of view. Furthermore, we extend the construction to qudits under the influence of collective SU() errors. We find that under this recursive scheme, the asymptotic encoding rate is .
References in corpus (17)
- Decoherence Free Subspaces for Quantum Computation
- Noiseless Quantum Codes
- A Theory of Quantum Error-Correcting Codes
- Theory of Decoherence-Free Fault-Tolerant Universal Quantum Computation
- Quantum Error Correction
- Error Avoiding Quantum Codes
- Dissipation and Decoherence in a Quantum Register
- A numerical algorithm for the explicit calculation of SU(N) and SL(N,C) Clebsch-Gordan coefficients
- Decoherence-Free Subspaces for Multiple-Qubit Errors: (I) Characterization
- A method to find quantum noiseless subsystems
- Protecting Quantum Information Encoded in Decoherence Free States Against Exchange Errors
- Exploring Noiseless Subsystems via Nuclear Magnetic Resonance
- Implementing Shor's algorithm on Josephson Charge Qubits
- Efficient Quantum Error Correction for Fully Correlated Noise
- Implications of Qudit Superselection rules for the Theory of Decoherence-free Subsystems
- Recursive Encoding and Decoding of Noiseless Subsystem and Decoherence Free Subspace
- Quantum Error Correction with Uniformly Mixed State Ancillae