New Bell inequalities help multiple parties share secret keys securely despite noisy devices.

Multiple distant users want to share a secret security key without trusting their physical devices. This is device-independentdevice-independentSecurity guaranteed without trusting the internal workings of devices, based solely on observed correlations. conference key agreement. It promises total security as long as the hardware passes a quantum test known as violating a Bell inequalityBell inequalityA mathematical test that can distinguish quantum correlations from classical ones, used to verify device behavior.. The problem is that current real-world setups struggle to pass this test unless their detectors are nearly perfect. To solve this, researchers designed a new family of math rules called asymmetric parity-Clauser-Horne-Shimony-Holt (CHSH) inequalities. They paired these tests with a technique called noisy preprocessingnoisy preprocessingIntentionally adding noise to data before analysis to improve robustness against errors., which scrambles raw data to confuse eavesdroppers. They proved that combining this new inequality with noisy preprocessing significantly improves the system's robustness against detector flaws and random quantum noise.

Why it matters

This makes secure communication networks more practical by allowing groups to share secret keys without trusting the devices they use, which often have real-world imperfections.

Questions answered