Sample Complexity of Locally Differentially Private Quantum Hypothesis Testing

• URL: http://arxiv.org/abs/2406.18658v1
• Date: Wed, 26 Jun 2024 18:00:19 GMT
• Title: Sample Complexity of Locally Differentially Private Quantum Hypothesis Testing
• Authors: Hao-Chung Cheng, Christoph Hirche, Cambyse Rouzé,
• Abstract summary: We provide achievability and converse bounds for different settings. This includes symmetric state discrimination in various regimes and the asymmetric case. An important tool in this endeavor are new entropy inequalities that we believe to be of independent interest.
• Score: 10.14555083237668
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum state discrimination is an important problem in many information processing tasks. In this work we are concerned with finding its best possible sample complexity when the states are preprocessed by a quantum channel that is required to be locally differentially private. To that end we provide achievability and converse bounds for different settings. This includes symmetric state discrimination in various regimes and the asymmetric case. On the way, we also prove new sample complexity bounds for the general unconstrained setting. An important tool in this endeavor are new entropy inequalities that we believe to be of independent interest.

Related papers

• Sample Complexity of Composite Quantum Hypothesis Testing [1.376408511310322]
  We characterize the sample complexity of symmetric composite binary quantum hypothesis testing.<n>Specifically, we derive lower bounds that generalize the sample complexity of simple QHT.<n>We extend our analysis to the differentially private setting, establishing the sample complexity for privacy-preserving composite QHT.
  arXiv  Detail & Related papers  (2026-01-13T14:15:12Z)
• Quantum Sequential Universal Hypothesis Testing [62.751483592497806]
  Quantum hypothesis testing (QHT) concerns the statistical inference of unknown quantum states.<n>We introduce the quantum sequential universal test (QSUT), a novel framework for sequential QHT in the general case of composite hypotheses.<n> QSUT builds on universal inference, and it alternates between adaptive local measurements aimed at exploring the hypothesis space and joint measurements optimized for maximal discrimination.
  arXiv  Detail & Related papers  (2025-08-29T12:50:04Z)
• Detecting quantum non-Gaussianity with a single quadrature [0.5242869847419834]
  We show that the statistics of a single quadrature measurement can witness arbitrary degrees of non-Gaussianity as quantified by stellar rank.<n>We provide an analysis of sample complexity, noise robustness, and experimental prospects.
  arXiv  Detail & Related papers  (2025-07-30T18:09:46Z)
• Universal and Efficient Quantum State Verification via Schmidt Decomposition and Mutually Unbiased Bases [0.0]
  We propose a universal protocol to verify arbitrary multipartite pure quantum states.<n>We establish a universal upper bound on the sample complexity that is independent of the local dimensions.
  arXiv  Detail & Related papers  (2025-06-24T17:22:01Z)
• Comparing quantum complexity and quantum fidelity [0.0]
  We show that complexity provides the same information as quantum fidelity and is therefore capable of detecting quantum phase transitions. We conclude that incorporating a notion of spatial locality into the computation of complexity is essential to uncover new physics.
  arXiv  Detail & Related papers  (2025-03-12T13:04:57Z)
• Reducing the sampling complexity of energy estimation in quantum many-body systems using empirical variance information [45.18582668677648]
  We consider the problem of estimating the energy of a quantum state preparation for a given Hamiltonian in Pauli decomposition. We construct an adaptive estimator using the state's actual variance.
  arXiv  Detail & Related papers  (2025-02-03T19:00:01Z)
• The complexity of entanglement embezzlement [0.0]
  We study the circuit complexity of embezzlement using sequences of states that enable arbitrary precision for the process. Our results imply that circuit complexity acts as a physical obstruction to perfect embezzlement.
  arXiv  Detail & Related papers  (2024-10-24T18:00:33Z)
• Optimal discrimination of quantum sequences [13.39567116041819]
  Key concept of quantum information theory is that accessing information encoded in a quantum system requires us to discriminate between several possible states the system could be in. In this paper, we prove that if the members of a given sequence are drawn secretly and independently from an ensemble or even from different ensembles, the optimum success probability is achievable by fixed local measurements on the individual members of the sequence.
  arXiv  Detail & Related papers  (2024-09-13T10:48:16Z)
• What if you have only one copy? Low-depth quantum circuits have no advantage in decision problems! [14.322753787990036]
  We show that gleaning insights into specific properties is feasible even with a single-state sample. Our results apply to quantum states with low circuit complexity, including noise-affected ones. We reveal no quantum advantage in decision problems involving low-depth quantum circuits.
  arXiv  Detail & Related papers  (2024-04-08T17:52:03Z)
• Learning Properties of Quantum States Without the I.I.D. Assumption [7.537220883022466]
  We develop a framework for learning properties of quantum states beyond the assumption of independent and identically distributed (i.i.d.) input states. We use rigorous quantum information theory to prove our main results.
  arXiv  Detail & Related papers  (2024-01-30T11:45:38Z)
• Unifying (Quantum) Statistical and Parametrized (Quantum) Algorithms [65.268245109828]
  We take inspiration from Kearns' SQ oracle and Valiant's weak evaluation oracle. We introduce an extensive yet intuitive framework that yields unconditional lower bounds for learning from evaluation queries.
  arXiv  Detail & Related papers  (2023-10-26T18:23:21Z)
• Benchmarking a boson sampler with Hamming nets [1.0555513406636092]
  We propose a machine-learning-based protocol to benchmark a boson sampler with unknown scattering matrix. Our framework can be directly applied for characterizing boson sampling devices that are currently available in experiments.
  arXiv  Detail & Related papers  (2023-05-18T13:07:02Z)
• One-Way Ticket to Las Vegas and the Quantum Adversary [78.33558762484924]
  We show that quantum Las Vegas query complexity is exactly equal to the quantum adversary bound. This is achieved by transforming a feasible solution to the adversary inversion problem into a quantum query algorithm.
  arXiv  Detail & Related papers  (2023-01-05T11:05:22Z)
• 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)
• 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)
• Gaussian Process States: A data-driven representation of quantum many-body physics [59.7232780552418]
  We present a novel, non-parametric form for compactly representing entangled many-body quantum states. The state is found to be highly compact, systematically improvable and efficient to sample. It is also proven to be a universal approximator' for quantum states, able to capture any entangled many-body state with increasing data set size.
  arXiv  Detail & Related papers  (2020-02-27T15:54:44Z)
• The Simulator: Understanding Adaptive Sampling in the Moderate-Confidence Regime [52.38455827779212]
  We propose a novel technique for analyzing adaptive sampling called the em Simulator. We prove the first instance-based lower bounds the top-k problem which incorporate the appropriate log-factors. Our new analysis inspires a simple and near-optimal for the best-arm and top-k identification, the first em practical of its kind for the latter problem.
  arXiv  Detail & Related papers  (2017-02-16T23:42:02Z)

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.