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

Randomizing Channels in Quantum Information Theory

정갑균

Published Jan 1, 2012• 2 citations
OpenAlex

Abstract

The randomization of quantum states in Quantum Information Theory is an important issue and has many applications on information processing. Such a method for randomizing quantum states is given by a completely positive and trace-preserving map known as an epsilon-randomizing map or a random unitary channel.\nIn this thesis, we represent a general formula for the\nepsilon-randomizing maps with respect to the p-norm of\nd dimensional quantum states and introduce some applications. Recently, the epsilon-randomizing channel together with its complementary channel gives a key technique for the proof of the additivity conjecture, that is, the additivity violation for the classical\ncapacity of quantum channel, which is the motivation of our work.\n\nThere are plenty of applications of the epsilon-randomizing channels in the view of reducing communication resources as well as the approximate encryption and decryption of quantum states. We explicitly investigate several applications such as\napproximate quantum state sharing, approximate state merging, and quantum sequential transmission protocol.

Related papers

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

Properties of Conjugate Channels with Applications to Additivity and Multiplicativity

Christopher King, Keiji Matsumoto, Michael Nathanson +1 more

Quantum channels can be described via a unitary coupling of system and environment, followed by a trace over the environment state space. Taking the trace instead over the system state space produces a different mapping which we call the conjugate channel. We explore the properties of conjugate channels and describe several different methods of construction. In general, conjugate channels map M_d to M_d' with d < d', and different constructions may differ by conjugation with a partial isometry. We show that a channel and its conjugate have the same minimal output entropy and maximal output p-norm. It then follows that the additivity and multiplicativity conjectures for these measures of optimal output purity hold for a product of channels if and only if they also hold for the product of their conjugates. This allows us to reduce these conjectures to the special case of maps taking M_d to M_d' with a minimal representation of dimension at most d. We find explicit expressions for the conjugates for a number of well-known examples, including entanglement-breaking channels, unital qubit channels, the depolarizing channel, and a subclass of random unitary channels. For the entanglement-breaking channels, channels this yields a new class of channels for which additivity and multiplicativity of optimal output purity can be established. For random unitary channels using the generalized Pauli matrices, we obtain a new formulation of the multiplicativity conjecture. The conjugate of the completely noisy channel plays a special role and suggests a mechanism for using noise to transmit information.

arXiv:quant-ph/0509126•Markov Processes And Related Fields•Sep 19, 2005•142 citations

Symmetry and Randomness in Quantum Information Theory: Several Applications

Wei Dong Xie

This thesis studies four topics in quantum information theory using tools from representation theory and (high-dimensional) probability theory. \nFirst, we study the nonadditivity of minimum output von Neumann and Rényi entropy of quantum channels. A sketch of the proof by Aubrun, Szarek and Werner for nonadditivity of minimum output entropy is presented, and a slight simplification is given. We show that asymptotically the minimum output entropy of the random channel Ɛ ⊗ Ɛ ⊗ Ɛ* is achieved not by a tripartite genuinely entangled state, but by a tensor product of two states. We also study another model of random channel, and our estimation of the minimum output Rényi entropies fails to show the usefulness of genuine multipartite entanglement for the multiple nonadditivity. \nSecond, we study the generic entanglement in the random near-invariant tensors under the action of 𝔰𝔲(2), and random symmetric invariant tensors under the action of 𝔰𝔲(𝘥) for any 𝘥, serving as an extension of the random invariant tensors under 𝔰𝔲(2). We show that both the random tensors are asymptotically close to a maximally entangled state with respect to any bipartite cut. \nThird, we study efficient quantum certification for states and unitaries. We present an algorithm that uses 𝑂(ε⁻⁴ ln |𝒫|) copies of an unknown state to distinguish whether the unknown state is contained in or ε-far from a finite set 𝒫 of known states with respect to the trace distance. This algorithm is more sample-efficient in some settings. The previous study showed that one can distinguish whether an unknown unitary 𝑈 is equal to or ε-far from a known or unknown unitary 𝘝 in fixed dimension with 𝑂(ε⁻²) uses of the unitary, in which an ancilla system should be used. We give an algorithm that distinguishes the two cases with 𝑂(ε⁻¹) uses of the unitary, without using ancilla system or using ancilla system of much smaller dimension. \nFinally, we study the parallel repetition of extended nonlocal game motivated by its connection with multipartite steering and entanglement detection. We show that the probability of winning an 𝑛-fold parallel repetition of commuting nonsignaling extended nonlocal game 𝐺 decreases exponentially in 𝑛, provided that the game value of 𝐺 is strictly less than 1, following the approach used by Lancien and Winter based on de Finetti reduction.

•Jan 1, 2020•0 citations

Approximate degradable quantum channels

David Sutter, Volkher B. Scholz, Renato Renner

Degradable quantum channels are an important class of completely positive trace-preserving maps. Among other properties, they offer a single-letter formula for the quantum and the private classical capacity and are characterized by the fact that the complementary channel can be obtained from the channel by applying a degrading map. In this work we introduce the concept of approximate degradable channels, which satisfy this condition up to some finite ε ≥ 0. That is, there exists a degrading map which upon composition with the channel is ε-close in the diamond norm to the complementary channel. We show that for any fixed channel the smallest such ε can be efficiently determined via a semidefinite program. Moreover, these approximate degradable channels also approximately inherit all other properties of degradable channels. As an application, we derive improved upper bounds to the quantum and private classical capacity for certain channels of interest in quantum communication.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2015•15 citations

Additivity and distinguishability of random unitary channels

Bill Rosgen

A random unitary channel is one that is given by a convex combination of unitary channels. It is shown that the conjectures on the additivity of the minimum output entropy and the multiplicativity of the maximum output p-norm can be equivalently restated in terms of random unitary channels. This is done by constructing a random unitary approximation to a general quantum channel. This approximation can be constructed efficiently, and so it is also applied to the computational problem of distinguishing quantum circuits. It is shown that the problem of distinguishing random unitary circuits is as hard as the problem of distinguishing general mixed-state circuits, which is complete for the class of problems having quantum interactive proof systems.

arXiv:0804.1936•Journal of Mathematical Physics•Oct 1, 2008•23 citations

Approximate Degradable Quantum Channels

David Sutter, Volkher B. Scholz, Andreas Winter +1 more

Degradable quantum channels are an important class of completely positive trace-preserving maps. Among other properties, they offer a single-letter formula for the quantum and the private classical capacity and are characterized by the fact that a complementary channel can be obtained from the channel by applying a degrading channel. In this paper, we introduce the concept of approximate degradable channels, which satisfy this condition up to some finite ε ≥ 0. That is, there exists a degrading channel which upon composition with the channel is ε-close in the diamond norm to the complementary channel. We show that for any fixed channel the smallest such ε can be efficiently determined via a semidefinite program. Moreover, these approximate degradable channels also approximately inherit all other properties of degradable channels. As an application, we derive improved upper bounds to the quantum and private classical capacity for certain channels of interest in quantum communication.

arXiv:1412.0980•IEEE Transactions on Information Theory•Sep 19, 2017•72 citations
The randomization of quantum states in Quantum Information Theory is an important issue and has many applications on information processing. Such a method for randomizing quantum states is given by a completely positive and trace-preserving map known as an epsilon-randomizing map or a random unitary channel.\nIn this thesis, we represent a general formula for the\nepsilon-randomizing maps with respect to the p-norm of\nd dimensional quantum states and introduce some applications. Recently, the epsilon-randomizing channel together with its complementary channel gives a key technique for the proof of the additivity conjecture, that is, the additivity violation for the classical\ncapacity of quantum channel, which is the motivation of our work.\n\nThere are plenty of applications of the epsilon-randomizing channels in the view of reducing communication resources as well as the approximate encryption and decryption of quantum states. We explicitly investigate several applications such as\napproximate quantum state sharing, approximate state merging, and quantum sequential transmission protocol.
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.
Quantum channels can be described via a unitary coupling of system and environment, followed by a trace over the environment state space. Taking the trace instead over the system state space produces a different mapping which we call the conjugate channel. We explore the properties of conjugate channels and describe several different methods of construction. In general, conjugate channels map M_d to M_d' with d < d', and different constructions may differ by conjugation with a partial isometry. We show that a channel and its conjugate have the same minimal output entropy and maximal output p-norm. It then follows that the additivity and multiplicativity conjectures for these measures of optimal output purity hold for a product of channels if and only if they also hold for the product of their conjugates. This allows us to reduce these conjectures to the special case of maps taking M_d to M_d' with a minimal representation of dimension at most d. We find explicit expressions for the conjugates for a number of well-known examples, including entanglement-breaking channels, unital qubit channels, the depolarizing channel, and a subclass of random unitary channels. For the entanglement-breaking channels, channels this yields a new class of channels for which additivity and multiplicativity of optimal output purity can be established. For random unitary channels using the generalized Pauli matrices, we obtain a new formulation of the multiplicativity conjecture. The conjugate of the completely noisy channel plays a special role and suggests a mechanism for using noise to transmit information.
This thesis studies four topics in quantum information theory using tools from representation theory and (high-dimensional) probability theory. \nFirst, we study the nonadditivity of minimum output von Neumann and Rényi entropy of quantum channels. A sketch of the proof by Aubrun, Szarek and Werner for nonadditivity of minimum output entropy is presented, and a slight simplification is given. We show that asymptotically the minimum output entropy of the random channel Ɛ ⊗ Ɛ ⊗ Ɛ* is achieved not by a tripartite genuinely entangled state, but by a tensor product of two states. We also study another model of random channel, and our estimation of the minimum output Rényi entropies fails to show the usefulness of genuine multipartite entanglement for the multiple nonadditivity. \nSecond, we study the generic entanglement in the random near-invariant tensors under the action of 𝔰𝔲(2), and random symmetric invariant tensors under the action of 𝔰𝔲(𝘥) for any 𝘥, serving as an extension of the random invariant tensors under 𝔰𝔲(2). We show that both the random tensors are asymptotically close to a maximally entangled state with respect to any bipartite cut. \nThird, we study efficient quantum certification for states and unitaries. We present an algorithm that uses 𝑂(ε⁻⁴ ln |𝒫|) copies of an unknown state to distinguish whether the unknown state is contained in or ε-far from a finite set 𝒫 of known states with respect to the trace distance. This algorithm is more sample-efficient in some settings. The previous study showed that one can distinguish whether an unknown unitary 𝑈 is equal to or ε-far from a known or unknown unitary 𝘝 in fixed dimension with 𝑂(ε⁻²) uses of the unitary, in which an ancilla system should be used. We give an algorithm that distinguishes the two cases with 𝑂(ε⁻¹) uses of the unitary, without using ancilla system or using ancilla system of much smaller dimension. \nFinally, we study the parallel repetition of extended nonlocal game motivated by its connection with multipartite steering and entanglement detection. We show that the probability of winning an 𝑛-fold parallel repetition of commuting nonsignaling extended nonlocal game 𝐺 decreases exponentially in 𝑛, provided that the game value of 𝐺 is strictly less than 1, following the approach used by Lancien and Winter based on de Finetti reduction.
Degradable quantum channels are an important class of completely positive trace-preserving maps. Among other properties, they offer a single-letter formula for the quantum and the private classical capacity and are characterized by the fact that the complementary channel can be obtained from the channel by applying a degrading map. In this work we introduce the concept of approximate degradable channels, which satisfy this condition up to some finite ε ≥ 0. That is, there exists a degrading map which upon composition with the channel is ε-close in the diamond norm to the complementary channel. We show that for any fixed channel the smallest such ε can be efficiently determined via a semidefinite program. Moreover, these approximate degradable channels also approximately inherit all other properties of degradable channels. As an application, we derive improved upper bounds to the quantum and private classical capacity for certain channels of interest in quantum communication.
A random unitary channel is one that is given by a convex combination of unitary channels. It is shown that the conjectures on the additivity of the minimum output entropy and the multiplicativity of the maximum output p-norm can be equivalently restated in terms of random unitary channels. This is done by constructing a random unitary approximation to a general quantum channel. This approximation can be constructed efficiently, and so it is also applied to the computational problem of distinguishing quantum circuits. It is shown that the problem of distinguishing random unitary circuits is as hard as the problem of distinguishing general mixed-state circuits, which is complete for the class of problems having quantum interactive proof systems.
Degradable quantum channels are an important class of completely positive trace-preserving maps. Among other properties, they offer a single-letter formula for the quantum and the private classical capacity and are characterized by the fact that a complementary channel can be obtained from the channel by applying a degrading channel. In this paper, we introduce the concept of approximate degradable channels, which satisfy this condition up to some finite ε ≥ 0. That is, there exists a degrading channel which upon composition with the channel is ε-close in the diamond norm to the complementary channel. We show that for any fixed channel the smallest such ε can be efficiently determined via a semidefinite program. Moreover, these approximate degradable channels also approximately inherit all other properties of degradable channels. As an application, we derive improved upper bounds to the quantum and private classical capacity for certain channels of interest in quantum communication.