Maximal quantum leakage: operational interpretation and quantum channel analysis

• URL: http://arxiv.org/abs/2607.15853v1
• Date: Fri, 17 Jul 2026 11:10:16 GMT
• Title: Maximal quantum leakage: operational interpretation and quantum channel analysis
• Abstract summary: We prove that computing maximal quantum leakage is equivalent to minimum-error quantum state discrimination with equal priors.<n>We also analyze the impact of collective measurements on multiple copies of a state, demonstrating that leakage increases monotonically with the number of copies.
• Score: 16.152608258610666
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Maximal quantum leakage quantifies privacy against adversaries with arbitrary intentions. In this work, we prove that computing this leakage is equivalent to minimum-error quantum state discrimination with equal priors. This establishes a computable operational interpretation, addressing the previous difficulty in computing maximal quantum leakage. We further analyze the impact of collective measurements on multiple copies of a state, demonstrating that leakage increases monotonically with the number of copies, which leads to explicitly characterizing the maximal leakage in the asymptotic limit. Extending this framework to quantum channels, we develop an iterative algorithm for the jointly designing of input states and measurements. Numerical examples involving collective measurements and the maximal channel leakage demonstrate our theoretical findings.

Related papers

• Perturbation Analysis of Maximal Quantum Leakage [8.545974524515128]
  We analyze the sensitivity of maximal quantum leakage under perturbations of the quantum encoding.<n>We derive fidelity-based and relative-entropy-based sufficient conditions for bounding the variation of maximal quantum leakage.
  arXiv  Detail & Related papers  (2026-07-16T01:33:23Z)
• Heisenberg limited quantum algorithm for estimating the fidelity susceptibility [4.524082537369606]
  We present a quantum algorithm that achieves efficient and Heisenberg-limited estimation of fidelity susceptibility.<n>Our work bridges quantum many-body physics and algorithmic design, enabling scalable exploration of quantum criticality.
  arXiv  Detail & Related papers  (2025-09-01T10:56:50Z)
• The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the multimode extreme 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.<n>Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime.
  arXiv  Detail & Related papers  (2024-10-18T13:59:50Z)
• Measuring Quantum Information Leakage Under Detection Threat [7.82527155589504]
  Gentle quantum leakage is proposed as a measure of information leakage to arbitrary eavesdroppers. Measures are used to encode the desire of the eavesdropper to evade detection. Global depolarizing noise is shown to reduce gentle quantum leakage.
  arXiv  Detail & Related papers  (2024-03-18T03:07:09Z)
• 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)
• Analyzing Prospects for Quantum Advantage in Topological Data Analysis [35.423446067065576]
  We analyze and optimize an improved quantum algorithm for topological data analysis. We show that super-quadratic quantum speedups are only possible when targeting a multiplicative error approximation. We argue that quantum circuits with tens of billions of Toffoli can solve seemingly classically intractable instances.
  arXiv  Detail & Related papers  (2022-09-27T17:56:15Z)
• Universal cost bound of quantum error mitigation based on quantum estimation theory [0.0]
  We present a unified approach to analyzing the cost of various quantum error mitigation methods on the basis of quantum estimation theory. We derive for a generic layered quantum circuit under a wide class of Markovian noise that, unbiased estimation of an observable encounters an exponential growth with the circuit depth in the lower bound on the measurement cost. Our results contribute to the understanding of the physical limitations of quantum error mitigation and offer a new criterion for evaluating the performance of quantum error mitigation techniques.
  arXiv  Detail & Related papers  (2022-08-19T15:04:36Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Quantum Algorithm for Quantum State Discrimination via Partial Negation and Weak Measurement [1.2691047660244335]
  A quantum algorithm using weak measurement and partial negation will be proposed to solve the quantum state discrimination problem. The proposed algorithm will be able to determine, with high probability of success, the state of the unknown qubit.
  arXiv  Detail & Related papers  (2021-02-23T21:18:19Z)
• Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems [69.33243249411113]
  We show that Pauli errors incur the lowest sampling overhead among a large class of realistic quantum channels. We conceive a scheme amalgamating QEM with quantum channel coding, and analyse its sampling overhead reduction compared to pure QEM.
  arXiv  Detail & Related papers  (2020-12-15T15:51:27Z)
• 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.