Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2511.12700 · PRX Quantum

Moments of Quantum Channel Ensembles

Matthew Duschenes, Diego García-Martín, Zoë Holmes, M. Cerezo

quant-phcond-mat.stat-mechSubmitted Nov 16, 2025• Announced Nov 18, 2025• 3 citations• Revised Sep 9, 2026 (v2)
v1 · Nov 16, 2025v2 · Sep 9, 2026
arXivHTMLPDF

Abstract

Moments of ensembles of unitaries play a central role in quantum information theory as they capture the statistical properties of dynamics of systems with some form of randomness. Indeed, concepts such as approximate $t$-designs arise when comparing how close an associated moment operator of a given unitary ensemble is to that of another, reference ensemble. Despite the importance of moment operators, their properties have not been as explored for quantum channels. In this work we develop a theoretical framework to compute moment operators for ensembles of quantum channels, for all moment orders $t$, with a special focus on determining ensembles that can be used as points of reference. By deriving hierarchies between ensembles, via inequalities of their moment operator norms, we give them operational meaning, and define useful concepts such as that of channel $t$-designs. Finally, we perform theoretical and numerical studies which show that different types of noise can decrease the norm of the moment operators (e.g., depolarizing noise), as well as increase it (e.g., amplitude damping noise), and generalize noise-induced concentration phenomena to channel-design-induced phenomena. Along the way, we find a block-orthogonal basis for permutations, which greatly simplifies our analyses, and may be of independent interest in moment calculations.

Journal reference
PRX Quantum 7, 033050 (2026)
DOI
10.1103/grdp-jph9
Comments
12+33 pages, 5+5 figures

Related papers

Entanglement Fidelity in Standard Quantum Channels

Niccolò Zanieri, Marios Kountouris

Entanglement fidelity quantifies how well a quantum channel preserves the correlations between a transmitted system and an inaccessible reference system. We derive closed-form expressions for the entanglement fidelity associated with several standard quantum noise models, including the random Pauli-X, dephasing, depolarizing, Werner-Holevo, generalized Pauli (Weyl), and amplitude-damping channels. For each model, we express the entanglement fidelity in terms of a general input density operator $ρ$, using Schumacher's Kraus-operator approach, which provides a channel-agnostic recipe applicable to any completely positive trace-preserving (CPTP) map with a finite Kraus representation. We then specialize to a communication scenario in which the source emits a two-letter parametric alphabet, thereby making explicit the dependence of entanglement preservation on both channel and source parameters. The resulting expressions enable direct comparisons of channel performance and rankings for representative families of input states, including common qubit states.

quant-pharXiv:2603.07761•International Conference on Quantum Communications, Networking, and Computing (QCNC)•Mar 10, 2026•0 citations

Exact spectral gaps of random one-dimensional quantum circuits

Andrew E. Deneris, Pablo Bermejo, Paolo Braccia +2 more

The spectral gap of local random quantum circuits is a fundamental property that determines how close the moments of the circuit's unitaries match those of a Haar random distribution. When studying spectral gaps, it is common to bound these quantities using tools from statistical mechanics or via quantum information-based inequalities. By focusing on the second moment of one-dimensional unitary circuits where nearest-neighboring gates act on sets of qudits (with open and closed boundary conditions), we show that one can exactly compute the associated spectral gaps. Indeed, having access to their functional form allows us to prove several important results, such as the fact that the spectral gap for closed boundary condition is exactly the square of the gap for open boundaries, as well as improve on previously known bounds for approximate design convergence. Finally, we verify our theoretical results by numerically computing the spectral gap for systems of up to 70 qubits, as well as comparing them to gaps of random orthogonal and symplectic circuits.

arXiv:2408.11201•Physical Review A•Nov 25, 2025•12 citations

Random unitary models and their localization properties

Alain Joye

This paper aims at presenting a few models of quantum dynamics whose description involves the analysis of random unitary matrices for which dynamical localization has been proven to hold. Some models come from physical approximations leading to effective descriptions of the dynamics of certain random systems that are popular in condensed matter theoretical physics, whereas others find their roots in more abstract considerations and generalizations. Although they may differ in details, the operators describing the models all have in common the following key features on which their analysis relies heavily: their dynamics is generated by unitary operators on an infinite dimensional underlying Hilbert space which have a band structure when expressed as matrices in a certain basis and the randomness of the models lies in phases of the matrix elements.

arXiv:1105.0097•Contemporary mathematics - American Mathematical Society•Jan 1, 2011•8 citations

Efficient Unitary T-designs from Random Sums

Chi-Fang Chen, Jordan Docter, Michelle Xu +2 more

Unitary $T$-designs play an important role in quantum information, with diverse applications in quantum algorithms, benchmarking, tomography, and communication. Until now, the most efficient construction of unitary $T$-designs for $n$-qudit systems has been via random local quantum circuits, which have been shown to converge to approximate $T$-designs in the diamond norm using $O(T^{5+o(1)} n^2)$ quantum gates. In this work, we provide a new construction of $T$-designs via random matrix theory using $\tilde{O}(T^2 n^2)$ quantum gates. Our construction leverages two key ideas. First, in the spirit of central limit theorems, we approximate the Gaussian Unitary Ensemble (GUE) by an i.i.d. sum of random Hermitian matrices. Second, we show that the product of just two exponentiated GUE matrices is already approximately Haar random. Thus, multiplying two exponentiated sums over rather simple random matrices yields a unitary $T$-design, via Hamiltonian simulation. A central feature of our proof is a new connection between the polynomial method in quantum query complexity and the large-dimension ($N$) expansion in random matrix theory. In particular, we show that the polynomial method provides exponentially improved bounds on the high moments of certain random matrix ensembles, without requiring intricate Weingarten calculations. In doing so, we define and solve a new type of moment problem on the unit circle, asking whether a finite number of equally weighted points, corresponding to eigenvalues of unitary matrices, can reproduce a given set of moments.

arXiv:2402.09335•Feb 14, 2024•22 citations

Information-theoretic aspects of quantum channels

Elton Yechao Zhu

Quantum information theory is an important element of quantum computing and quantum communication systems. Whenever a quantum computer needs to send an output state to another party, or two parties need to establish quantum entanglement or secure keys via quantum communication, a quantum channel is inevitably involved. Hence it is absolutely important to understand the properties of quantum channels for the purpose of communication. Here, quantum entanglement plays a huge role. Pre-shared entanglement could enhance the capacity, whereas entanglement across inputs could render the capacity formulae impossible to compute. The first part of this thesis seeks to address this issue, by studying the additivity properties in the communication of classical and quantum information, with or without entanglement assistance. I also study the reverse problem that, given a channel capacity, what can be said about the quantum channel itself. Quantum information theory also serves as an important tool in understanding other systems, for example, black holes. In this thesis, I model a closed random system by a unitary channel, and study how typical unitary channels process information. This provides huge insight into the strength of generalized entanglement measures, and the hierarchies in the complexity of information scrambling.

•Jan 1, 2019•0 citations

Enhanced quantum capacity thresholds from symmetry

Avantika Agarwal, Amolak Ratan Kalra, Sungjai Lee +4 more

The quantum capacity captures the value of a quantum channel for transmitting quantum information, establishing the fundamental limits on quantum communication. In spite of its central role in quantum information theory, the quantum capacity of most channels is unknown, with wide gaps between the best upper and lower bounds. Even deciding whether a channel has nonzero capacity -- finding its capacity threshold -- is difficult. In this paper we report significant increases in the capacity thresholds of two prototypical noise models: the depolarizing channel and Pauli channels. In the case of the depolarizing channel, this is the first improvement in 18 years, giving a bigger increase beyond the hashing bound than all previous improvements combined. Our starting point is the representation theoretic framework recently proposed by Bhalerao and Leditzky (2025) to compute coherent information for special permutation invariant states. We generalize their framework to the full symmetric subspace, which allow us to optimize coherent information over rank two states in that space. A representation theoretic calculation shows that exponentially many Kraus operators of the channel annihilate the symmetric space, corresponding to a massive decrease in environment entropy for states on the symmetric space compared to the maximally mixed state. This explains the enhanced coherent information as a manifestation of degeneracy for the resulting codes.

quant-pharXiv:2605.09138•May 12, 2026•5 citations
Moments of ensembles of unitaries play a central role in quantum information theory as they capture the statistical properties of dynamics of systems with some form of randomness. Indeed, concepts such as approximate ttt-designs arise when comparing how close an associated moment operator of a given unitary ensemble is to that of another, reference ensemble. Despite the importance of moment operators, their properties have not been as explored for quantum channels. In this work we develop a theoretical framework to compute moment operators for ensembles of quantum channels, for all moment orders ttt, with a special focus on determining ensembles that can be used as points of reference. By deriving hierarchies between ensembles, via inequalities of their moment operator norms, we give them operational meaning, and define useful concepts such as that of channel ttt-designs. Finally, we perform theoretical and numerical studies which show that different types of noise can decrease the norm of the moment operators (e.g., depolarizing noise), as well as increase it (e.g., amplitude damping noise), and generalize noise-induced concentration phenomena to channel-design-induced phenomena. Along the way, we find a block-orthogonal basis for permutations, which greatly simplifies our analyses, and may be of independent interest in moment calculations.
Entanglement fidelity quantifies how well a quantum channel preserves the correlations between a transmitted system and an inaccessible reference system. We derive closed-form expressions for the entanglement fidelity associated with several standard quantum noise models, including the random Pauli-X, dephasing, depolarizing, Werner-Holevo, generalized Pauli (Weyl), and amplitude-damping channels. For each model, we express the entanglement fidelity in terms of a general input density operator ρρρ, using Schumacher's Kraus-operator approach, which provides a channel-agnostic recipe applicable to any completely positive trace-preserving (CPTP) map with a finite Kraus representation. We then specialize to a communication scenario in which the source emits a two-letter parametric alphabet, thereby making explicit the dependence of entanglement preservation on both channel and source parameters. The resulting expressions enable direct comparisons of channel performance and rankings for representative families of input states, including common qubit states.
The spectral gap of local random quantum circuits is a fundamental property that determines how close the moments of the circuit's unitaries match those of a Haar random distribution. When studying spectral gaps, it is common to bound these quantities using tools from statistical mechanics or via quantum information-based inequalities. By focusing on the second moment of one-dimensional unitary circuits where nearest-neighboring gates act on sets of qudits (with open and closed boundary conditions), we show that one can exactly compute the associated spectral gaps. Indeed, having access to their functional form allows us to prove several important results, such as the fact that the spectral gap for closed boundary condition is exactly the square of the gap for open boundaries, as well as improve on previously known bounds for approximate design convergence. Finally, we verify our theoretical results by numerically computing the spectral gap for systems of up to 70 qubits, as well as comparing them to gaps of random orthogonal and symplectic circuits.
This paper aims at presenting a few models of quantum dynamics whose description involves the analysis of random unitary matrices for which dynamical localization has been proven to hold. Some models come from physical approximations leading to effective descriptions of the dynamics of certain random systems that are popular in condensed matter theoretical physics, whereas others find their roots in more abstract considerations and generalizations. Although they may differ in details, the operators describing the models all have in common the following key features on which their analysis relies heavily: their dynamics is generated by unitary operators on an infinite dimensional underlying Hilbert space which have a band structure when expressed as matrices in a certain basis and the randomness of the models lies in phases of the matrix elements.
Unitary TTT-designs play an important role in quantum information, with diverse applications in quantum algorithms, benchmarking, tomography, and communication. Until now, the most efficient construction of unitary TTT-designs for nnn-qudit systems has been via random local quantum circuits, which have been shown to converge to approximate TTT-designs in the diamond norm using O(T5+o(1)n2)O(T^{5+o(1)} n^2)O(T5+o(1)n2) quantum gates. In this work, we provide a new construction of TTT-designs via random matrix theory using O~(T2n2)\tilde{O}(T^2 n^2)O~(T2n2) quantum gates. Our construction leverages two key ideas. First, in the spirit of central limit theorems, we approximate the Gaussian Unitary Ensemble (GUE) by an i.i.d. sum of random Hermitian matrices. Second, we show that the product of just two exponentiated GUE matrices is already approximately Haar random. Thus, multiplying two exponentiated sums over rather simple random matrices yields a unitary TTT-design, via Hamiltonian simulation. A central feature of our proof is a new connection between the polynomial method in quantum query complexity and the large-dimension (NNN) expansion in random matrix theory. In particular, we show that the polynomial method provides exponentially improved bounds on the high moments of certain random matrix ensembles, without requiring intricate Weingarten calculations. In doing so, we define and solve a new type of moment problem on the unit circle, asking whether a finite number of equally weighted points, corresponding to eigenvalues of unitary matrices, can reproduce a given set of moments.
Quantum information theory is an important element of quantum computing and quantum communication systems. Whenever a quantum computer needs to send an output state to another party, or two parties need to establish quantum entanglement or secure keys via quantum communication, a quantum channel is inevitably involved. Hence it is absolutely important to understand the properties of quantum channels for the purpose of communication. Here, quantum entanglement plays a huge role. Pre-shared entanglement could enhance the capacity, whereas entanglement across inputs could render the capacity formulae impossible to compute. The first part of this thesis seeks to address this issue, by studying the additivity properties in the communication of classical and quantum information, with or without entanglement assistance. I also study the reverse problem that, given a channel capacity, what can be said about the quantum channel itself. Quantum information theory also serves as an important tool in understanding other systems, for example, black holes. In this thesis, I model a closed random system by a unitary channel, and study how typical unitary channels process information. This provides huge insight into the strength of generalized entanglement measures, and the hierarchies in the complexity of information scrambling.
The quantum capacity captures the value of a quantum channel for transmitting quantum information, establishing the fundamental limits on quantum communication. In spite of its central role in quantum information theory, the quantum capacity of most channels is unknown, with wide gaps between the best upper and lower bounds. Even deciding whether a channel has nonzero capacity -- finding its capacity threshold -- is difficult. In this paper we report significant increases in the capacity thresholds of two prototypical noise models: the depolarizing channel and Pauli channels. In the case of the depolarizing channel, this is the first improvement in 18 years, giving a bigger increase beyond the hashing bound than all previous improvements combined. Our starting point is the representation theoretic framework recently proposed by Bhalerao and Leditzky (2025) to compute coherent information for special permutation invariant states. We generalize their framework to the full symmetric subspace, which allow us to optimize coherent information over rank two states in that space. A representation theoretic calculation shows that exponentially many Kraus operators of the channel annihilate the symmetric space, corresponding to a massive decrease in environment entropy for states on the symmetric space compared to the maximally mixed state. This explains the enhanced coherent information as a manifestation of degeneracy for the resulting codes.