Distributed Quantum Hypothesis Testing under Zero-rate Communication Constraints

• URL: http://arxiv.org/abs/2410.08937v2
• Date: Wed, 22 Jan 2025 20:40:10 GMT
• Title: Distributed Quantum Hypothesis Testing under Zero-rate Communication Constraints
• Authors: Sreejith Sreekumar, Christoph Hirche, Hao-Chung Cheng, Mario Berta,
• Abstract summary: We study a distributed binary hypothesis testing problem to infer a bipartite quantum state shared between two remote parties. We show that the Stein's exponent when one of the parties communicates classically at zero-rate is given by a multi-letter expression. As a key tool for proving the converse direction of our results, we develop a quantum version of the blowing-up lemma.
• Score: 14.29947046463964
• License:
• Abstract: The trade-offs between error probabilities in quantum hypothesis testing are by now well-understood in the centralized setting, but much less is known for distributed settings. Here, we study a distributed binary hypothesis testing problem to infer a bipartite quantum state shared between two remote parties, where one of these parties communicates to the tester at zero-rate, while the other party communicates to the tester at zero-rate or higher. As our main contribution, we derive an efficiently computable single-letter formula for the Stein's exponent of this problem, when the state under the alternative is product. For the general case, we show that the Stein's exponent when (at least) one of the parties communicates classically at zero-rate is given by a multi-letter expression involving max-min optimization of regularized measured relative entropy. While this becomes single-letter for the fully classical case, we further prove that this already does not happen in the same way for classical-quantum states in general. As a key tool for proving the converse direction of our results, we develop a quantum version of the blowing-up lemma which may be of independent interest.

Related papers

• Induced Quantum Divergence: A New Lens on Communication and Source Coding [4.3512163406552]
  This paper introduces the induced divergence, a new quantum divergence measure that replaces the hypothesis testing divergence in position-based decoding. Two key applications are considered: classical communication over quantum channels, and quantum state redistribution. Results provide new insights into fundamental single-shot quantum information protocols.
  arXiv  Detail & Related papers  (2025-02-19T12:25:56Z)
• General detectability measure [53.64687146666141]
  Distinguishing resource states from resource-free states is a fundamental task in quantum information. We derived the optimal exponential decay rate of the failure probability for detecting a given $n$-tensor product state.
  arXiv  Detail & Related papers  (2025-01-16T05:39:22Z)
• Normal quantum channels and Markovian correlated two-qubit quantum errors [77.34726150561087]
  We study general normally'' distributed random unitary transformations. On the one hand, a normal distribution induces a unital quantum channel. On the other hand, the diffusive random walk defines a unital quantum process.
  arXiv  Detail & Related papers  (2023-07-25T15:33:28Z)
• Experimental certification of more than one bit of quantum randomness in the two inputs and two outputs scenario [0.0]
  We present an experimental realization of recent Bell-type operators designed to provide private random numbers that are secure against adversaries with quantum resources. We use semi-definite programming to provide lower bounds on the generated randomness in terms of both min-entropy and von Neumann entropy. Our results demonstrate the first experiment that certifies close to two bits of randomness from binary measurements of two parties.
  arXiv  Detail & Related papers  (2023-03-13T20:42:53Z)
• Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification [56.61325554836984]
  The max-relative entropy together with its smoothed version is a basic tool in quantum information theory. We derive the exact exponent for the decay of the small modification of the quantum state in smoothing the max-relative entropy based on purified distance.
  arXiv  Detail & Related papers  (2021-11-01T16:35:41Z)
• 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)
• Composable security for practical quantum key distribution with two way classical communication [0.9749560288448115]
  We show that simply applying Chernoff bound in the calculation gives correct key rate, but the failure probability changes a little bit. We show that simply applying Chernoff bound in the calculation gives correct key rate, but the failure probability changes a little bit.
  arXiv  Detail & Related papers  (2021-02-01T10:11:42Z)
• Discrimination of quantum states under locality constraints in the many-copy setting [18.79968161594709]
  We prove that the optimal average error probability always decays exponentially in the number of copies. We show an infinite separation between the separable (SEP) and PPT operations by providing a pair of states constructed from an unextendible product basis (UPB) On the technical side, we prove this result by providing a quantitative version of the well-known statement that the tensor product of UPBs is a UPB.
  arXiv  Detail & Related papers  (2020-11-25T23:26:33Z)
• Computing conditional entropies for quantum correlations [10.549307055348596]
  In particular, we find new upper bounds on the minimal global detection efficiency required to perform device-independent quantum key distribution. We introduce the family of iterated mean quantum R'enyi divergences with parameters $alpha_k = 1+frac12k-1$ for positive integers $k$. We show that the corresponding conditional entropies admit a particularly nice form which, in the context of device-independent optimization, can be relaxed to a semidefinite programming problem.
  arXiv  Detail & Related papers  (2020-07-24T15:27:51Z)
• Quantum Communication Complexity of Distribution Testing [114.31181206328276]
  Two players each receive $t$ samples from one distribution over $[n]$. The goal is to decide whether their two distributions are equal, or are $epsilon$-far apart. We show that the quantum communication complexity of this problem is $tildeO$(tepsilon2))$ qubits when distributions have low $l$-norm.
  arXiv  Detail & Related papers  (2020-06-26T09:05:58Z)
• Einselection from incompatible decoherence channels [62.997667081978825]
  We analyze an open quantum dynamics inspired by CQED experiments with two non-commuting Lindblad operators. We show that Fock states remain the most robust states to decoherence up to a critical coupling.
  arXiv  Detail & Related papers  (2020-01-29T14:15:19Z)

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.