Coherence-gated quantum devices via real-time weak measurement

• URL: http://arxiv.org/abs/2604.18662v1
• Date: Mon, 20 Apr 2026 12:19:54 GMT
• Title: Coherence-gated quantum devices via real-time weak measurement
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Single-photon routers in cavity and circuit QED direct photons based on which energy eigenstate a qubit occupies -- a projective decision that destroys coherence. We propose \emph{coherence-gated routing}, where the routing decision depends on the magnitude of quantum coherence, estimated in real time from simultaneous weak measurements of $σ_x$ and $σ_z$. A photon is accepted depending on whether $S(T) = \sqrt{\langleσ_x\rangle_c^2 + \langleσ_y\rangle_c^2}$ exceeds a tunable threshold~$S_{\mathrm{th}}$. Because coherence is certified at emission, the protocol enables two applications beyond conventional heralded sources: (i)~a quantum random number generator with min-entropy bounded by Bloch-sphere geometry, $H_\infty \geq -\log_2\bigl(\frac{1+\sqrt{1-S_{\mathrm{th}}^2}}{2}\bigr)$, and (ii)~a phase-tracked photon source where independent certification at two nodes bounds the matter-matter entanglement fidelity after Bell-state measurement. The real-time estimator is a security primitive, not merely a numerical tool. We benchmark seven configurations across 3000 trajectories and show that deliberately underestimating detector efficiency ($η_{\mathrm{a}} < η_{\mathrm{true}}$) simultaneously stabilizes the numerics and suppresses overcertification. We trace this analytically through a purity monotonicity result, identify a geometric loophole amplifying purity undercertification into coherence overcertification by~$45\times$, and develop two pointwise bounds: an Ornstein-Uhlenbeck comparison yielding $4.5\%$ operational overcertification (validated at $3.6\%$ from $10^6$ trajectories), and an exponential supermartingale establishing an exponential tail. The gap -- a single polynomial optimization -- defines a path to fully composable security.

Related papers

• From Approachability Residuals to Anytime-Valid Evidence: The Online Convex Geometry of Testing by Betting [0.1624454100511275]
  Gambling-based sequential tests and Blackwell approachability are linked by a rate-explicit reduction through support-functions.<n>We prove the exact pathwise identity $$ dist(bar r_T,S) =frac1Tsum_t=1Tq_t+fracReg_TT.
  arXiv  Detail & Related papers  (2026-08-10T11:23:30Z)
• 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)
• 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)
• 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)
• Quantum Phaselift [0.0]
  We introduce a lifting-based framework that estimates the rank-one matrix $Z = f fdagger$ rather than estimating $f$ directly.<n>We prove that a $O(1)$ bandwidth suffices for generic signals, leading to substantial savings in controlled operations.<n>We numerically demonstrate that high-quality recovery is possible for the 2D Fermi-Hubbard and 2D transverse-field Ising model signals of size exceeding 100 time points.
  arXiv  Detail & Related papers  (2026-02-09T19:09:57Z)
• Slow Mixing of Quantum Gibbs Samplers [47.373245682678515]
  We present a quantum generalization of these tools through a generic bottleneck lemma.<n>This lemma focuses on quantum measures of distance, analogous to the classical Hamming distance but rooted in uniquely quantum principles.<n>We show how to lift classical slow mixing results in the presence of a transverse field using Poisson Feynman-Kac techniques.
  arXiv  Detail & Related papers  (2024-11-06T22:51:27Z)
• 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)
• The Cost of Entanglement Renormalization on a Fault-Tolerant Quantum Computer [0.042855555838080824]
  We perform a detailed estimate for the prospect of using deep entanglement renormalization ansatz on a fault-tolerant quantum computer. For probing a relatively large system size, we observe up to an order of magnitude reduction in the number of qubits. For estimating the energy per site of $epsilon$, $mathcalOleft(fraclog Nepsilon right)$ $T$ gates and $mathcalOleft(log Nright)$ qubits suffice.
  arXiv  Detail & Related papers  (2024-04-15T18:00:17Z)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)
• 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)
• Differentially Quantized Gradient Methods [53.3186247068836]
  We show that Differentially Quantized Gradient Descent (DQ-GD) attains a linear contraction factor of $maxsigma_mathrmGD, rhon 2-R$. No algorithm within a certain class can converge faster than $maxsigma_mathrmGD, 2-R$.
  arXiv  Detail & Related papers  (2020-02-06T20:40:53Z)
• Approximate unitary $t$-designs by short random quantum circuits using nearest-neighbor and long-range gates [0.0]
  We prove that $poly(t)cdot n1/D$-depth local random quantum circuits with two qudit nearest-neighbor gates are approximate $t$-designs in various measures. We also prove that anti-concentration is possible in depth O(log(n) loglog(n) using a different model.
  arXiv  Detail & Related papers  (2018-09-18T22:28:15Z)

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.