11047 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 demonstrates a field-deployed, quantum-secure network in Thuringia, Germany, that successfully integrates entanglement-based Quantum Key Distribution (QKD) with Post-Quantum Cryptography (PQC) over 140 km of heterogeneous fiber to enable autonomous, real-world telemedicine transmission without modifying existing medical infrastructure.
This paper introduces a global normalization condition to frame Matrix Product States as quantum states for machine learning and compares the effectiveness of gradient descent versus an adapted Density Matrix Renormalization Group (DMRG) algorithm for optimizing the resulting tensor network.
This paper presents a universal protocol for noiseless quantum sensing that utilizes light-driven non-equilibrium criticality in an atomic ensemble to achieve a 3.3 dB metrological gain over the standard quantum limit by engineering a regime where signal susceptibility diverges while quantum noise periodically recedes.
This paper presents a highly scalable, ultra-bright single-pass Type-II KTP waveguide source that generates single-mode squeezed vacuum states with a mode number of 1.24 at 1546 nm, alongside a comprehensive theoretical framework for characterizing its performance in hybrid quantum photonic architectures.
This thesis establishes the high resilience of fracton-based quantum error-correcting codes by utilizing statistical-mechanical mappings and Kramers-Wannier-type dualities to analyze classical Ising models, ultimately determining that the Checkerboard code achieves the theoretical maximum error threshold for three-dimensional CSS codes.
This paper introduces Bernstein-Vazirani Networks (BVNs), a non-variational, gradient-free quantum machine learning framework that utilizes quantum interference in Fourier or problem-adapted bases to achieve universal function approximation and strong generalization on vision and representation learning tasks.
This paper establishes an information-theoretic bound showing that the probability of two non-communicating parties correctly predicting a shared random parity from a bipartite encoding is limited by their local recovery probability, a result motivated by applications in unclonable encryption and quantum copy-protection.
This paper demonstrates that coherent quantum transport on percolated hierarchical small-world networks exhibits a non-monotonic dependence on connectivity, where an intermediate bond probability maximizes transport efficiency due to a competition between shortcut-assisted spreading and interference-induced recirculation, contrasting with the monotonic improvement seen in classical transport.
This paper investigates the limitations and advantages of exact and approximate entanglement batteries and catalysts in local state discrimination, establishing a cardinality constraint for perfect discrimination of orthogonal pure bipartite states while demonstrating significant advantages in distinguishing specific sets, particularly those derived from many-copy indistinguishable ensembles.
This paper settles a fundamental conjecture in quantum complexity theory by proving that parallel -query, -round quantum algorithms can be simulated on most inputs by classical algorithms with queries, thereby demonstrating that superpolynomial quantum speedups for unstructured problems necessitate superconstant circuit depth.