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 establishes that the property testing of five key classes of fermionic and bosonic Gaussian states can be achieved with an optimal, size-independent sample complexity of by utilizing projections onto top irreducible representations and proving matching lower bounds based on binary state discrimination.
This paper introduces a method to detect quantum "magic" (non-stabilizerness) in arbitrary states by utilizing out-of-time-order correlators, establishing that this measure vanishes if and only if the evolution is Clifford and providing a lower bound on the number of gates required for the dynamics.
This paper proposes a Markovian dissipative framework using engineered population currents to actively steer the transverse-field Ising model along a prescribed thermal trajectory across its quantum critical point, achieving superior suppression of thermal excitations and coherence damping compared to unitary dynamics or natural thermal baths.
This paper introduces a simple entropy-based proxy that accurately predicts the performance thresholds of diverse quantum error correction protocols by comparing local noise entropy with information gained from stabilizer measurements, offering a practical alternative to computationally intensive simulations.
This paper presents constructions of asymptotically good CSS and subsystem quantum codes featuring fully addressable transversal gates that allow selective control over logical qubits, alongside related results for other non-Clifford gates and sparse check structures.
This paper introduces quantum pseudorandom error-correcting codes (QPRCs) and constructs two distinct types—pseudorandom isometric codes and depolarizing-channel codes—under the hardness of Learning Parity with Noise (LPN), while simultaneously resolving a long-standing open problem by developing an efficient decoding procedure for codeword-stabilized codes based on nonlinear classical codes.
This paper provides relativized evidence against the -hardness and -completeness of the general commuting local Hamiltonian problem by constructing a classical oracle that separates the complexity classes and .
This paper presents a protocol that certifies nearly uniform randomness with an optimal rate of ~1 without requiring any trusted randomness from the verifier, achieving unconditional security in the quantum random oracle model and introducing a proof of conditional min-entropy to address open questions in the field.
This paper establishes a multifaceted hierarchy of quantum channel discrimination strategies for distinguishing non-mixed-unitary channels from mixed-unitary ones, demonstrating that while fully independent and identically distributed (i.i.d.) probes fail without auxiliary memory, introducing block correlations or auxiliary memory enables strictly positive Stein exponents, with auxiliary memory rendering fully i.i.d. probes sufficient for all non-mixed-unitary channels.
This paper introduces a quantum-echo Markov process for combinatorial optimization that leverages quantum dynamics to engineer structured transition kernels, demonstrating that combining quantum-driven exploration with greedy exploitation effectively balances Hamming-space delocalization and energy-space localization to enhance optimization performance.