5975 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 investigates operator spreading in random quantum circuits with orthogonal or symplectic symmetry, revealing distinct features such as ternary-valued weight relaxation, finite-width domain walls, and a fundamental dichotomy in butterfly velocity behavior that differs significantly from the well-studied unitary-invariant case.
This paper introduces and characterizes a faithful measure for the informational completeness of qubit measurements, demonstrates that symmetric informationally complete measurements maximize this property, and defines a corresponding "IC preservability" metric for quantum channels that reveals a fundamental connection to the channel's absolute output coherence.
This paper proposes a framework where spatial subregions in quantum gravity are assigned pure states via a partially frozen gravitational path integral, leading to a new holographic prescription for entanglement entropy that satisfies key consistency conditions and introduces an observer-dependent entanglement wedge.
This paper introduces the Subspace Restriction Scheme (SRS) and the Multi-Hund Subspace (MHS) to significantly reduce qubit requirements and optimize variational quantum eigensolver performance for simulating molecular ground states by projecting the Hamiltonian onto a physically motivated, reduced Fock subspace.
This paper introduces efficient protocols for learning the Hamiltonian, interaction graph, and trace distance of positive-temperature bosonic Gaussian states using only heterodyne measurements, achieving logarithmic sample complexity in the number of modes through a novel "local inversion" technique that bypasses the need for precise global covariance estimates.
This paper provides numerical evidence supporting the non-Abelian eigenstate thermalization hypothesis (ETH) through simulations of a 1D Heisenberg chain and offers an analytical proof of its self-consistency, thereby establishing a framework for understanding thermalization in quantum systems with non-commuting conserved quantities.
This paper presents a sparse, non-Markovian noise modeling approach for transmon-based multi-qubit operations, validated across seven IBM Quantum devices, which significantly outperforms default models in predicting hardware dynamics and enables effective error mitigation strategies.
This paper proposes a novel framework for quantum optimal transport by defining transport costs as linear functions of "states over time" (the Jordan product of a density matrix and a transport map), revealing that this approach yields qualitatively different results from classical Monge transport theory, particularly in the analytically tractable case of unitary-invariant costs.
This paper proves that constructing perfect-complete quantum public-key encryption with classical keys from quantumly secure one-way functions is impossible in a black-box manner within the quantum random oracle model, thereby resolving a long-standing open question and establishing tight limits on known quantum public-key encryption schemes.
This paper proposes and analyzes efficient quantum subroutines for constructing oracles required to block-encode stiffness and mass matrices in the finite element method, demonstrating that their computational cost scales favorably enough to preserve the potential polynomial or exponential advantages of quantum algorithms for elastic structure analysis.