6120 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 a programmable, cavity-enhanced quantum memory in an isotopically purified erbium-doped thin-film lithium niobate microring resonator that achieves high-efficiency storage of telecom photons with long-lived shelving states and fast on-chip spectral control, thereby verifying its viability as a key interface for spectrally multiplexed quantum networks.
This paper proposes a model of quantum computation coupled with ancilla qubits evolving under specific nonlinear Schrödinger equations, demonstrating that such systems can efficiently solve UNIQUE SAT, 3SAT, and #SAT problems by using distinct nonlinear Hamiltonians to discriminate the number of satisfying assignments.
This paper introduces QSeqSim, a Qiskit-integrated symbolic simulator that enables the efficient simulation of quantum programs with while-loops by translating them into sequential circuits and utilizing BDD-based weighted model counting to compute measurement probabilities for large-scale, multi-iteration benchmarks.
This paper proposes a nonlocal Maxwell demon that teleports ergotropy at finite temperature using a shared surface code and classical communication, demonstrating that the process is exponentially protected below a topological threshold while revealing a thermodynamic phase transition and a fundamental distance limit imposed by quadratic infrastructure costs.
This paper experimentally demonstrates a silicon nitride photonic Physical Unclonable Function (PUF) and proposes a quantum readout protocol using single-photon states and maximally mixed states to achieve highly secure authentication with an exceptionally low equal error rate of 10⁻¹⁴.
This paper proves that the maximum eigenvalue of the level- Kikuchi graph Laplacian is at most , confirming four conjectures and enabling improved approximation ratios and efficient algorithms for Quantum Max Cut and the XY Hamiltonian.
This paper proposes a resource-driven framework that treats shared multipartite entanglement as a programmable "whatever channel" configurable via Local Operations and Classical Communication, introducing the "Entanglement Rolling" protocol to systematically reconfigure connectivity graphs while demonstrating robust performance under realistic noise conditions using the Noisy Stabilizer Formalism.
This paper derives closed-form propagators for open subsystems of an -qubit network with a single excitation, demonstrating that a single transition amplitude governs excitation flow, positivity, entanglement, and Fisher information, while revealing that positivity coincides with complete positivity and is determined solely by the direction of excitation flow toward a fixed point.
This paper proposes a quantum circuit strategy for simulating lattice gauge theory by employing quantum group deformation to restore unitarity and reduce the resource scaling for two-qudit gates from to , demonstrating that q-deformation remains a reliable truncation method with significant advantages for quantum circuit synthesis.
This paper introduces a scalable protocol that overcomes the exponential sample complexity barrier to robustly self-test almost all generic -qubit states using only polynomial resources, thereby enabling device-independent certification and learning in large-scale quantum networks.