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.
SpiderLS is a novel lattice surgery compiler that leverages full ZX-diagram reduction and a multi-stage translation pipeline to achieve significant reductions in spacetime volume and compilation time compared to prior ZX-based approaches.
This paper introduces a modular-annihilator framework for constructing exact, frustration-free parent Hamiltonians for purified Gibbs states that enable rapid mixing independent of temperature in free-fermion systems and provides a Krylov-Lanczos approximation scheme with rigorous error bounds for interacting systems.
This paper introduces a quantum-circuit algorithm for performing imaginary-time evolution on infinite one-dimensional lattice systems using a parameterized uniform matrix product state ansatz, which is benchmarked on the transverse-field Ising model via classical and IBM Quantum simulations to analyze the impact of finite-sampling noise on convergence.
This paper presents a quantum computing algorithm for calculating fragmentation functions from first-principles QCD, demonstrating its feasibility through a classical simulation of heavy-quark fragmentation into quarkonium that aligns with NRQCD benchmarks.
This paper develops cycle-structure generating functions for two extremal families of three-colored breakpoint graphs characterized by spherical and projective-plane topologies, revealing distinct combinatorial mechanisms involving noncrossing configurations and Möbius ladders that yield explicit Catalan-weighted evaluations and connect to asymptotic expansions in quantum information theory.
This paper introduces the theory of quantum block turbo codes as the quantum analog of classical turbo product codes, detailing their iterative decoding algorithm and evaluating their performance on a depolarizing channel through simulations.
This paper reviews the physics, current capabilities, and future outlook of neutral atom qubits, a leading approach for large-scale quantum computing that has rapidly advanced from early proposals over 25 years ago to recent demonstrations of quantum algorithms and logical qubits.
This paper proposes and analyzes the DAHR protocol, which integrates hyperentanglement-assisted purification (DAEPP) into quantum repeater chains to achieve significantly higher end-to-end fidelity and photon efficiency compared to traditional BBPSSW-based schemes, particularly under low operation reliability conditions.
This paper establishes a scalable, device-independent method for self-testing -qubit GHZ states by deriving an analytic robustness bound that scales linearly with error and remains independent of system size, thereby enabling the certification of multipartite entanglement in arbitrarily large quantum networks.
This paper reformulates the statistical mechanics relaxation problem by identifying local time statistics of signals as the operational objects of relaxation, demonstrating that global irreversible prediction relaxation is possible for finite bounded systems, and interpreting entropy as mutual information between an observer and the system's unknown past.