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 presents a basis-independent algorithm that efficiently certifies the Schmidt number of high-dimensional bipartite pure states using single-copy measurements, achieving a sample complexity of with only measurement settings under specific assumptions.
This paper introduces a three-outcome Bell inequality tailored for many-body spin-1 systems that serves as a practical dimension witness to certify genuine qutrit correlations and the robustness of spin-nematic squeezed states, thereby linking high-dimensional quantum resources to metrological advantages.
This paper presents a scalable hybrid quantum-classical algorithm for simulating non-linear partial differential equations in electrochemical systems, demonstrating its application by performing the first quantum simulation of a battery cell using the Single Particle Model with electrolyte (SPMe).
This paper constructs explicit, polynomial-time computable asymptotically good binary qLTCs by placing uniform product-expanding Reed-Solomon codes on arithmetic cubical sheaf complexes, thereby achieving positive rate, linear distance, and constant soundness with bounded weights.
This paper revisits the compressed permutation oracle technique to establish a tight soundness bound through a conceptually simpler proof, thereby enabling rigorous quantum security analyses for cryptographic constructions like SHA3, SHA1, and SHA2 that were previously limited by weaker bounds.
This paper demonstrates that controlled dissipation in neutral-atom arrays is essential for achieving the echo state property and fading memory in quantum reservoir computing, enabling high-performance processing of complex non-linear time series with as few as five atoms by operating at the edge of quantum chaos.
This paper establishes that the error probability of the global pretty good measurement for any finite quantum ensemble is at most four times the sum of optimal binary error probabilities, proving this coefficient to be sharp and optimal through a simplified matrix-analytic approach that improves upon previous pairwise bounds.
This paper proposes a hybrid quantum-classical framework for grayscale image compression that combines a Variational Quantum Daubechies Wavelet Transform and a trainable Quantum Convolutional Neural Network with a classical Super-Resolution GAN for decompression, achieving reconstruction quality that rivals and surpasses JPEG2000 standards.
This paper presents a chemically engineered Eu molecular complex and a Hole Anti-hole Grating Echo Memory (HAGEM) protocol to demonstrate the first molecular-engineering-enabled broadband quantum optical storage with 14.9% efficiency and 200 MHz bandwidth, establishing a new framework for designing rare-earth ion materials for future quantum networks.
This paper proposes QRLQ, a quantum reinforcement learning framework that integrates parameterized quantum circuits with a dueling double deep Q-network to optimize cost-delay tradeoffs in quantum cloud orchestration, demonstrating superior performance over heuristic baselines and comparable results to classical deep reinforcement learning with significantly fewer trainable parameters.