Analytic properties of cross-click operators in passive multi-basis photodetection: monotonicity, exact convergence rates, and dimension reduction for quantum key distribution

• URL: http://arxiv.org/abs/2607.04186v1
• Date: Sun, 05 Jul 2026 09:15:41 GMT
• Title: Analytic properties of cross-click operators in passive multi-basis photodetection: monotonicity, exact convergence rates, and dimension reduction for quantum key distribution
• Abstract summary: Cross-click operators, the POVM elements for simultaneous clicks in detectors assigned to different measurement bases, are used in QKD and entanglement-verification analyses.<n>This work gives an analytic characterization for passive linear-optical analyzers with arbitrary efficiency mismatch and dark counts.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Cross-click operators, the POVM elements for simultaneous clicks in detectors assigned to different measurement bases, are used in QKD and entanglement-verification analyses with realistic threshold detectors to bound multiphoton contributions. Earlier applications verified the needed growth of the minimum eigenvalue $f^{(n)}$ on the $n$-photon subspace only numerically over finite sectors. This work gives an analytic characterization for passive linear-optical analyzers with arbitrary efficiency mismatch and dark counts. The key observation is that every silence operator is the second quantization $Γ(A)$ of an explicit single-photon contraction $A$, whose $n$-photon restriction is $A^{\otimes n}$ on $\mathrm{Sym}^n$. This yields: (i) monotonicity $f^{(n+1)}\ge f^{(n)}$; (ii) two-sided exponential bounds $\max_b γ_b|A_b|^n \le 1-f^{(n)} \le \sum_b γ_b|A_b|^n$, which determine the exact asymptotic convergence rate from single-photon spectral data; (iii) for ideal detectors and $n\ge1$, the exact formula $f^{(n)}=1-\sum_b p_b^n$; and (iv) an exact factorization $1-f^{(n_A,n_B)}=(1-f_A^{(n_A)})(1-f_B^{(n_B)})$ for the two-party cross-click operator. The results apply to polarization, time-bin, and spatial-mode analyzers within the stated threshold-detector model. As an application, we obtain closed-form photon-number weight bounds used in detection-efficiency-mismatch analyses, replacing finite-sector Fock-space numerics by formulas valid for all photon numbers.

Related papers

• Heralded one-, two- and three-photon states from waveguided parametric down-conversion [0.0]
  manifold coincidences and singles counting provides a resource-saving quantum-optics analysis tool.<n>We show that the single-click probability is a versatile tool for extracting the state's mean photon number.<n> normalized photon correlations provide an expedient method for examining the higher-order non-classicality of light.
  arXiv  Detail & Related papers  (2026-09-03T08:42:39Z)
• 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)
• Ancilla-Depth Phase Diagrams for Quantum Reference-Frame Comparison [0.0]
  For finite-dimensional channels A and B with invertible A, we show that exact simulation of all measurements assisted by an r-dimensional ancilla is equivalent to r-positivity of the unique factor Gamma = BA-1.<n>Results quantify the distinction between ancilla-restricted statistical simulation and implementation by a single quantum channel.
  arXiv  Detail & Related papers  (2026-07-14T16:35:26Z)
• Number Fluctuations and Entanglement-Spectrum Participation in Monitored Free Fermions [0.0]
  On finite system sizes, monitored one-dimensional free-fermion chains display a broad crossover in entanglement scaling.<n> Analytical field theory and recent large-scale simulations indicate that this apparent change is not a finite-rate transition in the thermodynamic limit.
  arXiv  Detail & Related papers  (2026-07-08T21:59:44Z)
• Statistical inverse learning and $\ell^1$-regularization [0.27998963147546135]
  We study the recovery of sparse functions from finite, noisy, and indirect observations in the framework of statistical inverse learning.<n>We establish almost-sure exponents and derive non-asymptotic high-probability convergence rates in both prediction and $ell1$ reconstruction norms.
  arXiv  Detail & Related papers  (2026-07-08T14:32:08Z)
• Quantum Multi-Level Estimation of Functionals of Discrete Distributions [23.53427184324404]
  We propose a quantum multi-level estimation framework for a functional $sum_i=1n f(p_i)$ of a discrete distribution.<n>We present efficient quantum estimators for the $q$-Tsallis entropy of discrete distributions.
  arXiv  Detail & Related papers  (2026-05-05T12:25:17Z)
• Coherence-gated quantum devices via real-time weak measurement [0.0]
  Single-photon routers in cavity and circuit QED direct photons based on which eigenstate a qubit occupies.<n>We propose emphcoherence-gated routing, where the routing decision depends on the magnitude of quantum coherence.
  arXiv  Detail & Related papers  (2026-04-20T12:19:54Z)
• Optimal Scalar Quantization for Matrix Multiplication: Closed-Form Density and Phase Transition [50.36362492608702]
  We study entrywise scalar quantization of two matrices prior to multiplication.<n>We obtain a closed-form optimal point density [ star(u) propto exp!left(-fracu26right)bigl( (1-2)+2u22bigr), qquad u=fracx_X,, and prove a correlation-driven phase transition.
  arXiv  Detail & Related papers  (2026-03-20T01:53:44Z)
• Spectral Gaps with Quantum Counting Queries and Oblivious State Preparation [47.600794349481966]
  In this work, we present a quantum algorithm which approximates values up to additive error $epsilonDelta_k$ using a logarithmic number of qubits.<n>A key technical step in the analysis is the preparation of a suitable random initial state, which ultimately allows us to efficiently count the number of eigenvalues that are smaller than a threshold.
  arXiv  Detail & Related papers  (2025-08-28T17:04:18Z)
• Effective eigenvalue approximation from moments for self-adjoint trace-class operators [0.0]
  We define a set $Lambda_nsubset mathbbR$ for each self-adjoint, trace-class operator $O$.<n>We show that it converges to the spectrum of $O$ in the Hausdorff metric under mild conditions.<n>Results can be directly applicable to problems in quantum information, statistical mechanics, and quantum thermodynamics.
  arXiv  Detail & Related papers  (2024-07-05T12:56:20Z)
• Neural network learns low-dimensional polynomials with SGD near the information-theoretic limit [75.4661041626338]
  We study the problem of gradient descent learning of a single-index target function $f_*(boldsymbolx) = textstylesigma_*left(langleboldsymbolx,boldsymbolthetarangleright)$<n>We prove that a two-layer neural network optimized by an SGD-based algorithm learns $f_*$ with a complexity that is not governed by information exponents.
  arXiv  Detail & Related papers  (2024-06-03T17:56:58Z)
• Learning with Norm Constrained, Over-parameterized, Two-layer Neural Networks [54.177130905659155]
  Recent studies show that a reproducing kernel Hilbert space (RKHS) is not a suitable space to model functions by neural networks. In this paper, we study a suitable function space for over- parameterized two-layer neural networks with bounded norms.
  arXiv  Detail & Related papers  (2024-04-29T15:04:07Z)
• A Unified Framework for Uniform Signal Recovery in Nonlinear Generative Compressed Sensing [68.80803866919123]
  Under nonlinear measurements, most prior results are non-uniform, i.e., they hold with high probability for a fixed $mathbfx*$ rather than for all $mathbfx*$ simultaneously. Our framework accommodates GCS with 1-bit/uniformly quantized observations and single index models as canonical examples. We also develop a concentration inequality that produces tighter bounds for product processes whose index sets have low metric entropy.
  arXiv  Detail & Related papers  (2023-09-25T17:54:19Z)
• Maximizing the Validity of the Gaussian Approximation for the biphoton State from Parametric Downconversion [0.0]
  We present a choice of $alpha$ which maximizes the validity of the Gaussian approximation. We also discuss the so-called textitsuper-Gaussian and textitcosine-Gaussian approximations as practical alternatives.
  arXiv  Detail & Related papers  (2022-10-05T15:47:04Z)
• Near-optimal fitting of ellipsoids to random points [68.12685213894112]
  A basic problem of fitting an ellipsoid to random points has connections to low-rank matrix decompositions, independent component analysis, and principal component analysis. We resolve this conjecture up to logarithmic factors by constructing a fitting ellipsoid for some $n = Omega(, d2/mathrmpolylog(d),)$. Our proof demonstrates feasibility of the least squares construction of Saunderson et al. using a convenient decomposition of a certain non-standard random matrix.
  arXiv  Detail & Related papers  (2022-08-19T18:00:34Z)
• Distinguishability in quantum interference with the squeezed states [0.0]
  entanglement of photon pairs over the Schmidt modes is one of the sources of distinguishability. The distinguishability is quantified by the symmetric part of the internal state of $n$ pairs of photons.
  arXiv  Detail & Related papers  (2021-09-04T12:42:38Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

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.