Quantum Networkpowered by
searchSubscribe
Quantum Network

News, research, careers and the quantum industry, in one place.

  • alternate_email
  • search

Explore

  • Editorial
  • Research Hub
  • Events
  • Opportunities
  • About Us

Community

  • Join the Community
  • Learning Resources
  • Contact Us

Contact

A-307, Kailash Business Park,
Vikhroli (W), Mumbai – 400079

022 49646504

[email protected]

  • Newsletter
  • India Quantum Pulse
Quantum Networkpowered by
searchSubscribe
RESEARCH·Sep 16, 2026·2 MIN READ

Adaptive detection of Rabi signals under composite hypotheses

arXiv:2609.16119v1 Announce Type: new Abstract: Motivated by searches for weak coherent drives, we formulate repeated quantum sensing with a fixed shot budget as an asymmetric composite hypothesis test. Taking Rabi sensing as a concrete example, we benchmark detection power, sensitivity, and Type-II error exponents in the resonant case with unknown signal amplitude and phase. We compare non-adaptive population and transverse readouts with a myopic Bayesian policy that selects each projective...

Source

arXiv

Author: So Chigusa

Published Sep 16, 2026

Summarised/rewritten with AI from arXiv

Read original articlearrow_forward

arXiv:2609.16119v1 Announce Type: new Abstract: Motivated by searches for weak coherent drives, we formulate repeated quantum sensing with a fixed shot budget as an asymmetric composite hypothesis test. Taking Rabi sensing as a concrete example, we benchmark detection power, sensitivity, and Type-II error exponents in the resonant case with unknown signal amplitude and phase. We compare non-adaptive population and transverse readouts with a myopic Bayesian policy that selects each projective axis by maximizing the expected information gain in one step. The common decision statistic is a log Bayes factor, with a policy specific threshold calibrated under the null to enforce a common Type-I error. A weak signal expansion shows that population readout is phase independent but quadratic in amplitude, giving $n^{-1/4}$ sensitivity, whereas transverse readout is linear in amplitude and permits $n^{-1/2}$ sensitivity without adaptation, but is phase-dependent. In Monte Carlo pseudoexperiments, the adaptive policy exploits posterior information about the unknown direction to guide subsequent readouts; its sensitivity is consistent with $n^{-1/2}$ over the simulated large $n$ range and, at the largest simulated shot counts, outperforms the fixed transverse schedules. Its phase-averaged effective Type-II exponent also exceeds the non-adaptive references over the simulated range. These results demonstrate the finite budget value of exploiting nuisance parameter information under calibrated false positive control.

QUANT-PHHEP-PHSIMULATIONSOFTWAREPOLICY

Report a problem / takedown

ABOUT THIS STORY

Source
arXiv
Published
Sep 16, 2026
Category
RESEARCH
Read original articlearrow_forward

More from Quantum Network

RESEARCH

Polynomial-Time Classical Simulation of BosonSampling under Any Constant-Fraction Photon Loss

Understanding how photon loss changes the classical complexity of BosonSampling is central to assessing the robustness of near-term photonic quantum advantage. In this work, we present a polynomial-time classical simulation algorithm for lossy BosonSampling that applies whenever a constant fraction of the input photons survives. We consider the standard fixed-loss model, where $N$ input photons propagate through an $M$-mode interferometer and ex...

Oct 21, 2026

arrow_forward
Concurrent Entanglement Purification Scheduling in Dynamic Quantum Networks
RESEARCH

Concurrent Entanglement Purification Scheduling in Dynamic Quantum Networks

Quantum networks must deliver end-to-end entanglement whose fidelity meets application requirements, which typically requires entanglement purification along multi-hop paths. Existing scheduling approaches either purify at the link level or optimize end-to-end fidelity for a static set of requests, and do not capture concurrent requests competing for network resources over time. This paper studies concurrent entanglement purification scheduling...

Oct 21, 2026

arrow_forward
Typical Superpositions are Magical
RESEARCH

Typical Superpositions are Magical

The non-stabilizerness, or "magic", of a quantum state is a common metric for the hardness of simulation on a classical computer, and is often quantified by the stabilizer R\'enyi entropy (SRE). We show how random superpositions of classically simulable states saturate the SRE to the symmetry-restricted Haar-random maximum. For any large-$N$ random pure-state ensemble satisfying the conditions of Schur's lemma, the average SRE of the $m$-compone...

Oct 19, 2026

arrow_forward
Resonant pair production and flat band melting in a driven Rydberg chain
RESEARCH

Resonant pair production and flat band melting in a driven Rydberg chain

We study a Rydberg chain subjected to a two-tone periodic drive of the detuning $\Delta(t)$ and Rabi frequency $\Omega(t)$ at frequencies $\omega_1$ and $\omega_2=\nu \omega_1$ respectively with $\nu \in \mathbf{Z}$. In the strong Rydberg blockade limit, such a system reduces to the PXP model and exhibits exact Floquet flat band. Here we determine, using a time-dependent Schrieffer-Wolff transformation, the domain of validity of such PXP dynamic...

Oct 19, 2026

arrow_forward
Quantum Network

News, research, careers and the quantum industry, in one place.

  • alternate_email
  • search

Explore

  • Editorial
  • Research Hub
  • Events
  • Opportunities
  • About Us

Community

  • Join the Community
  • Learning Resources
  • Contact Us

Contact

A-307, Kailash Business Park,
Vikhroli (W), Mumbai – 400079

022 49646504

[email protected]

  • Newsletter
  • India Quantum Pulse