7120 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 establishes theoretical bounds for extracting multipartite entanglement resources like GHZ states and EPR pairs in a Quantum Internet and proposes a novel polynomial-time heuristic algorithm to solve this otherwise NP-complete problem, enabling efficient on-demand communication across remote nodes.
This paper reformulates Simon's entanglement criterion using the partner formula to demonstrate that entanglement harvesting from a quantum field is prohibited under specific conditions, revealing that Hawking radiation, analogous to the Unruh effect, lacks quantum correlations between its emitted real particles.
This paper introduces finite Gaussian assistance protocols and a multimode conic metric framework to optimize spacelike vacuum entanglement, yielding the highest known lower bound for Gaussian entanglement of assistance and the lowest known upper bound for Gaussian entanglement of formation in free scalar fields.
This paper experimentally demonstrates high-fidelity, hyperfine-level-selective measurements of individual neutral cesium atoms by combining simultaneous laser cooling on a forbidden transition with background-free imaging, achieving a detection fidelity of 0.9993 while enabling repeated, low-loss state measurements.
This paper introduces trivariate tricycle (TT) codes, a family of quantum low-density parity check (qLDPC) codes that combine high fault-tolerance thresholds, single-shot decodability, and efficient transversal implementations of both Clifford and non-Clifford gates, while significantly reducing the qubit overhead compared to the 3D toric code.
This paper proposes a novel quantum routing approach that utilizes graph complement strategies to establish direct entanglement between remote nodes, thereby bypassing the computationally intensive pathfinding overhead inherent in traditional methods to improve network flexibility and efficiency.
This paper proposes a polynomial-time algorithm that solves the NP-complete problem of extracting both remote EPR pairs and n-qubit GHZ states from generic graph states, thereby enabling dynamic, on-demand entanglement distribution in quantum networks.
This paper investigates symmetry-resolved genuine multi-entropy in Haar random and random graph states with conserved quantities, deriving explicit thermodynamic limit formulae for the former and using numerical analyses to reveal distinctive multi-partite entanglement features in the latter compared to the Haar random case.
This paper introduces Superpositional Gradient Descent (SGD), a novel hybrid quantum-classical optimizer that leverages quantum superposition and circuit perturbations to achieve faster convergence and lower loss than AdamW in both synthetic and large-scale language model training, despite current hardware scalability limitations.
The paper proposes HyRLQAS, a hybrid-action reinforcement learning framework that unifies discrete circuit structure search with continuous parameter optimization to automatically design variational quantum circuits achieving chemical accuracy with fewer gates and faster convergence.