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:2210.03723

Randomized channel-state duality

Bin Yan, Nikolai A. Sinitsyn

Published Oct 7, 2022• 1 citation
arXivHTMLPDF

Abstract

Channel-state duality is a central result in quantum information science. It refers to the correspondence between a dynamical process (quantum channel) and a static quantum state in an enlarged Hilbert space. Since the corresponding dual state is generally mixed, it is described by a Hermitian matrix. In this article, we present a randomized channel-state duality. In other words, a quantum channel is represented by a collection of $N$ pure quantum states that are produced from a random source. The accuracy of this randomized duality relation is given by $1/N$, with regard to an appropriate distance measure. For large systems, $N$ is much smaller than the dimension of the exact dual matrix of the quantum channel. This provides a highly accurate low-rank approximation of any quantum channel, and, as a consequence of the duality relation, an efficient data compression scheme for mixed quantum states. We demonstrate these two immediate applications of the randomized channel-state duality with a chaotic $1$-dimensional spin system.

DOI
10.48550/arxiv.2210.03723

Related papers

Entanglement, randomness and chaos

Giuliano Benenti

Entanglement is not only the most intriguing feature of quantum mechanics, but also a key resource in quantum information science. The entanglement content of random pure quantum states is almost maximal; such states find applications in various quantum information protocols. The preparation of a random state or, equivalently, the implementation of a random unitary operator, requires a number of elementary one- and two-qubit gates that is exponential in the number n_q of qubits, thus becoming rapidly unfeasible when increasing n_q. On the other hand, pseudo-random states approximating to the desired accuracy the entanglement properties of true random states may be generated efficiently, that is, polynomially in n_q. In particular, quantum chaotic maps are efficient generators of multipartite entanglement among the qubits, close to that expected for random states. This review discusses several aspects of the relationship between entanglement, randomness and chaos. In particular, I will focus on the following items: (i) the robustness of the entanglement generated by quantum chaotic maps when taking into account the unavoidable noise sources affecting a quantum computer; (ii) the detection of the entanglement of high-dimensional (mixtures of) random states, an issue also related to the question of the emergence of classicality in coarse grained quantum chaotic dynamics; (iii) the decoherence induced by the coupling of a system to a chaotic environment, that is, by the entanglement established between the system and the environment.

arXiv:0807.4364•Jul 28, 2008•7 citations

Entropy-based random quantum states

Harry J. D. Miller

In quantum information geometry, the curvature of von-Neumann entropy and relative entropy induce a natural metric on the space of mixed quantum states. Here we use this information metric to construct a random matrix ensemble for states and investigate its key statistical properties such as the asymptotic eigenvalue density and mean entropy. We present an algorithm for generating these entropy-based random density matrices, thus providing a new recipe for random state generation that differs from the well established Hilbert-Schmidt and Bures-Hall ensemble approaches. We also prove a duality between the entropy-based state ensemble and a random Hamiltonian model constructed from the thermodynamic length over the set of Gibbs states. This Hamiltonian model is found to display Wigner level repulsion, implying that the dual state ensemble can be realised as a random Gibbs state with respect to a class of chaotic Hamiltonians. As an application we use our model to compute the survival probability of a randomly evolved thermofield double state, predicting a ramp and plateau over time that is characteristic of quantum chaos. For other applications, the entropy-based ensemble can be used as an uninformative prior for Bayesian quantum state or Hamiltonian tomography.

quant-pharXiv:2511.01988•Nov 5, 2025•6 citations

Channel kets, entangled states, and the location of quantum information

Robert B. Griffiths

The well-known duality relating entangled states and noisy quantum channels is expressed in terms of a channel ket, a pure state on a suitable tripartite system, which functions as a pre-probability allowing the calculation of statistical correlations between, for example, the entrance and exit of a channel, once a framework has been chosen so as to allow a consistent set of probabilities. In each framework the standard notions of ordinary (classical) information theory apply, and it makes sense to ask whether information of a particular sort about one system is or is not present in another system. Quantum effects arise when a single pre-probability is used to compute statistical correlations in different incompatible frameworks, and various constraints on the presence and absence of different kinds of information are expressed in a set of all-or-nothing theorems which generalize or give a precise meaning to the concept of ``no-cloning.'' These theorems are used to discuss the location of information in quantum channels modeled using a mixed-state environment, the classical-quantum channels introduced by Holevo, and the location of information in the physical carriers of a quantum code. It is proposed that both channel and entanglement problems be classified in terms of pure states (functioning as pre-probabilities) on systems of $p\ensuremath{\geqslant}2$ parts, with mixed bipartite entanglement and simple noisy channels belonging to the category $p=3$, a five-qubit code to the category $p=6$, etc., then by the dimensions of the Hilbert spaces of the component parts, along with other criteria yet to be determined.

arXiv:quant-ph/0409106•Physical Review A•Apr 28, 2005•24 citations

Weak Decoupling Duality and Quantum Identification

Patrick M. Hayden, Andreas Winter

If a quantum system is subject to noise, it is possible to perform quantum error correction reversing the action of the noise if and only if no information about the system's quantum state leaks to the environment. In this paper, we develop an analogous duality in the case that the environment approximately forgets the identity of the quantum state, a weaker condition satisfied by -randomizing maps and approximate unitary designs. Specifically, we show that the environment approximately forgets quantum states if and only if the original channel approximately preserves pairwise fidelities of pure inputs, an observation we call weak decoupling duality. Using this tool, we then go on to study the task of using the output of a channel to simulate restricted classes of measurements on a space of input states. The case of simulating measurements that test whether the input state is an arbitrary pure state is known as equality testing or quantum identification. An immediate consequence of weak decoupling duality is that the ability to perform quantum identification cannot be cloned. We, furthermore, establish that the optimal amortized rate at which quantum states can be identified through a noisy quantum channel is equal to the entanglement-assisted classical capacity of the channel, despite the fact that the task is quantum, not classical, and entanglement-assistance is not allowed. In particular, this rate is strictly positive for every nonconstant quantum channel, including classical channels.

arXiv:1003.4994•IEEE Transactions on Information Theory•Mar 23, 2012•41 citations

Exact and Local Compression of Quantum Bipartite States

Kohtaro Kato

We study an exact local compression of a quantum bipartite state; that is, applying local quantum operations to the state to reduce the dimensions of Hilbert spaces while perfectly maintaining the correlation. We provide a closed formula for calculating the minimal achievable dimensions, provided as a minimization of the Schmidt rank of a particular pure state constructed from the given state. Numerically more tractable upper and lower bounds of the rank are also obtained. Subsequently, we consider the exact compression of quantum channels as an application. Using this method, a post-processing step that can reduce the output dimensions while retaining information on the output of the original channel can be analyzed.

arXiv:2309.07434•IEEE Transactions on Information Theory•Apr 21, 2025•4 citations

Duality Between Source Coding With Quantum Side Information and Classical-Quantum Channel Coding

Hao–Chung Cheng, Eric P. Hanson, Nilanjana Datta +1 more

In this paper, we establish an interesting duality between two different quantum information-processing tasks, namely, classical source coding with quantum side information, and channel coding over classical-quantum channels. The duality relates the optimal error exponents of these two tasks, generalizing the classical results of Ahlswede and Dueck [IEEE Trans. Inf. Theory, 28(3):430–443, 1982]. We establish duality both at the operational level and at the level of the entropic quantities characterizing these exponents. For the latter, the duality is given by an exact relation, whereas for the former, duality manifests itself in the following sense: an optimal coding strategy for one task can be used to construct an optimal coding strategy for the other task. Along the way, we derive a bound on the error exponent for classical-quantum channel coding with constant composition codes which might be of independent interest. Finally, we consider the task of variable-length classical compression with quantum side information, and a duality relation between this task and classical-quantum channel coding can also be established correspondingly. Furthermore, we study the strong converse of this task, and show that the strong converse property does not hold even in the i.i.d. scenario.

IEEE Transactions on Information Theory•Jun 13, 2022•10 citations
Channel-state duality is a central result in quantum information science. It refers to the correspondence between a dynamical process (quantum channel) and a static quantum state in an enlarged Hilbert space. Since the corresponding dual state is generally mixed, it is described by a Hermitian matrix. In this article, we present a randomized channel-state duality. In other words, a quantum channel is represented by a collection of NNN pure quantum states that are produced from a random source. The accuracy of this randomized duality relation is given by 1/N1/N1/N, with regard to an appropriate distance measure. For large systems, NNN is much smaller than the dimension of the exact dual matrix of the quantum channel. This provides a highly accurate low-rank approximation of any quantum channel, and, as a consequence of the duality relation, an efficient data compression scheme for mixed quantum states. We demonstrate these two immediate applications of the randomized channel-state duality with a chaotic 111-dimensional spin system.
Entanglement is not only the most intriguing feature of quantum mechanics, but also a key resource in quantum information science. The entanglement content of random pure quantum states is almost maximal; such states find applications in various quantum information protocols. The preparation of a random state or, equivalently, the implementation of a random unitary operator, requires a number of elementary one- and two-qubit gates that is exponential in the number n_q of qubits, thus becoming rapidly unfeasible when increasing n_q. On the other hand, pseudo-random states approximating to the desired accuracy the entanglement properties of true random states may be generated efficiently, that is, polynomially in n_q. In particular, quantum chaotic maps are efficient generators of multipartite entanglement among the qubits, close to that expected for random states. This review discusses several aspects of the relationship between entanglement, randomness and chaos. In particular, I will focus on the following items: (i) the robustness of the entanglement generated by quantum chaotic maps when taking into account the unavoidable noise sources affecting a quantum computer; (ii) the detection of the entanglement of high-dimensional (mixtures of) random states, an issue also related to the question of the emergence of classicality in coarse grained quantum chaotic dynamics; (iii) the decoherence induced by the coupling of a system to a chaotic environment, that is, by the entanglement established between the system and the environment.
In quantum information geometry, the curvature of von-Neumann entropy and relative entropy induce a natural metric on the space of mixed quantum states. Here we use this information metric to construct a random matrix ensemble for states and investigate its key statistical properties such as the asymptotic eigenvalue density and mean entropy. We present an algorithm for generating these entropy-based random density matrices, thus providing a new recipe for random state generation that differs from the well established Hilbert-Schmidt and Bures-Hall ensemble approaches. We also prove a duality between the entropy-based state ensemble and a random Hamiltonian model constructed from the thermodynamic length over the set of Gibbs states. This Hamiltonian model is found to display Wigner level repulsion, implying that the dual state ensemble can be realised as a random Gibbs state with respect to a class of chaotic Hamiltonians. As an application we use our model to compute the survival probability of a randomly evolved thermofield double state, predicting a ramp and plateau over time that is characteristic of quantum chaos. For other applications, the entropy-based ensemble can be used as an uninformative prior for Bayesian quantum state or Hamiltonian tomography.
The well-known duality relating entangled states and noisy quantum channels is expressed in terms of a channel ket, a pure state on a suitable tripartite system, which functions as a pre-probability allowing the calculation of statistical correlations between, for example, the entrance and exit of a channel, once a framework has been chosen so as to allow a consistent set of probabilities. In each framework the standard notions of ordinary (classical) information theory apply, and it makes sense to ask whether information of a particular sort about one system is or is not present in another system. Quantum effects arise when a single pre-probability is used to compute statistical correlations in different incompatible frameworks, and various constraints on the presence and absence of different kinds of information are expressed in a set of all-or-nothing theorems which generalize or give a precise meaning to the concept of ``no-cloning.'' These theorems are used to discuss the location of information in quantum channels modeled using a mixed-state environment, the classical-quantum channels introduced by Holevo, and the location of information in the physical carriers of a quantum code. It is proposed that both channel and entanglement problems be classified in terms of pure states (functioning as pre-probabilities) on systems of $p\ensuremath{\geqslant}2$ parts, with mixed bipartite entanglement and simple noisy channels belonging to the category p=3p=3p=3, a five-qubit code to the category p=6p=6p=6, etc., then by the dimensions of the Hilbert spaces of the component parts, along with other criteria yet to be determined.
If a quantum system is subject to noise, it is possible to perform quantum error correction reversing the action of the noise if and only if no information about the system's quantum state leaks to the environment. In this paper, we develop an analogous duality in the case that the environment approximately forgets the identity of the quantum state, a weaker condition satisfied by -randomizing maps and approximate unitary designs. Specifically, we show that the environment approximately forgets quantum states if and only if the original channel approximately preserves pairwise fidelities of pure inputs, an observation we call weak decoupling duality. Using this tool, we then go on to study the task of using the output of a channel to simulate restricted classes of measurements on a space of input states. The case of simulating measurements that test whether the input state is an arbitrary pure state is known as equality testing or quantum identification. An immediate consequence of weak decoupling duality is that the ability to perform quantum identification cannot be cloned. We, furthermore, establish that the optimal amortized rate at which quantum states can be identified through a noisy quantum channel is equal to the entanglement-assisted classical capacity of the channel, despite the fact that the task is quantum, not classical, and entanglement-assistance is not allowed. In particular, this rate is strictly positive for every nonconstant quantum channel, including classical channels.
We study an exact local compression of a quantum bipartite state; that is, applying local quantum operations to the state to reduce the dimensions of Hilbert spaces while perfectly maintaining the correlation. We provide a closed formula for calculating the minimal achievable dimensions, provided as a minimization of the Schmidt rank of a particular pure state constructed from the given state. Numerically more tractable upper and lower bounds of the rank are also obtained. Subsequently, we consider the exact compression of quantum channels as an application. Using this method, a post-processing step that can reduce the output dimensions while retaining information on the output of the original channel can be analyzed.
In this paper, we establish an interesting duality between two different quantum information-processing tasks, namely, classical source coding with quantum side information, and channel coding over classical-quantum channels. The duality relates the optimal error exponents of these two tasks, generalizing the classical results of Ahlswede and Dueck [IEEE Trans. Inf. Theory, 28(3):430–443, 1982]. We establish duality both at the operational level and at the level of the entropic quantities characterizing these exponents. For the latter, the duality is given by an exact relation, whereas for the former, duality manifests itself in the following sense: an optimal coding strategy for one task can be used to construct an optimal coding strategy for the other task. Along the way, we derive a bound on the error exponent for classical-quantum channel coding with constant composition codes which might be of independent interest. Finally, we consider the task of variable-length classical compression with quantum side information, and a duality relation between this task and classical-quantum channel coding can also be established correspondingly. Furthermore, we study the strong converse of this task, and show that the strong converse property does not hold even in the i.i.d. scenario.