11028 papers
Quantum physics explores the strange and often counterintuitive rules that govern the universe at its smallest scales. This field investigates how particles like electrons and photons behave in ways that defy our everyday intuition, forming the backbone of modern technologies from lasers to future quantum computers. While the mathematics can be daunting, the core ideas promise to revolutionize how we understand reality and process information.
At Gist.Science, we make these complex discoveries accessible to everyone. We systematically process every new preprint published in the Quant-Ph category on arXiv, transforming dense academic papers into clear, plain-language explanations alongside detailed technical summaries. Whether you are a seasoned researcher or a curious reader, our goal is to bridge the gap between cutting-edge theory and human understanding.
Below are the latest papers in quantum physics, distilled to help you grasp the newest breakthroughs without getting lost in the jargon.
This paper introduces TandemQEC, a system-level simulator that models the interplay between quantum error correction schedules, classical decoding resources, and hardware constraints to demonstrate that balanced joint provisioning of decoder capacity and bandwidth is essential for achieving significant performance gains in fault-tolerant quantum applications.
This paper demonstrates that for bounded-degree directed graphs, any property testable with constant quantum queries in the bidirectional model can be tested in the unidirectional model using queries, achieving an almost quadratic quantum speedup over classical methods while proving this transformation is essentially tight.
This paper completely characterizes the optimal emulation rates between idempotent quantum channels across unassisted, shared randomness, and shared entanglement regimes, revealing that while the first two regimes yield a single-letter capacity governed by shape vectors with no reversibility, the entanglement-assisted regime achieves exact, reversible emulation determined by the -norm of the shape vector.
This paper introduces a comprehensive toolset of generic compilers and technical lemmata that leverage classical functional encryption and one-way functions to achieve collusion-resistant and multi-copy security for various unclonable cryptographic primitives, including the first constructions of public-key quantum coins, multi-copy secure encryption, and secure key leasing with a classical vendor.
This paper introduces a streamlined geometric procedure for quantum weight reduction that transforms arbitrary quantum codes into low-weight variants with optimal parameters, surpassing the square-root distance barrier for random dense CSS codes and improving fault-tolerant logical-operator measurements.
This paper presents an end-to-end quantum approximate optimisation algorithm for discrete global minimum variance portfolio optimisation, demonstrating that while current thermal relaxation noise precludes quantum advantage, future hardware improvements could enable a favourable scaling in measurement shots required to find the global minimum.
This paper demonstrates that fusing observational and interventional datasets from quantum experiments can reveal a form of non-classicality that is intrinsic to the data fusion process itself, enabling the detection of quantum signatures in scenarios where standard Bell inequality violations are impossible.
This paper demonstrates a new form of quantum nonclassicality arising from causal data fusion, where observational and interventional data individually admit classical explanations but cannot be jointly reproduced by any single classical causal model.
This paper resolves an open question by constructing a classical oracle that separates QCMA from ClonableQMA, thereby demonstrating that quantum proofs can be more powerful than classical ones even when the quantum proofs are clonable.
This paper introduces WLPA, an efficient algorithmic framework that optimally allocates scarce quantum-safe resources across network links by explicitly addressing the weakest-link exposure problem, demonstrating that traditional per-link heuristics fail under variable costs or targeted attacks while WLPA achieves near-instantaneous, provably optimal assignments validated through extensive simulations and real-world hardware tests.