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:2002.04240 · IEEE Transactions on Information Theory

A General Theory of Comparison of Quantum Channels (and Beyond)

Anna Jenčová

Published Mar 31, 2021• 10 citations
arXivHTMLPDF

Abstract

We present a general theory of comparison of quantum channels, concerning with the question of simulability or approximate simulability of a given quantum channel by allowed transformations of another given channel. We introduce a modification of conditional min-entropies, with respect to the set F of allowed transformations, and show that under some conditions on F, these quantities characterize approximate simulability. If F is the set of free superchannels in a quantum resource theory of processes, the modified conditional min-entropies form a complete set of resource monotones. If the transformations in F consist of a preprocessing and a postprocessing of specified forms, approximate simulability is also characterized in terms of success probabilities in certain guessing games, where a preprocessing of a given form can be chosen and the measurements are restricted. These results are applied to several specific cases of simulability of quantum channels, including postprocessings, preprocessings and processing of bipartite channels by LOCC superchannels and by partial superchannels, as well as simulability of sets of quantum measurements. These questions are first studied in a general setting that is an extension of the framework of general probabilistic theories (GPT), suitable for dealing with channels. Here we prove a general theorem that shows that approximate simulability can be characterized by comparing outcome probabilities in certain tests. This result is inspired by the classical Le Cam randomization criterion for statistical experiments and contains its finite dimensional version as a special case.

DOI
10.1109/tit.2021.3070120

Related papers

Comparison of Quantum Channels by Superchannels

Gilad Gour

We extend the definition of the conditional min-entropy from bipartite quantum states to bipartite quantum channels. We show that many of the properties of the conditional min-entropy carry over to the extended version, including an operational interpretation as a guessing probability when one of the subsystems is classical. We then show that the extended conditional min-entropy can be used to fully characterize when two bipartite quantum channels are related to each other via a superchannel (also known as supermap or a comb) that is acting on one of the subsystems. This relation is a pre-order that extends the definition of “quantum majorization” from bipartite states to bipartite channels, and can also be characterized with semidefinite programming. As a special case, our characterization provides necessary and sufficient conditions for when a set of quantum channels is related to another set of channels via a single superchannel. We discuss the applications of our results to channel discrimination, and to resource theories of quantum processes. Along the way we study channel divergences, entropy functions of quantum channels, and noise models of superchannels, including random unitary superchannels and doubly-stochastic superchannels. For the latter we give a physical meaning as being completely-uniformity preserving.

arXiv:1808.02607•IEEE Transactions on Information Theory•Apr 1, 2019•125 citations

Comparison of quantum channels and statistical experiments

Anna Jenčová

For a pair of quantum channels with the same input space, we show that the possibility of approximation of one channel by post-processings of the other channel can be characterized by comparing the success probabilities for the two ensembles obtained as outputs for any ensemble on the input space coupled with an ancilla. This provides an operational interpretation to a natural extension of Le Cam's deficiency to quantum channels. In particular, we obtain a version of the randomization criterion for quantum statistical experiments. The proofs are based on some properties of the diamond norm and its dual, which are of independent interest.

arXiv:1512.07016•IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2016•12 citations

Entropic and Operational Characterizations of Dynamic Quantum Resources

Kaiyuan Ji, Eric Chitambar

Dynamic quantum resource theories study the manipulation of quantum channels by means of a restricted set of free superoperations. In this paper, we formulate general dynamic resource theories using a "top-down" framework, and we provide systematic characterizations for closed and convex resource theories from both information-theoretic and operational perspectives. Our results are summarized as follows. First, we propose and investigate a branch of resource-induced measures of uncertainty, called the free conditional min-entropy (FCME), generalizing the conditional min-entropy and its dynamic extension to scenarios where information processing is subject to variable operational restriction. We provide a complete set of entropic conditions in terms of the FCME for characterizing channel convertibility via free superoperations in any closed and convex resource theory. We also find that the resource global robustness of channels can be equivalently cast as a mutual-information-like quantity derived from the FCME, thereby offering the resource global robustness an information-theoretic interpretation. Apart from the entropic approach, we also study closed and convex resource theories in the contexts of various operational tasks. These tasks are formulated such that each of them induces a complete set of operationally meaningful resource monotones, and therefore they can be used to faithfully test free convertibility between channels. We also systematically study the quantitative relations between the operational advantage of channels in these tasks and the resource robustness measures of channels. In particular, we prove that every well-defined robustness-based measure can be operationally interpreted as some kind of advantage in a task called semiquantum partial preprocessing. Ultimately, our results provide both entropic and operational characterizations for general dynamic quantum resources with a closed and convex structure.

IEEE International Symposium on Information Theory (ISIT)•Jun 25, 2023•0 citations

The Structure of Higher-Order Quantum Resources with an Application to Coherence

Felix Ahnefeld, Thomas Theurer, Martin B. Plenio

We develop a general framework for higher-order quantum resources that treats the resourcefulness of quantum states, channels, and supermaps (also called processes) in a unified manner. By generalizing well-established concepts from resource theories of states and channels, we introduce and study supermap resource monotones and supermap distillation and dilution. As free supermaps, we consider free networks (supermaps that can be implemented with free channels), compatible supermaps (sets of supermaps closed under arbitrary composition), and maximally free superchannels. Specializing to approximate channel-to-channel conversions, we show that under mild assumptions, the conversion error with respect to the diamond distance and the worst-case infidelity coincide. We then apply the general framework to resource theories of dynamical coherence, where we establish the existence of largest sets of compatible supermaps. By characterizing these sets with semidefinite constraints, we show that they are strictly larger than the corresponding free networks but do not contain all maximally free superchannels. We finish by investigating the operational differences of these sets in one-shot channel distillation and dilution, providing solutions for both tasks in the parallel setting and for dilution in the adaptive setting.

quant-pharXiv:2609.40186•Oct 1, 2026•0 citations

Entropic and Operational Characterizations of Dynamic Quantum Resources

Kaiyuan Ji, Eric Chitambar

We offer new methods for characterizing general closed and convex quantum resource theories, including dynamic ones, based on entropic concepts and operational tasks. We propose a resource-theoretic generalization of the quantum conditional min-entropy, termed the free conditional min-entropy (FCME), in the sense that it quantifies an observer’s “subjective” degree of uncertainty about a quantum system given that the observer’s information processing is limited to free operations of the resource theory. Using this generalized concept, we provide a complete set of entropic conditions for free convertibility between quantum states or channels in any closed and convex quantum resource theory. We also derive an information-theoretic interpretation for the resource global robustness of a state or a channel in terms of a mutual-information-like quantity based on the FCME. Apart from this entropic approach, we characterize dynamic resources by also analyzing their performance in operational tasks. We construct operationally meaningful and complete sets of resource monotones with these tasks, which enable faithful tests of free convertibility between quantum channels. Finally, we show that every well-defined robustness-based measure of a channel can be interpreted as an operational advantage of the channel over free channels in a communication task.

arXiv:2112.06906•IEEE Transactions on Information Theory•Apr 10, 2025•3 citations

Unextendible Entanglement of Quantum Channels

Vishal Singh, Mark M. Wilde

Quantum communication relies on the existence of high quality quantum channels to exchange information. In practice, however, all communication links are affected by noise from the environment. Here we investigate the ability of quantum channels to perform quantum communication tasks by restricting the participants to use only local operations and one-way classical communication (one-way LOCC) along with the available quantum channel. In particular, a channel can be used to distill a highly entangled state between two parties, which further enables quantum or private communication. In this work, we invoke the framework of superchannels to study the distillation of a resourceful quantum state, such as a maximally entangled state or a private state, using multiple instances of a point-to-point quantum channel. We use the idea ofk-extendibility to obtain a semidefinite relaxation of the set of one-way LOCC superchannels and define a class of entanglement measures for quantum channels that decrease monotonically under such superchannels; therefore these measures, dubbed collectively the “unextendible entanglement of a channel”, yield upper bounds on several communication-theoretic quantities of interest in the regimes of resource distillation and zero error.We then generalize the formalism ofk-extendibility to bipartite superchannels, thus obtaining functions that are monotone under two-extendible superchannels. This allows us to analyze probabilistic distillation of ebits or secret key bits from a bipartite state when using a resourceful quantum channel. Moreover, we propose semidefinite programs to evaluate several of these quantities, providing a computationally feasible method of comparison between quantum channels for resource distillation.

arXiv:2407.15944•IEEE Transactions on Information Theory•May 7, 2025•1 citation
We present a general theory of comparison of quantum channels, concerning with the question of simulability or approximate simulability of a given quantum channel by allowed transformations of another given channel. We introduce a modification of conditional min-entropies, with respect to the set F of allowed transformations, and show that under some conditions on F, these quantities characterize approximate simulability. If F is the set of free superchannels in a quantum resource theory of processes, the modified conditional min-entropies form a complete set of resource monotones. If the transformations in F consist of a preprocessing and a postprocessing of specified forms, approximate simulability is also characterized in terms of success probabilities in certain guessing games, where a preprocessing of a given form can be chosen and the measurements are restricted. These results are applied to several specific cases of simulability of quantum channels, including postprocessings, preprocessings and processing of bipartite channels by LOCC superchannels and by partial superchannels, as well as simulability of sets of quantum measurements. These questions are first studied in a general setting that is an extension of the framework of general probabilistic theories (GPT), suitable for dealing with channels. Here we prove a general theorem that shows that approximate simulability can be characterized by comparing outcome probabilities in certain tests. This result is inspired by the classical Le Cam randomization criterion for statistical experiments and contains its finite dimensional version as a special case.
We extend the definition of the conditional min-entropy from bipartite quantum states to bipartite quantum channels. We show that many of the properties of the conditional min-entropy carry over to the extended version, including an operational interpretation as a guessing probability when one of the subsystems is classical. We then show that the extended conditional min-entropy can be used to fully characterize when two bipartite quantum channels are related to each other via a superchannel (also known as supermap or a comb) that is acting on one of the subsystems. This relation is a pre-order that extends the definition of “quantum majorization” from bipartite states to bipartite channels, and can also be characterized with semidefinite programming. As a special case, our characterization provides necessary and sufficient conditions for when a set of quantum channels is related to another set of channels via a single superchannel. We discuss the applications of our results to channel discrimination, and to resource theories of quantum processes. Along the way we study channel divergences, entropy functions of quantum channels, and noise models of superchannels, including random unitary superchannels and doubly-stochastic superchannels. For the latter we give a physical meaning as being completely-uniformity preserving.
For a pair of quantum channels with the same input space, we show that the possibility of approximation of one channel by post-processings of the other channel can be characterized by comparing the success probabilities for the two ensembles obtained as outputs for any ensemble on the input space coupled with an ancilla. This provides an operational interpretation to a natural extension of Le Cam's deficiency to quantum channels. In particular, we obtain a version of the randomization criterion for quantum statistical experiments. The proofs are based on some properties of the diamond norm and its dual, which are of independent interest.
Dynamic quantum resource theories study the manipulation of quantum channels by means of a restricted set of free superoperations. In this paper, we formulate general dynamic resource theories using a "top-down" framework, and we provide systematic characterizations for closed and convex resource theories from both information-theoretic and operational perspectives. Our results are summarized as follows. First, we propose and investigate a branch of resource-induced measures of uncertainty, called the free conditional min-entropy (FCME), generalizing the conditional min-entropy and its dynamic extension to scenarios where information processing is subject to variable operational restriction. We provide a complete set of entropic conditions in terms of the FCME for characterizing channel convertibility via free superoperations in any closed and convex resource theory. We also find that the resource global robustness of channels can be equivalently cast as a mutual-information-like quantity derived from the FCME, thereby offering the resource global robustness an information-theoretic interpretation. Apart from the entropic approach, we also study closed and convex resource theories in the contexts of various operational tasks. These tasks are formulated such that each of them induces a complete set of operationally meaningful resource monotones, and therefore they can be used to faithfully test free convertibility between channels. We also systematically study the quantitative relations between the operational advantage of channels in these tasks and the resource robustness measures of channels. In particular, we prove that every well-defined robustness-based measure can be operationally interpreted as some kind of advantage in a task called semiquantum partial preprocessing. Ultimately, our results provide both entropic and operational characterizations for general dynamic quantum resources with a closed and convex structure.
We develop a general framework for higher-order quantum resources that treats the resourcefulness of quantum states, channels, and supermaps (also called processes) in a unified manner. By generalizing well-established concepts from resource theories of states and channels, we introduce and study supermap resource monotones and supermap distillation and dilution. As free supermaps, we consider free networks (supermaps that can be implemented with free channels), compatible supermaps (sets of supermaps closed under arbitrary composition), and maximally free superchannels. Specializing to approximate channel-to-channel conversions, we show that under mild assumptions, the conversion error with respect to the diamond distance and the worst-case infidelity coincide. We then apply the general framework to resource theories of dynamical coherence, where we establish the existence of largest sets of compatible supermaps. By characterizing these sets with semidefinite constraints, we show that they are strictly larger than the corresponding free networks but do not contain all maximally free superchannels. We finish by investigating the operational differences of these sets in one-shot channel distillation and dilution, providing solutions for both tasks in the parallel setting and for dilution in the adaptive setting.
We offer new methods for characterizing general closed and convex quantum resource theories, including dynamic ones, based on entropic concepts and operational tasks. We propose a resource-theoretic generalization of the quantum conditional min-entropy, termed the free conditional min-entropy (FCME), in the sense that it quantifies an observer’s “subjective” degree of uncertainty about a quantum system given that the observer’s information processing is limited to free operations of the resource theory. Using this generalized concept, we provide a complete set of entropic conditions for free convertibility between quantum states or channels in any closed and convex quantum resource theory. We also derive an information-theoretic interpretation for the resource global robustness of a state or a channel in terms of a mutual-information-like quantity based on the FCME. Apart from this entropic approach, we characterize dynamic resources by also analyzing their performance in operational tasks. We construct operationally meaningful and complete sets of resource monotones with these tasks, which enable faithful tests of free convertibility between quantum channels. Finally, we show that every well-defined robustness-based measure of a channel can be interpreted as an operational advantage of the channel over free channels in a communication task.
Quantum communication relies on the existence of high quality quantum channels to exchange information. In practice, however, all communication links are affected by noise from the environment. Here we investigate the ability of quantum channels to perform quantum communication tasks by restricting the participants to use only local operations and one-way classical communication (one-way LOCC) along with the available quantum channel. In particular, a channel can be used to distill a highly entangled state between two parties, which further enables quantum or private communication. In this work, we invoke the framework of superchannels to study the distillation of a resourceful quantum state, such as a maximally entangled state or a private state, using multiple instances of a point-to-point quantum channel. We use the idea ofk-extendibility to obtain a semidefinite relaxation of the set of one-way LOCC superchannels and define a class of entanglement measures for quantum channels that decrease monotonically under such superchannels; therefore these measures, dubbed collectively the “unextendible entanglement of a channel”, yield upper bounds on several communication-theoretic quantities of interest in the regimes of resource distillation and zero error.We then generalize the formalism ofk-extendibility to bipartite superchannels, thus obtaining functions that are monotone under two-extendible superchannels. This allows us to analyze probabilistic distillation of ebits or secret key bits from a bipartite state when using a resourceful quantum channel. Moreover, we propose semidefinite programs to evaluate several of these quantities, providing a computationally feasible method of comparison between quantum channels for resource distillation.