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 demonstrates that logarithmic-depth circuits with passive linear optics and non-Gaussian magic inputs suffice to achieve both anticoncentration and average-case -hardness for Fermion Sampling, thereby replacing the previously required linear-depth, quadratically-sized global Haar-random constructions with an gate complexity.
This paper presents a universal entanglement distillation protocol that, by combining local tomography with adaptive routines, asymptotically achieves the optimal distillable entanglement rate for any unknown bipartite state in finite dimensions without incurring a penalty due to ignorance of the state.
This paper proposes near-optimal quantum primitives for molecular quantum dynamics simulations on oscillator-qubit processors, utilizing generalized Jacobi-Anger expansions within quantum signal processing to synthesize efficient multimode bosonic phase gates that significantly reduce circuit depth and demonstrate feasibility on near-term hardware with specific qubit and oscillator lifetime requirements.
This paper establishes a no-go theorem proving that any quantum algorithm for the dihedral coset problem following Regev's Fourier-sampling template must utilize nearly all Fourier label bits, thereby demonstrating that a recent algorithm by Simon fails to solve the problem because it relies only on a subset of these labels.
This paper demonstrates that Decoded Quantum Interferometry (DQI), by reducing Gibbs sampling to a quantum decoding problem, can overcome topological barriers like shattering and disorder chaos to sample from Ising spin glasses at temperatures significantly beyond the dynamical phase transition where stable classical algorithms fail.
This paper demonstrates that while finite-bandwidth spectral filters can protect a three-level quantum heat engine from parasitic heat leaks by suppressing unwanted transitions, the physical filter's finite response time creates a fundamental trade-off where excessive narrowing reduces energy throughput, establishing a model-dependent optimal bandwidth for maximum power.
This paper analyzes the performance of Decoded Quantum Interferometry (DQI) by establishing that while its quantum advantage is limited by classical decoding constraints and NP-hardness results for non-binary cycle codes, it can still efficiently achieve nontrivial satisfaction guarantees for specific families of Max--Cut instances.
This paper demonstrates that weak continuous measurement of a single site in a one-dimensional lattice can induce entanglement and drive systems of two or three particles, initially lacking permutation symmetry, into stable bosonic, fermionic, or parastatistical symmetry sectors.
This paper provides a comprehensive technical analysis and resource-efficient extension of a discrete-time quantum walker-based Quantum Random Access Memory (qRAM) architecture, introducing long- and short-range routing paradigms that achieve optimal circuit depth while avoiding the exponential resource overhead of existing proposals.
This paper demonstrates that while logarithmic-depth Clifford circuits can provide exact learning guarantees for various quantum state-learning tasks by directly leveraging their structure, they fundamentally differ from approximate unitary designs, which may fail to preserve these guarantees even with exponentially small errors.