9165 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 a Quantum Alternating Direction Method of Multipliers (QADMM) for semidefinite programming that leverages quantum singular value transformation and an inexact framework to achieve superior scaling and convergence to an -optimal solution compared to classical and other quantum approaches.
This paper demonstrates that the transition between Hong-Ou-Mandel bunching and antibunching regimes in biphoton states can be experimentally controlled by manipulating the parity properties of the local spectral function through fine-tuned spectral phase modulation, revealing a strong correlation between these symmetry-driven effects and resonance peaks in the Schmidt number.
This paper demonstrates that introducing a slow quench in the interaction between a coherently driven charger and a bosonic battery suppresses energy oscillations to achieve counterintuitive algebraic scaling of maximum stored energy and power with quench duration, enabling unbounded power growth in ideal closed systems while identifying optimal finite-time scaling windows under dissipation.
This paper demonstrates the deterministic preparation of arbitrary two-component product states of fermionic Li atoms in an 88 optical tweezer array with over 98.5% motional ground-state fidelity, establishing a fast, scalable, and programmable architecture for low-entropy fermionic quantum simulation.
This paper improves the upper bound for Quantum Statistical Zero-Knowledge () to with a quantum linear-space honest prover by leveraging algorithmic versions of the Holevo-Helstrom measurement and Uhlmann transform implemented via space-efficient quantum singular value transformation.
This paper proposes a holonomic quantum computing scheme using deformable three-body Rydberg trimers, where universal single-qubit control is achieved via non-Abelian geometric phases in shape space and two-qubit entanglement is generated through linked holonomic cycles, all validated by a gauge-invariant interferometric measurement protocol.
This paper introduces Neural Minimum Weight Perfect Matching (NMWPM), a hybrid decoder that combines Graph Neural Networks and Transformers to predict dynamic edge weights for the MWPM algorithm, achieving near-optimal error correction thresholds on the toric code under depolarizing noise.
This paper establishes rigorous upper bounds on the recurrence time of isolated quantum systems by linking it to an inverse quantum speed limit problem, demonstrating that the time scales as and is generically saturated for random Hamiltonians.
This paper introduces a principle derived from Schrödinger's 1935 work to demonstrate that the EPR-locality paradox does not exist within the Copenhagen interpretation of quantum mechanics, even when considering entangled spin states and objections regarding the locality of spin measurements.
This paper proposes a quantum tree search algorithm using amplitude amplification that achieves improved query complexity dependent on the average branching factor rather than the worst-case maximum, challenges the superiority of quantum backtracking for non-backtracking problems, and introduces sampling-based estimation and a Soar-inspired quantum greedy search to address structural inaccessibility and heuristic guidance.