Maximal noiseless code rates for collective rotation channels on qudits

From MaRDI portal
Publication:898441

DOI10.1007/S11128-015-1101-2zbMATH Open1327.81154arXiv1306.0981OpenAlexW1883001867MaRDI QIDQ898441FDOQ898441

Mikio Nakahara, Yiu-Tung Poon, Nung-Sing Sze, Chi-Kwong Li

Publication date: 9 December 2015

Published in: Quantum Information Processing (Search for Journal in Brave)

Abstract: We study noiseless subsystems on collective rotation channels of qudits, i.e., quantum channels with operators in the set mathcalE(d,n)=Uotimesn:UinmathrmSU(d). This is done by analyzing the decomposition of the algebra mathcalA(d,n) generated by mathcalE(d,n). We summarize the results for the channels on qubits (d=2), and obtain the maximum dimension of the noiseless subsystem that can be used as the quantum error correction code for the channel. Then we extend our results to general d. In particular, it is shown that the code rate, i.e., the number of protected qudits over the number of physical qudits, always approaches 1 for a suitable noiseless subsystem. Moreover, one can determine the maximum dimension of the noiseless subsystem by solving a non-trivial discrete optimization problem. The maximum dimension of the noiseless subsystem for d=3 (qutrits) is explicitly determined by a combination of mathematical analysis and the symbolic software Mathematica.


Full work available at URL: https://arxiv.org/abs/1306.0981




Recommendations




Cites Work


Cited In (4)

Uses Software





This page was built for publication: Maximal noiseless code rates for collective rotation channels on qudits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898441)