Ultimate limits for multiple quantum channel discrimination

• URL: http://arxiv.org/abs/2007.14566v2
• Date: Tue, 17 Nov 2020 18:55:24 GMT
• Title: Ultimate limits for multiple quantum channel discrimination
• Authors: Quntao Zhuang and Stefano Pirandola
• Abstract summary: This paper studies the problem of hypothesis testing with quantum channels. We establish a lower limit for the ultimate error probability affecting the discrimination of an arbitrary number of quantum channels. We also show that this lower bound is achievable when the channels have certain symmetries.
• Score: 0.966840768820136
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum hypothesis testing is a central task in the entire field of quantum information theory. Understanding its ultimate limits will give insight into a wide range of quantum protocols and applications, from sensing to communication. Although the limits of hypothesis testing between quantum states have been completely clarified by the pioneering works of Helstrom in the 70s, the more difficult problem of hypothesis testing with quantum channels, i.e., channel discrimination, is less understood. This is mainly due to the complications coming from the use of input entanglement and the possibility of employing adaptive strategies. In this paper, we establish a lower limit for the ultimate error probability affecting the discrimination of an arbitrary number of quantum channels. We also show that this lower bound is achievable when the channels have certain symmetries. As an example, we apply our results to the problem of channel position finding, where the goal is to identify the location of a target channel among multiple background channels. In this general setting, we find that the use of entanglement offers a great advantage over strategies without entanglement, with non-trivial implications for data readout, target detection and quantum spectroscopy.

Related papers

• The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the extreme multimode bosonic Gaussian channels [53.253900735220796]
  Inequality determines the minimum conditional von Neumann entropy of the output of the most general linear mixing of bosonic quantum modes. Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime.
  arXiv  Detail & Related papers  (2024-10-18T13:59:50Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Towards the ultimate limits of quantum channel discrimination [18.836836815159764]
  We make a conjecture on the exponentially strong converse of quantum channel hypothesis testing under coherent strategies. We develop a framework to show the interplay between the strategies of channel discrimination, the operational regimes, and variants of channel divergences.
  arXiv  Detail & Related papers  (2021-10-28T01:48:13Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• Towards Optimal Quantum Ranging -- Hypothesis Testing for an Unknown Return Signal [6.345523830122166]
  In rangefinding and LIDAR, the presence or absence of a target can be tested by detecting different states at the receiver. We use quantum hypothesis testing for an unknown coherent-state return signal in order to derive the limits of symmetric and asymmetric error probabilities.
  arXiv  Detail & Related papers  (2021-09-03T16:20:54Z)
• Quantum ranging with Gaussian entanglement [1.14219428942199]
  We propose a quantum ranging protocol enhanced by entanglement. We show that entanglement enables a 6-dB advantage in the error exponent against the optimal classical scheme.
  arXiv  Detail & Related papers  (2021-03-19T23:03:18Z)
• Idler-Free Multi-Channel Discrimination via Multipartite Probe States [0.0]
  Multi-channel discrimination creates a scenario in which the discrimination of multiple quantum channels can be equated to the idea of pattern recognition. We develop general classes of unassisted multi-channel discrimination protocols which are not assisted by idler modes. Our findings uncover the existence of strongly quantum advantageous, idler-free protocols for the discrimination of bosonic loss and environmental noise.
  arXiv  Detail & Related papers  (2020-10-23T12:35:15Z)
• Optimal environment localization [0.8602553195689513]
  We consider the paradigmatic case of channel position finding. The goal of the problem is to detect the position of a target environment among a number of identical background environments. We derive bounds for the ultimate error probability affecting this multi-ary discrimination problem. We design an explicit protocol that gives numerical bounds on the ultimate error probability and often achieves quantum advantage.
  arXiv  Detail & Related papers  (2020-09-21T18:00:08Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)

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.