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 presents a unified framework that upgrades a broad class of cryptographic primitives to support constant-rate certified deletion in the plain model without additional assumptions, achieving the first such constructions that preserve everlasting security and enable public verifiability under standard hardness assumptions.
This paper extends the EXAQC evolutionary framework to automate the discovery of hybrid quantum-classical architectures for image classification, demonstrating that evolved parameterized quantum circuits can achieve competitive accuracy on MNIST, Fashion-MNIST, and CIFAR-10 while significantly reducing the number of trainable parameters compared to classical deep learning models.
This paper introduces robust definitions for the unitary complexity classes and and proves that the existence of quantum commitments implies either the hardness of the unitary synthesis problem or the separation , thereby linking quantum cryptographic assumptions to major open questions in classical complexity theory.
This paper presents a blueprint for a scalable, passive Quantum Random Access Memory (QRAM) that achieves energy cost and query runtime by evolving a time-independent 4-local Hamiltonian with terms.
This paper establishes exponential lower bounds on the fermionic Gaussian rank of magic states and proves that the coherent state border rank of bosonic Fock states equals the product of their mode occupations, thereby resolving a long-standing conjecture and advancing the understanding of classical simulation complexity for quantum systems.
This paper investigates the computational complexity of redundancy-free quantum Hamiltonians, establishing that approximating their partition functions and preparing thermofield double states becomes tractable at lower temperatures compared to general Hamiltonians, while proving that estimating their ground state energy remains QMA-complete.
This paper demonstrates that finite-dimensional quantum theory can be operationally self-tested by constructing a finite set of two-body correlations which, when realized in a manner stable under iterated teleportation, uniquely characterize quantum mechanics and certify the existence of Bell inequality violations beyond currently observed limits.
This paper demonstrates that storing logical qubits for time steps with error can be achieved with optimal spacetime cost using explicit noisy quantum Tanner code circuits and efficient decoding, provided the hardware supports long-range connectivity and fast classical processing.
This paper introduces an efficient block encoding method for structured Hamiltonians that separates the selection of interaction support from the application of operators using permute-act-unpermute circuits, significantly reducing the non-Clifford -gate cost by scaling with system size rather than the number of terms, without requiring translational symmetry or factorized coefficients.
This paper proposes a modular quantum memory architecture that connects planar surface code modules via sparse boundary links to construct high-rate hyperbolic codes, achieving a tenfold to thirtyfold reduction in physical qubit overhead compared to traditional surface codes while maintaining planar fabrication advantages and fault-tolerant logical operations.