A mathematical advance in how quantum entanglement is verified could make a direct difference to the banks and telecoms already building quantum-secure networks. On July 16, Alexey Rastegin of Kaliningrad State Technical University published a paper in the Proceedings of the Royal Society showing that a class of symmetric quantum measurements called conical two-designs dramatically reduces the computational cost of checking whether a system is genuinely entangled [1]. Three days earlier (July 13,2026), a separate team described running entanglement-based encryption between two live financial data centres for four consecutive months [2]. The timing is coincidental but the connection is not.
Rastegin's work focuses on Kirkwood-Dirac quasiprobabilities, a mathematical framework that represents quantum states using values that can go negative, something impossible in classical probability. That negativity is a reliable fingerprint of quantum behaviour. The paper shows that when a measurement is structured as a conical two-design, the Hilbert-Schmidt norm of the KD quasiprobability matrix can be evaluated directly from just two constants, rather than computed element by element. Related work by Katarzyna Siudzinska at Nicolaus Copernicus University has confirmed that those same two constants are enough to characterise entanglement witnesses, quantum coherence, and uncertainty relations across the board [3].
The practical significance lands where the money is. The July 13 deployment paper describes an entanglement-based quantum key distribution system, built by zerothird GmbH and Austrian research partners, that ran between two operational data centres of a financial institution over 22 kilometres of standard fibre. It produced secure encryption keys at 63.8 kilobits per second and fed them straight into a VPN tunnel through a commercial key management system, achieving 93.7 per cent uptime with a quantum bit error rate below 2 per cent for nearly all of that time.
That system, and others like it, relies on being able to confirm that the entanglement it produces is real. An adversary who could substitute classical correlations for genuine quantum entanglement would undermine the entire security guarantee. Right now, that verification does not scale cheaply. Rastegin's result suggests it could. IBM has said it expects the first verified demonstrations of quantum advantage by the end of this year, with fault-tolerant quantum computing targeted for 2029 [4]. As the number of qubits grows, so does the cost of proving those qubits are actually entangled and not just noisy. A framework that compresses that proof into two numbers is not an abstraction. It is infrastructure.