9721 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 an analytical solution to the Kronig-Penney model using truncated harmonic oscillator potentials instead of square wells, deriving energy dispersion and wave functions to explicitly express the tight-binding tunneling amplitude in terms of harmonic oscillator parameters.
This paper presents an exact analytical solution for a continuous-time quantum walk on a semi-infinite line with a Lindblad boundary sink, revealing a closed-form propagator and first-passage statistics that exhibit an exact duality between weak and strong dissipation regimes, where absorption is suppressed either by inefficient transfer or by the emergence of a localized non-Hermitian mode visualized as a confined Wigner droplet.
This paper investigates sparse signaling over lossy thermal-noise bosonic channels for covert communication and sensing, revealing that a mixture of vacuum and single-photon states minimizes detectability in low-brightness regimes while establishing the trade-offs between covertness and task performance.
This paper provides a concise review of recent advances in quantum learning theory for continuous-variable bosonic systems, focusing on sample complexity for learning Gaussian and non-Gaussian states, the role of non-Gaussianity, Gaussianity testing, and efficient learning of Gaussian processes, while also presenting new bounds on trace distance and highlighting open problems in the field.
This study employs PCA and t-SNE analyses on QAOA parameter datasets for max-cut problems to demonstrate that entangled mixing operators at depths of 2L and 3L exhibit distinct clustering behaviors and preserve more information compared to their non-entangled counterparts, thereby revealing quantifiable and visual differences in their optimization landscapes.
This article shows that 1D translation-invariant Gibbs states exhibit superexponentially decaying conditional mutual information (defined via the Belavkin-Staszewski relative entropy), which enables the efficient construction of tensor network approximations as well as the learning of classical representations from local measurements with polynomial sample complexity.
This article proposes the Hamiltonian reconstruction distance as a practical success metric for the Variational Quantum Eigensolver (VQE) and validates it by demonstrating through simulations and cloud-based trapped-ion experiments that it effectively assesses solution quality and prevents erroneous premature termination without requiring prior knowledge of the true ground state.
This paper introduces a modular hierarchy of private delegated quantum computing protocols tailored for user and industry settings, which systematically categorizes privacy guarantees and resource requirements based on client capabilities, adversarial models, and specific leakage assumptions.
This article proves the Krenn-Gu conjecture, which states that the dimension of every GHZ graph with more than four vertices is at most two, for graphs with a vertex connectivity of at most two as well as for cubic graphs, and simultaneously establishes that every potential counterexample must be 4-connected.
This article presents a classical algorithm with polynomial runtime that provides a necessary and sufficient condition to decide whether a given pair of multivariate Laurent polynomials can be implemented via multivariate quantum signal processing (M-QSP) and simultaneously determines the required parameters constructively.