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 the concept of robust subspace designs and leverages their probabilistic construction to prove a quantum space-bounded variant of the Valiant-Vazirani theorem, demonstrating that restricting NP-complete problems to instances with a unique accepting witness subspace preserves hardness under randomized reductions.
This paper presents a Hamiltonian-based framework that maps qubit frequency collision suppression to a Max-k-Cut problem, utilizing a cluster-stitching protocol to scale solutions for large lattices and demonstrating through benchmarks that hardware-aware optimization effectively connects microscopic physics to scalable processor design.
This paper introduces Remote Graph State Preparation (RGSP), a protocol that utilizes high-dimensional photonic qudits to directly generate arbitrary entangled graph states for blind quantum computation, thereby significantly reducing server-side entangling requirements and qubit overhead while maintaining high fidelity independent of graph topology.
This paper proves that unitary quantum logarithmic space with one-sided error (RQUL) is equivalent to the general case with intermediate measurements (RQL) for standard gate sets, demonstrating that measurements can be eliminated while preserving polynomial time, logarithmic space, and zero acceptance on no-instances.
This paper presents a finite-temperature field-theoretical framework describing how a two-component quantum Boltzmann plasma screens the Casimir force between conducting plates, revealing that while classical mobile charges only Debye-screen longitudinal modes, quantum effects introduce a unique source term and modify the force through thermal de Broglie wavelength corrections that bridge the behavior of non-degenerate plasmas with degenerate electron gas responses.
This paper presents quantum algorithms that achieve Heisenberg scaling for estimating the log partition function of an -qubit Hamiltonian by utilizing an adaptive cooling schedule and recursive-doubling identities to reduce query complexity to , which is proven to be optimal up to polylogarithmic factors.
This paper investigates the highly symmetric, fully antisymmetric "supersinglet" states of high-dimensional particles, demonstrating their exceptional noise robustness, developing methods to certify their entanglement depth and dimensionality, and establishing their utility as a resource for achieving Heisenberg-limited high-dimensional gradient sensing.
This paper demonstrates that converting quantum circuits through intermediate formats like OpenQASM often destroys high-level structural information, thereby preventing compilers from applying optimal synthesis methods, and proposes a "Verified" framework to record and reconstruct these operations to restore synthesis capabilities.
This paper demonstrates that preparing multiple quantum states collectively under weighted Pauli control is strictly nonadditive, achieving lower resource costs than independent preparations through mechanisms that do not necessarily rely on transient entanglement, while also establishing fundamental speed limits and fidelity penalties for coherent state synthesis.
This paper introduces a quantum-native data loader that learns a shared low-dimensional structure from real datasets to prepare signals with a single fixed circuit, achieving superior scalability and efficiency compared to traditional methods by requiring fewer parameters that remain constant even as data size increases.