6120 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 proposes a unified theoretical framework combining Lie algebra symmetry analysis, Green function propagation, and a novel phase-sensitive metric called "catability" to describe and test the coherence and interference stability of superposed quantum states in 2D graphene systems.
This paper introduces an algorithm for efficiently counting anticommuting pairs among Pauli strings with bounded weight on qubits by utilizing labeled subpattern counts and subset zeta identities, significantly improving upon the standard approach for large collections in the bounded locality regime.
This paper establishes that finite quantum systems with acyclic transition graphs exhibit exact nilpotent collapse of the Born series, enabling an algebraic closure of the scattering solution where the first-order Born approximation fails completely, as demonstrated by a four-level diamond-graph system that encodes exact interference phenomena through a finite sum.
This paper demonstrates that the internal structure of multipartite graph-state circuit blocks, specifically their entanglement distribution and graph-theoretic connectivity, significantly dictates entanglement and scrambling velocities in random Clifford circuits, challenging the assumption that detailed gate structure plays only a limited role in coarse-grained dynamical rates.
This paper introduces a permutation-symmetric stochastic unraveling method that drastically reduces the computational cost of simulating exact quantum dynamics for emitters coupled to a common system, enabling efficient modeling of large system sizes for both 2-level and -level emitters.
This paper presents a pedagogical tutorial on replica tensor-network techniques for analyzing random quantum circuits, demonstrating how to map circuit-averaged observables to classical statistical-mechanics models and providing an accompanying open-source library for implementation.
This paper proposes a quantum algorithm that identifies a hidden -regular base graph from an obfuscated "spired" version by leveraging continuous-time quantum walks and spectral theory to achieve a potential exponential speedup over classical methods, with numerical evidence supporting its ability to distinguish complex graph families like prism graphs and Möbius ladders.
This paper demonstrates that the proposed method of reconstructing the Schrödinger wave function from a discrete superposition of real classical action branches fails in classically forbidden regions and for global phase phenomena, as these quantum effects fundamentally require non-vanishing quantum potentials, complex-valued actions, or global boundary conditions that local real classical trajectories cannot provide.
This paper introduces a structure-preserving low-rank compression protocol for two-electron reduced density matrices that reduces memory scaling from quartic to quadratic while maintaining chemical accuracy, thereby enabling efficient application of eigenvector continuation workflows to large-scale nonadiabatic molecular dynamics simulations.
This paper proposes a method to reduce the physical qubit overhead of 2D hypergraph product codes while preserving their code dimension, logical basis, and minimum distance, demonstrating through simulations and examples that these reduced codes maintain fault-tolerant performance and compatibility with logical computation gadgets.