Generalized Performance of Concatenated Quantum Codes—A Dynamical Systems Approach

From MaRDI portal
Publication:5281783

DOI10.1109/TAC.2006.871942zbMATH Open1366.81123arXivquant-ph/0409084OpenAlexW3100958397MaRDI QIDQ5281783FDOQ5281783


Authors: Jesse Fern, Slobodan N. Simić, Julia Kempe, S. Shankar Sastry Edit this on Wikidata


Publication date: 27 July 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Abstract: We apply a dynamical systems approach to concatenation of quantum error correcting codes, extending and generalizing the results of Rahn et al. [1] to both diagonal and nondiagonal channels. Our point of view is global: instead of focusing on particular types of noise channels, we study the geometry of the coding map as a discrete-time dynamical system on the entire space of noise channels. In the case of diagonal channels, we show that any code with distance at least three corrects (in the infinite concatenation limit) an open set of errors. For Calderbank-Shor-Steane (CSS) codes, we give a more precise characterization of that set. We show how to incorporate noise in the gates, thus completing the framework. We derive some general bounds for noise channels, which allows us to analyze several codes in detail.


Full work available at URL: https://arxiv.org/abs/quant-ph/0409084







Cited In (1)





This page was built for publication: Generalized Performance of Concatenated Quantum Codes—A Dynamical Systems Approach

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