Quantum sieve catches one-in-a-million glitches ⚡ экспресс

Picking out a single faulty microchip from a million, without any clue what the fault looks like, is a classic needle-in-a-haystack problem. A classical computer would test each chip one by one. A quantum computer acts like a self-adjusting colander: you pour in the whole batch, and only the rare, defective ones light up—no prior description required. The trick lies in entropy (the randomness woven into all data). Where classical methods get swamped by noise, quantum bits (qubits) ride that randomness to amplify the faintest anomalies.

Long ago, Richard Feynman envisioned quantum machines, and David Deutsch proved they could tackle tasks beyond classical reach. The new algorithm harnesses this heritage. It finds the barely-there: a tiny dip in starlight betraying an exoplanet (world orbiting another star) via the transit method of photometry (measuring light dips), or a subtle pattern foreshadowing a market crash. In particle physics, it might catch a rare decay predicted by the standard model (theory of fundamental particles) or a ghostly dark matter interaction.

The surprise: the algorithm doesn’t just spot needles in haystacks—it spots needles it has never seen, reliably outperforming classical computers in precisely the blind-searching scenarios that matter most.