Entanglement’s Achilles’ Heel: Are Bell Tests Truly Quantum?

A new analysis reveals that violations of Bell inequalities, long considered proof of quantum entanglement, may be replicated by alternative, non-quantum models.

A new analysis reveals that violations of Bell inequalities, long considered proof of quantum entanglement, may be replicated by alternative, non-quantum models.
A novel algebraic construction using dyadic matrices enhances the performance of quantum low-density parity-check codes for reliable quantum communication.
A new approach to post-quantum cryptography leverages the NTRU lattice to deliver efficient key expansion and anonymous credentials for a privacy-focused digital world.
A new approach efficiently reconstructs polynomials from imprecise data in finite fields, offering improvements in data reliability and computational speed.
![The relationship between phase lifetime ([latex] PLP_L [/latex]) and anisotropy strength (β) is explored for the [latex] \llbracket 162,2,9\rrbracket [/latex] Toric code, demonstrating how these parameters influence the system’s stability.](https://arxiv.org/html/2601.07240v1/x2.png)
A new approach to quantum error correction utilizes directional priors to improve decoding performance without modifying code structure.
![A secure storage scheme distributes three files across eight servers in such a way that designated pairs of servers can reliably retrieve specific files, achieving a source key capacity of [latex]\frac{1}{2}[/latex] as theoretically established and demonstrably constructed-a configuration pushing the boundaries of data redundancy and access control.](https://arxiv.org/html/2601.07340v1/fig0.png)
New research explores the fundamental limits of secure data storage across interconnected networks, revealing how graph topology affects the achievable key rates for protecting sensitive information.

New research explores how large language models can be trained to identify critical security vulnerabilities in smart contracts, even with limited data.
A new mathematical bridge links the structure of error-correcting codes to the combinatorics of integer partitions, offering fresh insights into code design.
A new approach to function-correcting codes leverages domain partitioning to reduce redundancy and improve communication efficiency for multiple recipients.
A new review explores how to securely synchronize FIDO2 credentials across multiple devices without compromising hardware-based security.