Finitely Repeated Adversarial Quantum Hypothesis Testing

• URL: http://arxiv.org/abs/2212.02314v1
• Date: Fri, 2 Dec 2022 17:08:17 GMT
• Title: Finitely Repeated Adversarial Quantum Hypothesis Testing
• Authors: Yinan Hu, Quanyan Zhu
• Abstract summary: We formulate a passive quantum detector based on a quantum hypothesis testing framework under the setting of finite sample size. Under the assumption that the attacker adopts separable optimal strategies, we derive that the worst-case average error bound converges to zero exponentially. We adopt our formulations upon a case study of detection with quantum radars.
• Score: 22.102728605081534
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We formulate a passive quantum detector based on a quantum hypothesis testing framework under the setting of finite sample size. In particular, we exploit the fundamental limits of performance of the passive quantum detector asymptotically. Under the assumption that the attacker adopts separable optimal strategies, we derive that the worst-case average error bound converges to zero exponentially in terms of the number of repeated observations, which serves as a variation of quantum Sanov's theorem. We illustrate the general decaying results of miss rate numerically, depicting that the `naive' detector manages to achieve a miss rate and a false alarm rate both exponentially decaying to zero given infinitely many quantum states, although the miss rate decays to zero at a much slower rate than a quantum non-adversarial counterpart. Finally we adopt our formulations upon a case study of detection with quantum radars.

Related papers

• Two-stage Quantum Estimation and the Asymptotics of Quantum-enhanced Transmittance Sensing [2.5449435573379757]
  Quantum Cram'er-Rao bound is the ultimate limit of the mean squared error for unbiased estimation of an unknown parameter embedded in a quantum state. We apply our results to the cost of quantum-enhanced transmittance sensing.
  arXiv  Detail & Related papers  (2024-02-27T22:28:42Z)
• 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)
• On the optimal error exponents for classical and quantum antidistinguishability [3.481985817302898]
  Antidistinguishability has been used to investigate the reality of quantum states. We show that the optimal error exponent vanishes to zero for classical and quantum antidistinguishability. It remains an open problem to obtain an explicit expression for the optimal error exponent for quantum antidistinguishability.
  arXiv  Detail & Related papers  (2023-09-07T14:03:58Z)
• Hierarchies of Frequentist Bounds for Quantum Metrology: From Cram\'er-Rao to Barankin [0.0]
  We obtain hierarchies of increasingly tight bounds that include the quantum Cram'er-Rao bound at the lowest order. Results reveal generalizations of the quantum Fisher information that are able to avoid regularity conditions.
  arXiv  Detail & Related papers  (2023-03-10T17:55:52Z)
• Certified Robustness of Quantum Classifiers against Adversarial Examples through Quantum Noise [68.1992787416233]
  We show that adding quantum random rotation noise can improve robustness in quantum classifiers against adversarial attacks. We derive a certified robustness bound to enable quantum classifiers to defend against adversarial examples.
  arXiv  Detail & Related papers  (2022-11-02T05:17:04Z)
• 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 Fluctuation-Response Inequality and Its Application in Quantum Hypothesis Testing [6.245537312562826]
  We find a bound for the mean difference of an observable at two different quantum states. When the spectrum of the observable is bounded, the sub-Gaussian property is used to link the bound with the sub-Gaussian norm of the observable. We show the versatility of our results by their applications in problems like thermodynamic inference and speed limit.
  arXiv  Detail & Related papers  (2022-03-20T09:10:54Z)
• Dual-Frequency Quantum Phase Estimation Mitigates the Spectral Leakage of Quantum Algorithms [76.15799379604898]
  Quantum phase estimation suffers from spectral leakage when the reciprocal of the record length is not an integer multiple of the unknown phase. We propose a dual-frequency estimator, which approaches the Cramer-Rao bound, when multiple samples are available.
  arXiv  Detail & Related papers  (2022-01-23T17:20:34Z)
• 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)
• 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)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)

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.