6077 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 review article comprehensively summarizes all experiments claiming quantum computational advantage, critically examines their challenges and refutations, discusses theoretical advantages in specific problems, and highlights recent progress in quantum error correction as a key step toward achieving advantage in Shor's algorithm.
This paper presents a breakthrough in quantum error correction by introducing quantum LDPC codes that approach the fundamental hashing bound while enabling decoding with computational cost linear in the number of physical qubits, thereby paving the way for large-scale, fault-tolerant quantum computation.
This paper challenges the conventional association between information backflow and non-P-divisibility in qubit dynamics by demonstrating that the generalized trace distance criterion is neither tight nor faithful for individual state pairs, while also clarifying the specific conditions under which it offers advantages over the standard trace distance measure.
The authors experimentally demonstrate a scalable, low-overhead on-chip coupler that utilizes a binary-tree mapping to achieve exponentially enhanced connectivity and high-fidelity non-local entanglement between fluxonium qubits, thereby enabling the implementation of efficient quantum error correction codes like qLDPC on superconducting devices.
This paper establishes a universal scaling theory for defect statistics in counterdiabatic quantum critical dynamics by developing an analytically tractable local expansion scheme, which is validated on transverse field Ising and long-range Kitaev models to evaluate the effectiveness of local protocols for quantum state preparation.
This paper demonstrates that synchronizing a flux pulse with readout photon dynamics in fluxonium qubits mitigates state transition errors caused by measurement-induced excitations and two-level system coupling, achieving high-fidelity readout (up to 99%) within short integration times.
This paper demonstrates a scalable path to error-corrected quantum computing by achieving simultaneous single-qubit gate, two-qubit gate, and readout fidelities exceeding 99.9% in a single superconducting device through optimized coupling parameters and a novel calibration protocol.
This paper establishes a sufficient condition that validates the CQC conjecture for a broader class of quantum states, extends the conjecture to multiple mutually unbiased bases in prime dimensions, and proves it for isotropic states while providing extensive numerical support for random bipartite states.
This paper explicitly constructs the effective density matrix and modular Hamiltonian for the vacuum state of a large spherically symmetric causal diamond in four-dimensional asymptotically flat gravity by utilizing the soft effective action to integrate out soft graviton modes, thereby revealing that the variance of the modular Hamiltonian scales with the diamond's area and the inverse square of the UV cutoff.
The paper introduces CircuitTree, a Bayesian optimization framework utilizing tree-based models and layerwise decomposition to achieve efficient, resource-saving probability distribution matching on near-term quantum hardware with theoretical convergence guarantees.