Sharp copy-complexity bounds for noisy quantum purity testing, revealing an exponential advantage of collective measurements over adaptive two-copy strategies.
-
Updated
Nov 8, 2026 - Python
Sharp copy-complexity bounds for noisy quantum purity testing, revealing an exponential advantage of collective measurements over adaptive two-copy strategies.
Classical optimality of uniform quantum reward certification under collective measurements.
Quantum illumination with unknown noisy idler memory, exact conditional detection and fully charged calibration resources.
Quantum resolution for moving incoherent sources with known photon timing, independent jitter and finite calibration.
Collective quantum purity testing under source noise: a general channel bound and an exact logarithmic noise budget for polynomial learnability.
Known-state quantum certification under noisy local readout: adaptive sample-complexity bounds, a sharp binary exponent, and fidelity noise thresholds.
To associate your repository with the quantum-hypothesis-testing topic, visit your repo's landing page and select "manage topics."