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 investigates a unitary deformation of the phase evolution generator that introduces logarithmic spectral curvature without causing decoherence, proposing a spectroscopy protocol to distinguish this specific nonlinear signature from other anharmonicities by analyzing second and higher spectral differences across multiple energy levels.
This paper introduces MQSS-Selector, a unified, learning-based framework that leverages reinforcement and deep learning to dynamically optimize device selection, compiler pass ordering, and job scheduling for HPC-Quantum computing workflows, aiming to simultaneously maximize fidelity while minimizing compilation time and latency in the NISQ era.
This paper provides an exact characterization of the tangent space for weighted graph state tensor networks by identifying that variations leaving the state unchanged beyond standard bond gauges arise from specific local geometric structures, while simultaneously revealing that certain physical directions (such as nearest-neighbor and errors) remain inaccessible, thereby demonstrating that removing redundant parameters and supplying missing directions are distinct operations.
This paper establishes the equivalence between the existence of pseudoentanglement under two operational definitions and the existence of EFI pairs, thereby bridging computational entanglement theory and computational cryptography by demonstrating that pseudoentanglement serves as a minimal assumption for cryptographic security.
This paper rigorously proves the entanglement area law for one-dimensional interacting boson systems with long-range interactions, including Bose-Hubbard and models, by introducing a general Hilbert space dimension reduction method that ensures efficient Matrix-Product-State approximations for ground states.
This paper proposes a general mechanism for implementing deterministic fault-tolerant logical gates on any stabilizer code of distance at least two by temporarily releasing a stabilizer check to create an intermediate code space, where syndrome measurements and Clifford feed-forward enable non-Clifford operations while maintaining error protection.
This paper establishes a generalized area law for gapped ground states of fully connected (geometrically non-local) Hamiltonians, demonstrating that their bipartite entanglement entropy grows at most logarithmically with system size, thereby enabling efficient matrix product state approximations and polylogarithmic-time computation for permutation-invariant cases.
This paper presents an efficient hierarchical decomposition of multi-controlled Toffoli gates using ternary Clifford+ gates that achieves logarithmic depth and significantly reduces ancillary qutrit requirements compared to existing binary approaches, thereby offering a resource-efficient building block for fault-tolerant quantum algorithms.
This paper presents a computer-assisted proof that precisely identifies the unique quantum value of the I3322 Bell functional as a specific irrational number, demonstrating that this supremum is attained only by infinite-dimensional strategies while equating the finite-dimensional, spatial, and commuting-operator values.
This paper introduces "task-resolved Fisher spectroscopy," a framework that uses prediction targets to define orthonormal score coordinates and a Fisher-information hierarchy to diagnose exactly where information is lost in quantum reservoir computing—whether in the reservoir dynamics, measurement choice, feature compression, or finite sampling—enabling experimentally actionable optimizations without requiring quantum state tomography.