6648 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 singlet-triplet spin qubits, when combined with a hardware-efficient leakage-detection protocol and the XZZX surface code, function as effective erasure qubits that significantly boost error correction thresholds and reduce logical error rates for high-performance shuttling-based quantum computing.
This paper introduces a resource-efficient quantum algorithm for the Non-Uniform Quantum Fourier Transform (NUQFT) that leverages low-rank matrix factorization, block encodings, and Quantum Signal Processing to achieve polylogarithmic scaling with precision and logarithmic dependence on grid conditioning, thereby establishing a concrete quantum framework for processing irregularly sampled data.
This paper introduces V2Rho-FNO, a universal framework leveraging Fourier Neural Operators to directly map external potentials to electron densities, achieving accurate, zero-shot generalization across diverse and unseen molecular systems without relying on explicit atomic orbitals or handcrafted descriptors.
This paper demonstrates that while Janus superpositions of squeezed vacua do not surpass single squeezed vacua in principal second-moment squeezing at fixed mean photon number, they can offer significant metrological advantages in specific laboratory quadratures and quadratic-generator sensing when compared within a fixed two-state span or at fixed observed squeezing levels.
This paper extends the hidden cut algorithm for detecting fully unentangled qubit registers by deriving heuristics that identify approximate symmetries and weak entanglement through a rigorous link between the algorithm's output distribution and a cut quality reward function, thereby broadening the applicability of hidden subgroup problems beyond cryptography.
This paper investigates practical optimizations for the Harrow-Hassidim-Lloyd (HHL) algorithm on near-term quantum simulators, demonstrating that while Suzuki-Trotter decomposition and block-encoding strategies improve performance for sparse and moderately dense matrices respectively, the algorithm's fidelity and scalability are fundamentally constrained by matrix sparsity and condition number.
This paper introduces spin-N-Cat codes, a scalable and hardware-efficient quantum error correction scheme that encodes logical qubits in permutationally symmetric spin ensembles using only first-order interactions to correct collective and individual errors while significantly extending coherence times in systems like quantum dots.
This paper proposes a method to enhance superconducting qubit readout fidelity by simultaneously measuring and coherently combining the signal and idler modes of two-mode squeezed states from a nondegenerate amplifier, a technique that improves performance across various amplifier gains and is compatible with frequency-multiplexed quantum processors.
This paper proposes a method for simulating lattice gauge theories coupled to fermionic matter on fault-tolerant quantum computers by regularizing the gauge fields using braided fusion categories and providing explicit quantum circuit constructions for the necessary anyonic and gates.
This paper introduces a Riemannian optimization framework for Hartree-Fock theory formulated directly in the infinite-dimensional Sobolev space , utilizing geometric structures like Stiefel and Grassmann manifolds to derive robust, discretization-independent algorithms that demonstrate competitive convergence against conventional SCF-DIIS methods.