Optimal Quantum Differential Privacy via Fisher Information Spectral Analysis

• URL: http://arxiv.org/abs/2605.24166v1
• Date: Fri, 22 May 2026 19:36:42 GMT
• Title: Optimal Quantum Differential Privacy via Fisher Information Spectral Analysis
• Abstract summary: Quantum Fisher Information (QFI) metric governs a fundamental duality.<n>We exploit this duality to establish a geometry-aware framework for quantum differential privacy.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The Quantum Fisher Information (QFI) metric governs a fundamental duality: it quantifies both how precisely a parameter can be estimated (metrology) and how distinguishable two quantum states are (privacy). We exploit this duality to establish a geometry-aware framework for quantum differential privacy (DP) that replaces isotropic depolarizing noise with direction-dependent noise aligned to the QFI eigenstructure of the quantum embedding. We prove six principal theorems: (1) the minimax-optimal mechanism concentrates the noise budget in the dominant QFI eigenmode, achieving $\varepsilon = (Δ^2/2)λ_{\max}(1-cγ)$ with $O(d/λ_{\max})$ advantage; (2) mixed-state QFI decomposition reveals that dephasing in the adversary's basis $\textit{increases}$ accessible information, while misaligned-basis dephasing provides constructive privacy amplification from hardware noise; (3) a tight privacy $-$ utility uncertainty relation $\varepsilon \cdot (1 - F) \ge \frac{Δ^2}{2}\frac{\operatorname{Tr}(F)}{d}$; (4) adaptive QFI estimation converging at $O(1/\sqrt{n})$ yields $1.92\times$ tighter bounds; (5) QFI-aligned composition saturates at $O(1)$ versus $O(k)$ for standard composition; and (6) hardware noise can be harnessed for privacy amplification. Adversarial vulnerabilities, Wasserstein guarantees, subspace projection, and a zero-knowledge audit protocol follow as corollaries. Results are validated on Qiskit Aer GPU simulations, IBM Quantum hardware (ibm_fez, 156 qubits), and against classical DP baselines, achieving equivalent utility at $\varepsilon \approx 0.001$ versus $\varepsilon \approx 4800$ for classical DP.

Related papers

• Gradient-based optimal control of the non-Hermitian skin effect in optomechanical arrays [0.0]
  Single-port non-Hermitian sensors impose a strict resource bound on metrological precision.<n>We test whether multi-port geometry can evade this resource bound by a double-chain opto ladder with opposing non-reciprocal amplification.<n>All solutions remain Hurwitz-stable under ty5percent disorder (qty87.5percent recovery), and the deep-stability advantage survives realistic noise.<n>The architecture enables subattonewton force sensing searches across the qtyrange110gigahertz band.
  arXiv  Detail & Related papers  (2026-09-03T21:25:02Z)
• Quantum Speedups for Stochastic Optimization with Heavy-Tailed Noise [49.730496294398726]
  We develop a novel quantum mean estimator for heavy-tailed random variables.<n>We derive stronger lower bounds for tail index>4/3$, showing that a nontrivial dependence on a dimension is unavoidable.<n>For a convex objective function, we propose a quantum projected gradient descent method.
  arXiv  Detail & Related papers  (2026-07-28T09:29:37Z)
• Diagnosing quantum reservoirs at scale based on expressivity and coverage [42.138439537056954]
  Quantum reservoirs offer a hardware-friendly route to quantum machine learning.<n>Because the reservoir is not optimized, performance depends entirely on the choice of reservoir family.<n>We introduce a scalable, hardware-agnostic framework built on two complementary quantities.
  arXiv  Detail & Related papers  (2026-07-10T14:16:13Z)
• Complexity of tensor network simulation for noisy quantum circuits [2.8523943706562633]
  Local noise affects classical simulability of quantum dynamics benchmarked by tensor-network methods.<n>We prove the following: For single-qubit depolarizing noise on arbitrary circuits, tensor networks with $mathrmpoly(n)$ bond dimension suffice for fixed absolute Hilbert-Schmidt error after $order1$ depth.<n>In higher dimensions, these bounds yield uniform-in-depth $mathrmpoly(n)$ average boundary-bond dimensions for projected entangled pair operators(PEPO) across every cut.
  arXiv  Detail & Related papers  (2026-05-30T01:42:33Z)
• Adiabatic Quantum Phase Estimation [47.3103723337301]
  Quantum phase estimation (QPE) is a central algorithmic primitive that estimates eigenvalues of a Hamiltonian up to precision $$ in Heisenberg-limited time $T= (1/)$.<n>Standard gate-based implementations of QPE require deep controlled time-evolution circuits and are not native to analog hardware.<n>We present a simple adiabatic protocol for QPE that achieves the optimal Heisenberg-limited scaling $T = Oleft( frac1 logleft(-1right)right)$ in both the precision $$
  arXiv  Detail & Related papers  (2026-05-21T17:31:36Z)
• Precision limits for time-dependent quantum metrology under Markovian noise [0.0]
  We derive ultimate precision bounds for estimating parameters encoded in emphtime-dependent Hamiltonians in the presence of general Markovian noise.<n>We illustrate these behaviors on paradigmatic driven-qubit sensors, exhibiting $T4$ and $T3$ scalings under dephasing and spontaneous emission.
  arXiv  Detail & Related papers  (2026-05-18T13:39:22Z)
• Wavelet Variance Equipartition as a Threshold for World-Model Quality and Quantum Kernel TN-Simulability [0.0]
  We identify the wavelet scaling exponent $$ as a critical diagnostic.<n>We establish $= 1/2$ as a sharp transition boundary for the classical simulability of amplitude-encoded quantum kernels.<n>We prove this variance scales strictly as $Var[X] = (d-2)$.
  arXiv  Detail & Related papers  (2026-05-12T05:41:12Z)
• Blind Catalytic Quantum Error Correction: Target-State Estimation and Fidelity Recovery Without \textit{A Priori} Knowledge [0.0]
  We introduce emphblind CQEC, which estimates the target from the noisy output alone before catalytic recovery.<n>Five estimation strategies are benchmarked across three noise models.
  arXiv  Detail & Related papers  (2026-04-13T08:27:08Z)
• Quantum Reservoir Autoencoder for Blind Decryption: Two-Phase Protocol and Noise Resilience [0.0]
  We instantiate the quantum reservoir autoencoder (QRA) with a noise-induced reservoir employing reset noise channels.<n>For a single-ciphertext protocol with 10 data qubits and random (non-optimized) reset probabilities, the open-system reservoir suppresses shot-noise sensitivity by ten orders of magnitude.
  arXiv  Detail & Related papers  (2026-03-12T07:05:46Z)
• Unsupervised Discovery of Intermediate Phase Order in the Frustrated $J_1$-$J_2$ Heisenberg Model via Prometheus Framework [0.0]
  We apply the Prometheus variational autoencoder framework to explore the $J_1$-$J$ phase diagram.<n>We identify the structure factor $S(,)$ and $S(,)$ as the dominant order parameters.<n>This work establishes a scalable pathway for applying machine learning to frustrated quantum systems.
  arXiv  Detail & Related papers  (2026-02-25T00:44:51Z)
• The role of shared randomness in quantum state certification with unentangled measurements [36.19846254657676]
  We study quantum state certification using unentangled quantum measurements. $Theta(d2/varepsilon2)$ copies are necessary and sufficient for state certification. We develop a unified lower bound framework for both fixed and randomized measurements.
  arXiv  Detail & Related papers  (2024-01-17T23:44:52Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Normalized/Clipped SGD with Perturbation for Differentially Private Non-Convex Optimization [94.06564567766475]
  DP-SGD and DP-NSGD mitigate the risk of large models memorizing sensitive training data. We show that these two algorithms achieve similar best accuracy while DP-NSGD is comparatively easier to tune than DP-SGD.
  arXiv  Detail & Related papers  (2022-06-27T03:45:02Z)
• Random quantum circuits transform local noise into global white noise [118.18170052022323]
  We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime. For local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution $p_textnoisy$ of a generic noisy circuit instance shrink exponentially. If the noise is incoherent, the output distribution approaches the uniform distribution $p_textunif$ at precisely the same rate.
  arXiv  Detail & Related papers  (2021-11-29T19:26:28Z)

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.