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 introduces ProtocolMatch, a framework for scientific dynamics forecasting that demonstrates how optimal model selection depends on specific deployment protocols—such as compute budget, observation history, and physical objectives—rather than architecture alone, necessitating separate reporting of accuracy, physical validity, and reliability under distribution shifts.
This paper proposes a unified framework that converts both classical security risks and Post-Quantum "Harvest-Now-Decrypt-Later" threats into a single currency-based "cost of delay" metric, enabling organizations to optimally prioritize and sequence cryptographic migration tasks against existing security backlogs.
This paper demonstrates that standard quantum resource estimators, which typically report single-point estimates, fail to accurately represent fault-tolerant workloads at experimentally measured error rates by revealing that realistic hardware uncertainties expand resource intervals by orders of magnitude, introduce structural disagreements between cost models, and cause existing tools to break down entirely for critical algorithms like AES-256.
This paper demonstrates that sub-GHz charge driving of superconducting Kerr oscillators enables fast quantum operations and dynamical protection against low-frequency noise by exploiting a quadratic frequency dependence of charge sensitivity, resulting in a dual-rail erasure qubit with a fourfold erasure bias and an error per Clifford of .
This paper introduces qconform, a deterministic, design-time checker that verifies pulse-level quantum control programs against versioned device capability descriptors to prevent silent failures and ensure experiment-data fidelity, demonstrating its effectiveness through differential testing against QICK and Qblox toolchains.
This paper proposes and analyzes a continuous-variable quantum key distribution (CV-QKD) protocol using noisy coherent states and displacement receivers, demonstrating that this approach enables secure key generation with realistic detectors and can outperform conventional homodyne detection in experimentally relevant regimes.
This paper demonstrates that formulating measurement grouping for quantum energy estimation as a classical binary optimization problem, specifically using mixed-integer linear programming and overlapping clique selection, significantly reduces sampling costs across molecular and lattice Hamiltonians compared to standard sorting-based strategies.
This paper introduces a modular benchmarking framework that decouples quantum search-direction estimation from classical parameter-update rules to systematically evaluate the performance and sensitivity of various optimizers across diverse parameterized quantum circuit workloads, including QAOA, quantum machine learning, and VQE, under both finite-shot simulations and physical hardware execution.
This paper demonstrates that common reporting conventions in variational quantum optimization, such as censored runs that fail to reach a target, can significantly distort performance comparisons between optimizers like Adam, SPSA, and Quantum Natural Gradient (QNG), revealing that QNG's apparent superiority often depends on specific metric pricing assumptions and target strictness rather than inherent efficiency.
This paper presents an explicit binary linear system game with over 1.4 million equations that serves as a concrete counterexample to Tsirelson's problem by demonstrating a perfect winning strategy in the commuting operator model while strictly limiting the success probability of all finite-dimensional quantum strategies.