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:1801.05441 · Quantum Measurements and Quantum Metrology

Adaptive estimation and discrimination of Holevo-Werner channels

Thomas Cope, Stefano Pirandola

Published Dec 20, 2017• 13 citations
arXivHTMLPDF

Abstract

Abstract The class of quantum states known as Werner states have several interesting properties, which often serve to illuminate unusual properties of quantum information. Closely related to these states are the Holevo- Werner channels whose Choi matrices are Werner states. Exploiting the fact that these channels are teleportation covariant, and therefore simulable by teleportation, we compute the ultimate precision in the adaptive estimation of their channel-defining parameter. Similarly, we bound the minimum error probability affecting the adaptive discrimination of any two of these channels. In this case, we prove an analytical formula for the quantum Chernoff bound which also has a direct counterpart for the class of depolarizing channels. Our work exploits previous methods established in [Pirandola and Lupo, PRL

DOI
10.1515/qmetro-2017-0006

Related papers

Fundamental limits to quantum channel discrimination

Stefano Pirandola, Riccardo Laurenza, Cosmo Lupo +1 more

Abstract What is the ultimate performance for discriminating two arbitrary quantum channels acting on a finite-dimensional Hilbert space? Here we address this basic question by deriving a general and fundamental lower bound. More precisely, we investigate the symmetric discrimination of two arbitrary qudit channels by means of the most general protocols based on adaptive (feedback-assisted) quantum operations. In this general scenario, we first show how port-based teleportation can be used to simplify these adaptive protocols into a much simpler non-adaptive form, designing a new type of teleportation stretching. Then, we prove that the minimum error probability affecting the channel discrimination cannot beat a bound determined by the Choi matrices of the channels, establishing a general, yet computable formula for quantum hypothesis testing. As a consequence of this bound, we derive ultimate limits and no-go theorems for adaptive quantum illumination and single-photon quantum optical resolution. Finally, we show how the methodology can also be applied to other tasks, such as quantum metrology, quantum communication and secret key generation.

arXiv:1803.02834•npj Quantum Information•Jun 5, 2019•150 citations

Converse bounds for quantum and private communication over Holevo–Werner channels

Thomas Cope, Kenneth Goodenough, Stefano Pirandola

Abstract Werner states have a host of interesting properties, which often serve to illuminate the unusual properties of quantum information. Starting from these states, one may define a family of quantum channels, known as the Holevo–Werner channels, which themselves afford several unusual properties. In this paper we use the teleportation covariance of these channels to upper bound their two-way assisted quantum and secret-key capacities. This bound may be expressed in terms of relative entropy distances, such as the relative entropy of entanglement, and also in terms of the squashed entanglement. Most interestingly, we show that the relative entropy bounds are strictly subadditive for a sub-class of the Holevo–Werner channels, so that their regularization provides a tighter performance. These information-theoretic results are first found for point-to-point communication and then extended to repeater chains and quantum networks, under different types of routing strategies.

arXiv:1804.07775•Journal of Physics A Mathematical and Theoretical•Nov 9, 2018•13 citations

Ultimate Precision of Adaptive Noise Estimation

Stefano Pirandola, Cosmo Lupo

We consider the estimation of noise parameters in a quantum channel, assuming the most general strategy allowed by quantum mechanics. This is based on the exploitation of unlimited entanglement and arbitrary quantum operations, so that the channel inputs may be interactively updated. In this general scenario, we draw a novel connection between quantum metrology and teleportation. In fact, for any teleportation-covariant channel (e.g., Pauli, erasure, or Gaussian channel), we find that adaptive noise estimation cannot beat the standard quantum limit, with the quantum Fisher information being determined by the channel's Choi matrix. As an example, we establish the ultimate precision for estimating excess noise in a thermal-loss channel, which is crucial for quantum cryptography. Because our general methodology applies to any functional that is monotonic under trace-preserving maps, it can be applied to simplify other adaptive protocols, including those for quantum channel discrimination. Setting the ultimate limits for noise estimation and discrimination paves the way for exploring the boundaries of quantum sensing, imaging, and tomography.

arXiv:1609.02160•Physical Review Letters•Mar 7, 2017•108 citations

Noisy Werner-Holevo channel and its properties

Shayan Roofeh, Vahid Karimipour

Interest in the Werner-Holevo channel ${\mathrm{\ensuremath{\Lambda}}}_{1}(\ensuremath{\rho})=\frac{1}{2}[\mathrm{tr}(\ensuremath{\rho})I\ensuremath{-}{\ensuremath{\rho}}^{T}]$ has been mainly due to its abstract mathematical properties. We show that in three dimensions and with a slight modification, this channel can be realized as the rotation of qutrit states in random directions by random angles. Our modification takes the form ${\mathrm{\ensuremath{\Lambda}}}_{x}(\ensuremath{\rho})=(1\ensuremath{-}x)\ensuremath{\rho}+x{\mathrm{\ensuremath{\Lambda}}}_{1}(\ensuremath{\rho})$. Therefore, and in view of the potential use of qutrits in quantum processing tasks and their realization in many different platforms, the modified Werner-Holevo channel can be used as a very simple and realistic noise model, in the same way that the depolarizing channel is for qubits. We will make a detailed study of this channel and derive its various properties. In particular, we will use the recently proposed flag extension and other techniques to derive analytical expressions and bounds for the different capacities of this channel. The role of symmetry is revealed in these derivations. We also rigorously prove that the channel ${\mathrm{\ensuremath{\Lambda}}}_{x}$ is antidegradable and hence has zero quantum capacity, in the region $\frac{4}{7}\ensuremath{\le}x\ensuremath{\le}1.$

arXiv:2310.15353•Physical Review A•May 14, 2024•8 citations

Query complexities of quantum channel discrimination and estimation: A unified approach

Zixin Huang, Johannes Jakob Meyer, Theshani Nuradha +1 more

The goal of quantum channel discrimination and estimation is to determine the identity of an unknown channel from a discrete or continuous set, respectively. The query complexity of these tasks is equal to the minimum number of times one must call an unknown channel to identify it within a desired threshold on the error probability. In this paper, we establish lower bounds on the query complexities of channel discrimination and estimation, in both the parallel and adaptive access models. We do so by establishing new or applying known upper bounds on the squared Bures distance and symmetric logarithmic derivative Fisher information of channels. Phrasing our statements and proofs in terms of isometric extensions of quantum channels allows us to give conceptually simple proofs for both novel and known bounds. We also provide alternative proofs for several established results in an effort to present a consistent and unified framework for quantum channel discrimination and estimation, which we believe will be helpful in addressing future questions in the field.

quant-pharXiv:2511.10832•Nov 17, 2025•4 citations

The Role of Entanglement in Quantum Communication, and Analysis of the Detection Loophole

Thomas Cope

We begin this thesis by expanding the technique of teleportation simulation, which adds noise to the entangled resource state to mimic channel effects. By introducing classical noise in the communication step, we show it is possible to simulate more than just Pauli channels using teleportation. This new class is characterised, and studied in detail for a particular resource state, leading to a family of simulable channels named "Pauli-Damping channels" whose properties are analysed. Also introduced are a new family of quantum states, "phase Werner" states, whose entanglement properties relate to the interesting conjecture of bound entangled states with a negative partial transpose. Holevo-Werner channels, to which these states are connected, are shown to be teleportation covariant. We exploit this to present several interesting results, including the optimal estimation of the channel-defining parameter. The minimal binary-discrimination error for Holevo-Werner channels is bounded for the first time with the analytical form of the quantum Chernoff bound. We also consider the secret key capacity of these channels, showing how different entanglement measures provide a better upper bound for different regions of these channels. Finally, a method for generating new Bell inequalities is presented, exploiting nonphysical probability distributions to obtain new inequalities. Tens of thousands of new inequivalent inequalities are generated, and their usefulness in closing the detection loophole for imperfect detectors is examined, with comparison to the current optimal construction. Two candidate Bell inequalities which may equal or beat the best construction are presented.

arXiv:1904.11769•Apr 26, 2019•3 citations
Abstract The class of quantum states known as Werner states have several interesting properties, which often serve to illuminate unusual properties of quantum information. Closely related to these states are the Holevo- Werner channels whose Choi matrices are Werner states. Exploiting the fact that these channels are teleportation covariant, and therefore simulable by teleportation, we compute the ultimate precision in the adaptive estimation of their channel-defining parameter. Similarly, we bound the minimum error probability affecting the adaptive discrimination of any two of these channels. In this case, we prove an analytical formula for the quantum Chernoff bound which also has a direct counterpart for the class of depolarizing channels. Our work exploits previous methods established in [Pirandola and Lupo, PRL
Abstract What is the ultimate performance for discriminating two arbitrary quantum channels acting on a finite-dimensional Hilbert space? Here we address this basic question by deriving a general and fundamental lower bound. More precisely, we investigate the symmetric discrimination of two arbitrary qudit channels by means of the most general protocols based on adaptive (feedback-assisted) quantum operations. In this general scenario, we first show how port-based teleportation can be used to simplify these adaptive protocols into a much simpler non-adaptive form, designing a new type of teleportation stretching. Then, we prove that the minimum error probability affecting the channel discrimination cannot beat a bound determined by the Choi matrices of the channels, establishing a general, yet computable formula for quantum hypothesis testing. As a consequence of this bound, we derive ultimate limits and no-go theorems for adaptive quantum illumination and single-photon quantum optical resolution. Finally, we show how the methodology can also be applied to other tasks, such as quantum metrology, quantum communication and secret key generation.
Abstract Werner states have a host of interesting properties, which often serve to illuminate the unusual properties of quantum information. Starting from these states, one may define a family of quantum channels, known as the Holevo–Werner channels, which themselves afford several unusual properties. In this paper we use the teleportation covariance of these channels to upper bound their two-way assisted quantum and secret-key capacities. This bound may be expressed in terms of relative entropy distances, such as the relative entropy of entanglement, and also in terms of the squashed entanglement. Most interestingly, we show that the relative entropy bounds are strictly subadditive for a sub-class of the Holevo–Werner channels, so that their regularization provides a tighter performance. These information-theoretic results are first found for point-to-point communication and then extended to repeater chains and quantum networks, under different types of routing strategies.
We consider the estimation of noise parameters in a quantum channel, assuming the most general strategy allowed by quantum mechanics. This is based on the exploitation of unlimited entanglement and arbitrary quantum operations, so that the channel inputs may be interactively updated. In this general scenario, we draw a novel connection between quantum metrology and teleportation. In fact, for any teleportation-covariant channel (e.g., Pauli, erasure, or Gaussian channel), we find that adaptive noise estimation cannot beat the standard quantum limit, with the quantum Fisher information being determined by the channel's Choi matrix. As an example, we establish the ultimate precision for estimating excess noise in a thermal-loss channel, which is crucial for quantum cryptography. Because our general methodology applies to any functional that is monotonic under trace-preserving maps, it can be applied to simplify other adaptive protocols, including those for quantum channel discrimination. Setting the ultimate limits for noise estimation and discrimination paves the way for exploring the boundaries of quantum sensing, imaging, and tomography.
Interest in the Werner-Holevo channel ${\mathrm{\ensuremath{\Lambda}}}_{1}(\ensuremath{\rho})=\frac{1}{2}[\mathrm{tr}(\ensuremath{\rho})I\ensuremath{-}{\ensuremath{\rho}}^{T}]$ has been mainly due to its abstract mathematical properties. We show that in three dimensions and with a slight modification, this channel can be realized as the rotation of qutrit states in random directions by random angles. Our modification takes the form ${\mathrm{\ensuremath{\Lambda}}}_{x}(\ensuremath{\rho})=(1\ensuremath{-}x)\ensuremath{\rho}+x{\mathrm{\ensuremath{\Lambda}}}_{1}(\ensuremath{\rho})$. Therefore, and in view of the potential use of qutrits in quantum processing tasks and their realization in many different platforms, the modified Werner-Holevo channel can be used as a very simple and realistic noise model, in the same way that the depolarizing channel is for qubits. We will make a detailed study of this channel and derive its various properties. In particular, we will use the recently proposed flag extension and other techniques to derive analytical expressions and bounds for the different capacities of this channel. The role of symmetry is revealed in these derivations. We also rigorously prove that the channel ${\mathrm{\ensuremath{\Lambda}}}_{x}$ is antidegradable and hence has zero quantum capacity, in the region $\frac{4}{7}\ensuremath{\le}x\ensuremath{\le}1.$
The goal of quantum channel discrimination and estimation is to determine the identity of an unknown channel from a discrete or continuous set, respectively. The query complexity of these tasks is equal to the minimum number of times one must call an unknown channel to identify it within a desired threshold on the error probability. In this paper, we establish lower bounds on the query complexities of channel discrimination and estimation, in both the parallel and adaptive access models. We do so by establishing new or applying known upper bounds on the squared Bures distance and symmetric logarithmic derivative Fisher information of channels. Phrasing our statements and proofs in terms of isometric extensions of quantum channels allows us to give conceptually simple proofs for both novel and known bounds. We also provide alternative proofs for several established results in an effort to present a consistent and unified framework for quantum channel discrimination and estimation, which we believe will be helpful in addressing future questions in the field.
We begin this thesis by expanding the technique of teleportation simulation, which adds noise to the entangled resource state to mimic channel effects. By introducing classical noise in the communication step, we show it is possible to simulate more than just Pauli channels using teleportation. This new class is characterised, and studied in detail for a particular resource state, leading to a family of simulable channels named "Pauli-Damping channels" whose properties are analysed. Also introduced are a new family of quantum states, "phase Werner" states, whose entanglement properties relate to the interesting conjecture of bound entangled states with a negative partial transpose. Holevo-Werner channels, to which these states are connected, are shown to be teleportation covariant. We exploit this to present several interesting results, including the optimal estimation of the channel-defining parameter. The minimal binary-discrimination error for Holevo-Werner channels is bounded for the first time with the analytical form of the quantum Chernoff bound. We also consider the secret key capacity of these channels, showing how different entanglement measures provide a better upper bound for different regions of these channels. Finally, a method for generating new Bell inequalities is presented, exploiting nonphysical probability distributions to obtain new inequalities. Tens of thousands of new inequivalent inequalities are generated, and their usefulness in closing the detection loophole for imperfect detectors is examined, with comparison to the current optimal construction. Two candidate Bell inequalities which may equal or beat the best construction are presented.