F fidelity-based and relative-entropy-based sufficient conditions for bounding the variation of maximal quantum leakage are derived, and it is illustrated numerically that these conditions can be loose.
Abstract
Maximal quantum leakage (MQL) is a worst-case information leakage measure that quantifies an adversary's inference advantage gained from accessing quantum encoding of classical data with arbitrary measurements. While MQL admits an exact characterization for a given ensemble of quantum states, its robustness to implementation imperfections has not been systematically studied. In this paper, we analyze the sensitivity of maximal quantum leakage under perturbations of the quantum encoding. We establish a continuity bound in terms of the trace distance between ideal and perturbed quantum states, and show, via an example, that this bound is attainable. We further derive fidelity-based and relative-entropy-based sufficient conditions for bounding the variation of maximal quantum leakage, and illustrate numerically that these conditions can be loose.
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.
Quantum distance-bounding (QDB) protocols let a verifier check that a prover is both genuine and physically nearby. During a timed fast phase of quantum communication, the verifier measures round-trip times to obtain an upper bound on the prover's distance. For a uniform comparison, we isolate the fast phase and study one-round distance-fraud (DF) and mafia-fraud (MF) games. For discrete-variable QDB, we show that these games reduce to convex optimization problems and can therefore be solved exactly with semidefinite programming; each MF value comes with an explicit attack achieving it and a matching certificate that no attack does better. This contrasts with quantum position verification, where an attack is split between two separated parties, so its optimization is nonconvex and analyses rely on relaxations. In our MF game, the cooperating pair collapses to a single sequential strategy, which keeps the game convex and its exact value computable. Across the discrete-variable protocols we examine, the best one-round DF attack succeeds with the same probability ($1/2$) for every protocol, whereas MF clearly separates the protocols. For continuous-variable QDB, we report estimated attack success probabilities from a calibrated Gaussian attack model. The benchmark covers protocols whose fast phase itself authenticates the prover; designs that follow Brands and Chaum and instead bind the fast phase with a final authenticated message, like the earliest QDB proposal, fall outside it and are treated separately. Of the four protocols studied, two had no previously known one-round attack values, and we report the first ones; for the other two, we find MF attacks with higher success probability than previously reported. Overall, one-round MF resistance depends on whether an attacker can use information revealed early by the prover to answer a fresh challenge from the verifier.
Kevin Bogner, Aysajan Abidin, Dave Singelée et al.· 0 citations
Correlations that do not admit a deterministic explanation are a central feature of quantum theory and a key resource for quantum information processing. Identifying and certifying such correlations, however, remains a fundamental challenge. In this work, we advance on this problem by considering deterministic correlations in the prepare-and-measure scenario consistent with a wide range of communication restrictions. To certify correlations incompatible with such deterministic models, we ask whether they admit a scenario in which measurement outcomes can be perfectly predicted by an adversary equipped with classical side-information. We show the usefulness of this approach and propose semidefinite programming relaxations tailored to three representative communication restrictions: fixed ensemble, bounded overlaps and restricted observables.
Nicola d’Alessandro, Oliver Karlsson, C. R. I. Carceller· 1 citation· ⚡1
Demonstrating quantum advantage in a manner that can be independently verified by classical means remains one of the most pressing open problems in quantum computing. Here we propose a new heuristic approach for constructing quantum circuits that are hard to classically simulate yet whose output distributions can be efficiently verified classically. Our approach is based on Clifford circuit obfuscation. This obfuscation scheme hides the Clifford structure and injects a controlled and rapidly growing non-stabilizer resources that resist known classical attack strategies including reverse engineering and direct simulation. Our protocol is heuristic but is supported by both numerical and theoretical evidence. This work provides a new avenue toward classically verifiable quantum advantage that avoids the stringent implementation requirements of known approaches.
Quantum secret sharing is a fundamental protocol for securely transmitting quantum as well as classical information. However, in practical quantum communication scenarios, the transmission of quantum information is inevitably influenced by environmental noise. Therefore, in this work, we analyze the robustness of multi‐dimensional quantum secret sharing schemes under four different noise models, namely amplitude damping (ad), depolarizing (d), dit flip (df), and phase flip (dpf). Each model captures a distinct type of quantum disturbance, providing insights into how different noise models affect the fidelity of secret reconstruction. In addition to state‐specific fidelity, we also evaluate the average fidelity over arbitrary pure qutrit secret states using the Haar, equivalently Fubini–Study, measure. This provides a state‐independent robustness indicator and allows a more meaningful comparison of the considered quantum secret sharing schemes when the dealer's secret state is arbitrary. Moreover, we observe that protocols involving a larger number of qudits generally exhibit higher implementation complexity and increased sensitivity to noise. Consequently, the fidelity degrades more rapidly. Moreover, it is observed that the amplitude damping noise shows the highest fidelity across most parameter ranges, suggesting a better preservation of quantum secret.
Privacy of a quantum metrological protocol concerns the extent to which single parameters can be kept inaccessible to an observer or to other users of the network. In this work, an information geometric framework is developed to quantify privacy and accessibility of functions of parameters effectively, that is, up to a finite accuracy in state discrimination. Both quantities are defined by measuring volumes in the parameter space induced by the underlying quantum states. This construction subsumes previous definitions of privacy based on the degeneracy of quantum Fisher information, naturally encompassing imperfect implementations. Using extended-GHZ states as a representative example of a quantum network scenario, privacy and accessibility are characterized by quantum correlations and accuracy, providing scaling laws depending on imperfect measurements and entanglement.
Luca Bianchi, Shimpei Yamaguchi, W. Roga et al.· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
