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 refutes the longstanding conjecture that randomized query complexity is quadratically bounded by quantum query complexity in exact learning by constructing concept classes that demonstrate a cubic separation, thereby proving that optimal quantum speedups can exceed the Grover and Bernstein-Vazirani paradigms.
This paper introduces a novel operator-norm framework for analyzing non-uniform security in quantum random oracle and permutation models, which unifies search and distinguishing bounds to achieve tight results for problems like Yao's box, pseudorandom generators, and salted function inversion.
This paper presents the first succinct argument for QMA in the quantum random oracle model that relies solely on unstructured hardness by transforming public-query sound quantum interactive oracle proofs into quantum arguments using a novel commit-and-open paradigm with extractable vector commitments for quantum states.
This paper establishes that unmodified Shamir secret sharing over prime fields remains secure against quantum local leakage when the threshold rate exceeds approximately 0.73339, provided that leakage devices have limited or no entanglement, while demonstrating that arbitrary entanglement among devices can completely break security even with classical leakage.
This paper introduces a unified optimization framework for quantum repeater chains that relaxes traditional constraints on operation order and purification schedules, proving that flexible tree-based purification strategies are the dominant factor in maximizing end-to-end throughput and feasibility under symmetric Pauli noise, while demonstrating that post-swap purification offers no throughput benefit.
This paper introduces BasicQGAN, a single-circuit Quantum Generative Adversarial Network framework that achieves stable, end-to-end pixel-level image generation with reduced resource overhead by calibrating the quantum prior's Fidelity Landscape to align with the target data distribution before adversarial training.
This paper introduces iSOMA-AR, an adaptive rotation variant of the improved Self-Organizing Migrating Algorithm that significantly enhances performance on coordinate-sensitive deterministic benchmarks and variational quantum objectives by learning optimal bases from migration displacements, though its primary noise robustness stems from the underlying SOMA mechanism rather than the rotation adaptation itself.
This paper introduces Dissipative Quantum Reservoir Computing (DQRC), a framework that utilizes a small, fixed open quantum system to learn and accurately reproduce the complex, nonlinear input-output dynamics of larger driven many-body quantum systems like High-Harmonic Generation, outperforming classical neural network models while serving as a compact, physically grounded digital twin.
This paper evaluates the potential of quantum computing for network security classification by demonstrating that near-term quantum-kernel SVMs offer competitive, dataset-dependent performance compared to classical baselines, while long-term quantum oracle sketching suggests significant advantages in memory efficiency for processing streaming data.
This paper establishes a fundamental trade-off law between classical memory and committed magic states in streaming Clifford+T compilation, deriving unconditional lower bounds on the exchange rate via lattice geometry and proving that under typical conditions, asymptotically approaches 3, meaning one bit of memory forgone saves approximately three gates.