Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
89 tokens/sec
Gemini 2.5 Pro Premium
41 tokens/sec
GPT-5 Medium
23 tokens/sec
GPT-5 High Premium
19 tokens/sec
GPT-4o
96 tokens/sec
DeepSeek R1 via Azure Premium
88 tokens/sec
GPT OSS 120B via Groq Premium
467 tokens/sec
Kimi K2 via Groq Premium
197 tokens/sec
2000 character limit reached

Recursive encoding and decoding of the noiseless subsystem for qudits (1310.4401v2)

Published 16 Oct 2013 in quant-ph

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($d$) errors. We find that under this recursive scheme, the asymptotic encoding rate is $1/d$.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.