Concentration of Quantum Channels With Random Kraus Operators via Matrix Bernstein Inequality

In this study, we generate quantum channels with random Kraus operators to typically obtain almost twirling quantum channels and quantum expanders. To prove the concentration phenomena, we use matrix Bernstein’s inequality. In this way, our random models do not utilize Haar-distributed unitary matrices or Gaussian matrices. Rather, as in the preceding research, we use unitary t-designs to generate mixed tensor-product unitary channels acting on C<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><sup>dt</sup></i>. Although our bounds in Schatten p-norm are valid only for 1 ≤ <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">p</i> ≤ 2, we show that they are typically quantum ϵ-twirling channels with the tail bound proportional to 1/poly(<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">d<sup>t</sup></i>), while such bounds were previously constants. The number of required Kraus operators was also improved by powers of log <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">d</i> and <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t</i>, to be proportional to <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">d<sup>t</sup></i> log <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">d</i>/ϵ<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup>. Such random quantum channels are also typically quantum expanders, but the number of Kraus operators must grow proportionally to <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t</i> log <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">d</i> in our case. Finally, a new non-unital model of super-operators generated by bounded and isotropic random Kraus operators was introduced, which can be typically rectified to yield almost randomizing quantum channels and quantum expanders.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Information Theory
Published
2025-05-05
DOI
https://doi.org/10.1109/tit.2025.3567085
Citations
1
Primary Topic
Approximation Theory and Sequence Spaces
Type
article
Field-Weighted Citation Impact
2.63

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Concentration of Quantum Channels With Random Kraus Operators via Matrix Bernstein Inequality

Motohisa Fukuda
1 citations
IEEE Transactions on Information Theory
Approximation Theory and Sequence Spaces
2.63
article

Concentration of Quantum Channels With Random Kraus Operators via Matrix Bernstein Inequality

Motohisa Fukuda
article en
1 citations

Abstract

In this study, we generate quantum channels with random Kraus operators to typically obtain almost twirling quantum channels and quantum expanders. To prove the concentration phenomena, we use matrix Bernstein’s inequality. In this way, our random models do not utilize Haar-distributed unitary matrices or Gaussian matrices. Rather, as in the preceding research, we use unitary t-designs to generate mixed tensor-product unitary channels acting on C<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><sup>dt</sup></i>. Although our bounds in Schatten p-norm are valid only for 1 ≤ <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">p</i> ≤ 2, we show that they are typically quantum ϵ-twirling channels with the tail bound proportional to 1/poly(<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">d<sup>t</sup></i>), while such bounds were previously constants. The number of required Kraus operators was also improved by powers of log <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">d</i> and <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t</i>, to be proportional to <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">d<sup>t</sup></i> log <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">d</i>/ϵ<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup>. Such random quantum channels are also typically quantum expanders, but the number of Kraus operators must grow proportionally to <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t</i> log <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">d</i> in our case. Finally, a new non-unital model of super-operators generated by bounded and isotropic random Kraus operators was introduced, which can be typically rectified to yield almost randomizing quantum channels and quantum expanders.

IEEE Transactions on Information TheoryVol. 71(7)
Yamagata University (JP)
Japan Society for the Promotion of Science
Reduced inequalities
Openalex Percentile: Top 12%
Approximation Theory and Sequence Spaces
2.63
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.