10088 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 geometric frustration in quantum many-body systems limits the expressibility of standard variational quantum algorithm ansätze, necessitating deeper circuits or bond-resolved parameters to accurately capture inhomogeneous correlations and near-degenerate spectra, a challenge distinct from optimization issues like barren plateaus.
This paper demonstrates that geometrically ordered, spatially extended 2D atom arrays with subwavelength spacing enable a new regime of collective light-matter interaction where photon-mediated interactions drive extensive superradiance and subradiance, revealing their underlying magnetic-like correlations and establishing a programmable platform for dissipative many-body quantum physics.
This paper proposes a ternary quantum eraser cryptography protocol that overcomes the inherent 85% security vulnerability of binary implementations by utilizing three polarization states and randomized temporal ordering to reduce an eavesdropper's maximum success probability to 54% while maintaining competitive efficiency.
This paper presents a high-performance Boson Sampling simulator that generalizes the BB/FG permanent formula using n-ary Gray code ordering and implements it on FPGA-based data-flow engines to achieve efficient sampling from a 60-mode interferometer with up to 40 photons.
This paper presents a generalized transmon Hamiltonian for Andreev spin qubits that utilizes the flat-band approximation of the Richardson model to enable exact diagonalization, thereby simultaneously capturing quantum dot physics, Josephson effects, and Coulomb repulsion across all parameter regimes for modeling both static and time-dependent processes.
This paper demonstrates that physical theories permitting superluminal causation while strictly prohibiting superluminal signaling possess greater information-processing power than those forbidding both, as they can achieve specific non-classical correlation tasks that are impossible under the stricter no-superluminal-causation constraint.
This paper demonstrates that under current and near-future technological assumptions, quantum sieving algorithms aided by Grover's search offer no practical speedup over classical computing for solving the Shortest Vector Problem in dimensions relevant to post-quantum cryptography, as they would require prohibitively large resources and time.
This paper demonstrates that different stochastic unravelings of the same Lindblad master equation are operationally indistinguishable because accessing their distinguishing nonlinear quantities requires prior knowledge of the measurement scheme, and assuming otherwise would violate relativistic causality by enabling superluminal signaling.
This paper demonstrates a secure, entanglement-verified quantum clock synchronization scheme in a metropolitan fiber network using telecom-wavelength photon pairs from a quantum dot, achieving picosecond-level accuracy and verifying the photon source's authenticity through remote quantum state tomography.
This paper introduces a tensor-parallel distributed memory approach for Matrix Product States (MPS) that leverages pivoted QR factorization to efficiently emulate large-scale quantum circuits, achieving record-breaking bond dimensions and significantly higher accuracy than state-of-the-art methods on the Google random circuit sampling benchmark.