9502 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.
PureMagic is a dynamic scheduler for lattice surgery that eliminates dedicated bus patches by repurposing all ancilla patches for both routing and stochastic magic state cultivation, achieving significant improvements in efficiency, resource utilization, and preparation time compared to traditional static approaches.
This paper introduces a unified Floquet-based theoretical framework for large-momentum-transfer optical lattices that identifies practical operating regimes with significantly reduced losses and improved phase accuracy, thereby enabling next-generation precision atom interferometry for applications in fundamental physics and gravitational wave detection.
This paper enhances the Statistical Quantum Phase Estimation (SQPE) framework for early fault-tolerant quantum computers by generalizing its random compilation to handle negative Pauli weights, replacing overlap-dependent ground state energy detection with a robust changepoint detection method, and reducing sample requirements by 50% through Fourier symmetry exploitation.
This paper characterizes positive linear functionals on as scalar multiples of the trace by establishing that they satisfy specific inequalities involving the spectral geometric mean, while also presenting a related trace inequality for quantum fidelity that does not uniquely characterize the trace.
This paper introduces a framework for assisted quantum teleportation where a third-party "Bank" supplies auxiliary multipartite entanglement to deterministically restore perfect Bell pairs from non-maximally entangled states, analyzing distinct operational models and deriving feasibility conditions for both GHZ and W-class resources.
This paper introduces a quantum Viterbi decoding algorithm for hidden quantum Markov models that optimizes over continuous manifolds of pure quantum effects to achieve a strict quantum advantage in decoding scores over classical strategies, offering a new primitive for quantum sequential decision-making and machine learning.
This paper proposes a unified stochastic drift model for superconducting charge qubits based on memory multi-fractional Brownian motion and a time-dependent Caldeira–Leggett environment, which accurately captures non-stationary 1/f noise and long-range correlations to predict coherence times and non-Markovian decay patterns that surpass the limitations of conventional Markovian approaches.
This paper introduces an algorithm that leverages the classically efficient Clifford group and a graph representation to automatically discover symmetries in arbitrary many-body Hamiltonians, successfully demonstrating its effectiveness on systems with up to one thousand qubits.
This review paper formalizes the theory of Galois qudits over binary extension fields, demonstrating their equivalence to collections of qubits in terms of Hilbert space and operator structures, and explores their applications in constructing quantum error-correcting codes such as quantum Reed-Solomon codes.
This paper proposes an ancilla-free, Fourier-based Linear Combination of Unitaries (LCU) framework that efficiently decomposes complex quantum circuits for optimization tasks by trading circuit complexity for polynomial sampling overhead, thereby enabling hardware-friendly implementations of algorithms like QAOA on near-term quantum devices while maintaining rigorous performance guarantees.