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 extends the seminal Kyle model by analyzing market equilibria where an asset's future value follows either a classical or continuous-time quantum random walk, revealing that while the classical case yields a linear trading strategy with sub-linear profit growth, the quantum case produces a clustered strategy with multiple pricing jumps but results in linear profit growth over time.
This paper establishes general conditions for the rapid convergence of propagation algorithms to efficiently simulate local observables in open quantum systems by leveraging contractivity to control interaction growth, thereby extending efficient simulation time scales for noisy dynamics and high-temperature Gibbs states.
This paper establishes a physical interpretation of Voiculescu's free entropy by demonstrating that it quantifies the minimal quantum memory required to program multiple copies of a state with known eigenvalues but an unknown eigenbasis, a task defined as the quantum minimum description length.
This paper introduces a robust protocol called Gram-matrix tomography that characterizes the partial distinguishability of independently prepared photons by reconstructing their internal state overlaps from a polynomial number of measurable invariants, thereby enabling accurate prediction of multiphoton interference statistics without requiring direct access to the unknown internal degrees of freedom.
This paper demonstrates that random input order can enable "replenishment," allowing quantum streaming algorithms to solve certain problems with polylogarithmic space that are intractable in other orders, while simultaneously establishing robust polynomial space lower bounds for other tasks like triangle counting and cycle detection through strengthened quantum communication techniques.
This paper introduces union maximal leakage as a linear-program-computable metric to certify measurement incompatibility and entanglement under bounded classical communication, demonstrating that violations of its -bit bound not only rule out compatible explanations but also guarantee device-independent private randomness generation even when the receiver's choice depends on the sender's message.
This paper proposes an axiomatic framework based on local recoverability, absence of long-range correlations, and spatial uniformity to classify topological phases in open quantum systems, demonstrating how these principles yield robust topological data and secret-sharing constraints that distinguish distinct mixed-state phases.
This paper establishes tight quantum query lower bounds for achieving high linear cross-entropy benchmark scores in random circuit sampling, proving that exceeding ideal performance requires queries and certifying nearly optimal smooth min-entropy for outputs, thereby providing rigorous security guarantees for certified randomness against entangled adversaries.
This paper proves that efficiently implementing Haar random unitaries or scalable pseudorandom unitaries is impossible in the random-oracle model by establishing a superpolynomial query lower bound, while simultaneously constructing an -unitary design that surpasses previous results.
This paper introduces a digital-analog counterdiabatic driving method that leverages the structural properties of the adiabatic gauge potential to efficiently prepare surface-code ground states on near-term superconducting architectures, significantly outperforming bare adiabatic evolution and reducing entangling depth by an order of magnitude for measurement-free initialization.