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 introduces a novel ansatz utilizing diagonal phase matrices, Fourier matrices, and real Hadamard matrices to construct new sets of mutually unbiased bases (MUBs) in various dimensions, including specific improvements in dimension 12 and asymptotic extensions that exceed previous tensor product bounds.
This paper classifies the symmetry and quantum chaos of a zero-dimensional quantum breakdown model, revealing a periodicity, the realization of all five chiral symmetry classes with exponentially many protected zero modes, and distinct spectral signatures of chaos.
Assuming the existence of homomorphic encryption, this paper establishes that parallel repetition of interactive arguments achieves tight exponential soundness error reduction in the post-quantum setting for both standard and threshold verifiers, enabling the construction of the first constant-round succinct argument for QMA with negligible errors.
This paper proposes a defect-aware parallel atom reloading protocol for neutral-atom quantum computers that combines coherent reloading with an efficient planner to achieve a near-perfect 99.94% atom filling rate in under 0.1 ms, meeting real-time operational requirements.
This paper introduces a pseudo-control protocol that experimentally characterizes the memory dimension of open quantum dynamics by encoding environmental information into an interference matrix, enabling the certification of memory lower bounds without requiring direct access to the environment or full process-tensor tomography.
This paper resolves an open problem by constructing quantum time-lock puzzles in the quantum random oracle model, enabling secure timed-release encryption with polynomially bounded delays against quantum adversaries, a feat proven impossible in the classical setting.
This paper establishes a framework comparing covariant quantum state tomography protocols by deriving their large deviation rate functions in terms of a new family of divergences, demonstrating that these rate functions provide a more fine-grained performance metric than traditional sample complexity by revealing strict orderings even among order-optimal protocols.
This paper proves that the expectation values of functions applied to photon-number outcomes in Gaussian boson sampling can be classically evaluated for finite squeezing strengths by analyzing the irreducible decomposition of fixed-photon-number operator spaces, thereby providing a classical algorithm and new theoretical insights into the complexity of such tasks.
This paper introduces Quantum Markov State Models (QMSMs) to describe the long-time dynamics of open quantum systems by constructing optimal compression and reconstruction channels that preserve both classical metastable phases and quantum coherence, achieving rigorous diamond-norm error bounds that answer Kitaev's exact-rounding question.
This paper introduces a framework that leverages the Motzkin-Straus theorem to solve combinatorial optimization problems on QCi's Dirac-3S photonic entropy computer, demonstrating that this analog platform matches or surpasses classical solvers on most benchmark instances while establishing entropy computing as a competitive approach for navigating non-convex landscapes.