6120 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 presents a hybrid adiabatic algorithm for the maximum independent set problem using Rydberg atom arrays, where engineered local controls targeting low-degree nodes significantly accelerate convergence, suppress trap states, and improve success probabilities compared to traditional global controls.
This paper introduces DQI-Kit, a software framework designed to automatically transform constrained optimization problems into the Max-LINSAT format required by Decoded Quantum Interferometry (DQI), thereby analyzing transformation overheads and facilitating the identification of practical use cases for quantum advantage.
This paper demonstrates that in the nonlinear Jaynes-Cummings model, the robustness of geometric phases and entanglement against dissipation relies not merely on resonance or geodesic evolution, but on a dynamically enabled mechanism where environmental protection emerges only when dissipative trajectories align with and preserve the structure of the underlying unitary dynamics.
This paper introduces *quantum-safe*, a hybrid-by-default Python cryptography library that bridges the post-quantum production gap by achieving full coverage across eight critical readiness dimensions, significantly reducing implementation complexity and overhead while providing the first statistically rigorous performance and timing side-channel analysis of a Python-based PQC ecosystem.
This paper introduces a provably convergent variational compression method with a specific initialization recipe that guarantees near-optimal gate complexity for simulating local, translationally invariant Hamiltonians, successfully demonstrated on a 48-site Kagome lattice Heisenberg antiferromagnet to enable quantum simulations beyond classical capabilities.
This paper employs a heat-kernel approach to derive a covariant expansion of the nonlocal effective action for a massless scalar field on a flat manifold with a curved boundary, extending previous results to general surfaces and applying the framework to calculate particle-creation rates for oscillating deformed geometries in 2+1 and 3+1 dimensions.
This paper presents a quantum-assisted Support Vector Machine (QSVM) bagging ensemble that leverages quantum annealing to optimize support vectors for near-real-time marine oil spill detection in SAR imagery, achieving performance comparable to classical baselines with an IoU of 0.60 and demonstrating feasibility for efficient, transferable environmental monitoring.
This topical review provides a unified perspective on the computationally intractable but optimal Maximum Likelihood Decoding (MLD) of quantum error correction codes by surveying recent advances through the complementary lenses of statistical mechanics, tensor networks, and artificial intelligence, while discussing their connections, applications, and future challenges.
This paper establishes that the distance from random short ring elements to the log-unit lattice of converges to a specific constant times , proving that structured targets lie within the Voronoi cell of the origin and enabling a reduction of the CDPR approximation factor for ML-KEM from exponential to sub-polynomial.
This paper presents a polynomial-time quantum attack that breaks standardized ML-KEM, Falcon, Hawk, and NTRU schemes over 2-power cyclotomic rings by utilizing a tower decomposition of the Principal Ideal Problem to achieve a high success probability with a verified approximation factor.