Bounds on amplitude damping channel discrimination
- URL: http://arxiv.org/abs/2009.04783v3
- Date: Mon, 26 Apr 2021 18:00:15 GMT
- Title: Bounds on amplitude damping channel discrimination
- Authors: Jason L. Pereira and Stefano Pirandola
- Abstract summary: adaptivity has been shown to improve the performance of discrimination protocols.
We present a tighter lower bound on the achievable trace norm between protocol outputs.
The upper and lower bounds are compared with existing bounds and then applied to quantum hacking and biological quantum sensing scenarios.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Amplitude damping (AD) channels are good models for many physical scenarios,
and so the development of protocols to discriminate between them is an
important task in quantum information science. It is therefore important to
bound the performance of such protocols. Since adaptivity has been shown to
improve the performance of discrimination protocols, bounds on the
distinguishability of AD channels must take this into account. In this paper,
we use both channel simulation and a bound based on the diamond norm to
significantly tighten the upper bound on the trace norm between the possible
outputs of binary channel discrimination protocols acting on AD channels (and
hence the lower bound on the error probability of such protocols). The diamond
norm between any two AD channels is found analytically, giving the optimal
error probability for a one-shot discrimination protocol. We also present a
tighter lower bound on the achievable trace norm between protocol outputs (and
a corresponding upper bound on the achievable error probability). The upper and
lower bounds are compared with existing bounds and then applied to quantum
hacking and biological quantum sensing scenarios.
Related papers
- Resolvability of classical-quantum channels [54.825573549226924]
We study the resolvability of classical-quantum channels in two settings, for the channel output generated from the worst input, and form the fixed independent and identically distributed (i.i.d.) input.
For the fixed-input setting, while the direct part follows from the known quantum soft covering result, we exploit the recent alternative quantum Sanov theorem to solve the strong converse.
arXiv Detail & Related papers (2024-10-22T05:18:43Z) - Optimal quantum strategy for locating Unruh channels [0.0]
We employ the tools of channel-position finding to locate Unruh channels.
The signal-idler and idler-free protocols are explored to determine the position of the target Unruh channel.
arXiv Detail & Related papers (2024-04-30T02:33:37Z) - Geometry of sequential quantum correlations and robust randomness
certification [0.0]
We study the geometry of quantum correlations and their implications for robust device-independent randomness generation.
We identify a boundary for the set of these correlations expressed as a trade-off between the amount of nonlocality between different observers.
We propose a practical protocol based on non-projective measurements that can produce the boundary correlations under ideal conditions.
arXiv Detail & Related papers (2023-09-21T17:50:29Z) - Hierarchical Semi-Supervised Contrastive Learning for
Contamination-Resistant Anomaly Detection [81.07346419422605]
Anomaly detection aims at identifying deviant samples from the normal data distribution.
Contrastive learning has provided a successful way to sample representation that enables effective discrimination on anomalies.
We propose a novel hierarchical semi-supervised contrastive learning framework, for contamination-resistant anomaly detection.
arXiv Detail & Related papers (2022-07-24T18:49:26Z) - Data post-processing for the one-way heterodyne protocol under
composable finite-size security [62.997667081978825]
We study the performance of a practical continuous-variable (CV) quantum key distribution protocol.
We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime.
This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
arXiv Detail & Related papers (2022-05-20T12:37:09Z) - Learning to Perform Downlink Channel Estimation in Massive MIMO Systems [72.76968022465469]
We study downlink (DL) channel estimation in a Massive multiple-input multiple-output (MIMO) system.
A common approach is to use the mean value as the estimate, motivated by channel hardening.
We propose two novel estimation methods.
arXiv Detail & Related papers (2021-09-06T13:42:32Z) - Bounding the benefit of adaptivity in quantum metrology using the
relative fidelity [0.0]
Protocols for discriminating between a pair of channels or for estimating a channel parameter can often be aided by adaptivity or by entanglement between the probe states.
We introduce a quantity that we call the relative fidelity of a given pair of channels and a pair of input states to those channels.
We are then able to lower bound the fidelity between the possible output states of any protocol acting on one of two possible channels in terms of the minimum relative fidelity.
arXiv Detail & Related papers (2021-04-22T19:25:33Z) - Composably secure data processing for Gaussian-modulated continuous
variable quantum key distribution [58.720142291102135]
Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties.
We consider a protocol with homodyne detection in the general setting of composable finite-size security.
In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
arXiv Detail & Related papers (2021-03-30T18:02:55Z) - Round-robin differential phase-time-shifting protocol for quantum key
distribution: theory and experiment [58.03659958248968]
Quantum key distribution (QKD) allows the establishment of common cryptographic keys among distant parties.
Recently, a QKD protocol that circumvents the need for monitoring signal disturbance, has been proposed and demonstrated in initial experiments.
We derive the security proofs of the round-robin differential phase-time-shifting protocol in the collective attack scenario.
Our results show that the RRDPTS protocol can achieve higher secret key rate in comparison with the RRDPS, in the condition of high quantum bit error rate.
arXiv Detail & Related papers (2021-03-15T15:20:09Z) - Analytical Bounds for Dynamic Multi-Channel Discrimination [0.0]
Optimal discrimination protocols often rely on entanglement shared between an incident probe and a protected idler-mode.
In this work, we investigate idler-free block protocols based on the use of multipartite entangled probe states.
We derive new, analytical bounds for the average error probability of such protocols in a bosonic Gaussian channel setting.
arXiv Detail & Related papers (2021-01-26T10:39:26Z) - Ultimate limits of approximate unambiguous discrimination [1.14219428942199]
Two main strategies have been widely adopted: in a minimum error discrimination strategy, the average error probability is minimized; while in an unambiguous discrimination strategy, an inconclusive decision is allowed to vanish any possibility of errors when a conclusive result is obtained.
In this paper, we formulate an approximate unambiguous discrimination scenario, and derive the ultimate limits of the performance for both states and channels.
For the special class of teleportation-covariant' channels, the lower bound is achievable with maximum entangled inputs and no adaptive strategy is necessary.
arXiv Detail & Related papers (2020-10-29T16:58:42Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.