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 establishes the optimal query complexity of for the Quantum Linear Systems Problem and resolves an open problem by demonstrating that any unitary can be implemented with bounded error using queries.
This paper establishes the optimal sample and query complexities for the abelian state hidden subgroup problem, demonstrating that coherent access to the state-preparation unitary enables a quadratic improvement in error dependence () compared to the sample model, thereby settling the problem's complexity in both settings.
This paper presents the first succinct arguments for QMA based solely on collapsing hash functions (a Minicrypt assumption), achieved through a novel quantum-succinct claw-state generation protocol that improves upon prior work in round complexity, simplicity, and standard model security.
This paper initiates a systematic study of smoothed quantum query complexity, demonstrating that smoothing can reveal exponentially larger quantum speedups over classical algorithms for total functions and symmetric Boolean functions, while also providing significant quantum advantages for string problems like pattern matching and edit distance.
This paper extends previous statistical analyses of NISQ experiments by demonstrating that, contrary to theoretical predictions regarding amplitude damping, the Google 2019 "quantum supremacy" data exhibits zero-one fractions determined solely by readout error asymmetry rather than gate errors, a finding supported by simulations on IBM and Google platforms.
This paper establishes an explicit circuit design criterion for quantum neural networks by decomposing operator space into frequency-indexed invariant planes, demonstrating that target Fourier coefficients become reachable only when local rotations and entangling layers are strategically arranged to align the effective state and observable with specific multi-qubit Pauli support, a rule validated through ablation studies and physics-informed regression tasks.
This paper presents an efficient classical algorithm for approximating linear statistics of Boson Sampling distributions across various input states, thereby unifying recent quantum-inspired simulation results and demonstrating the classical evaluability of certain proposed one-way functions while leaving non-linear statistics as an open challenge.
This paper demonstrates that collective dissipation in a fully static architecture enables fixed-time Gaussian state transfer without coherent transport or active control, offering a robust communication channel that remains effective against amplitude asymmetries while being sensitive to phase detuning.
This paper introduces Generalized LIMDDs, a framework for succinct decision diagrams modulo a group that achieves exponential improvements over Pauli-LIMDDs through a two-parameter family of groups, while establishing their canonicity, polynomial-time computability, and tractability for key queries and transformations.
This paper establishes a sharp characterization of the fundamental limitations imposed by state-preparation-and-measurement (SPAM) noise on learning local Lindbladians, identifying unlearnable gauge-dependent components while providing scalable, SPAM-robust algorithms to efficiently learn all universally gauge-invariant parameters using only trusted single-qubit operations.