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 and analyzes the -SPF method for localizing logical information in stabiliser codes onto a small set of qubits using single-qubit measurements, proving a localization threshold for surface codes and providing efficient algorithms that enable the study of larger codes for applications like fault-tolerant teleportation.
This paper provides a comprehensive review of quantum algorithms for solving computational fluid dynamics partial differential equations, analyzing both fully quantum and hybrid approaches, exploring tensor-network representations for efficient encoding, and assessing the problem-dependent limitations and challenges toward achieving scalable quantum advantage.
This paper demonstrates that while low-depth QAOA offers an empirical exponential speedup on near-symmetric optimization problems, its fault-tolerant implementation incurs only a quasi-linear non-Clifford cost per circuit, and the mechanism enabling this success does not necessarily leak the solution, allowing for families where hard optimization and efficient quantum approximation coexist.
This paper proposes a deterministic topological quantum routing architecture using coined Szegedy quantum walks on edge-duplicated signed graphs to achieve perfect state transfer with unit fidelity by eliminating back-scattering, while also demonstrating its robustness against realistic environmental noise.
This paper demonstrates that the entanglement cost lower bound for distributed bipartite quantum computation, typically derived from operator Schmidt rank, can be achieved with constant qubit overhead (at most two auxiliary qubits per QPU) for all Clifford unitaries and approximated within a linear -count penalty for non-Clifford unitaries.
This paper proposes and validates a priority-aware routing protocol for quantum networks that integrates coherence-time constraints into path selection, demonstrating significantly improved fidelity and latency stability under high loads compared to traditional loss-only routing and FIFO scheduling across diverse topologies.
This paper derives a backward stochastic differential equation on the manifold of pure states to reverse quantum state diffusion, enabling the generation of new ensembles close to the original via score-based methods and providing error bounds for various settings including the depolarizing channel.
This paper demonstrates that while (O)EKE and Masny-Rindal OT compilers offer efficient post-quantum candidates, they fail to achieve Universal Composability (UC) security against quantum polynomial-time adversaries due to fundamental barriers in input extraction, though they do retain certain game-based security guarantees.
This paper presents an improved uniform quantum random self-reduction for linear problems over finite fields that achieves a time complexity of by utilizing amplitude amplification to find vectors outside a Bogolyubov–Ruzsa subspace without explicitly learning the subspace, thereby surpassing the previous bound.
This paper presents an efficient algorithm for learning constant-dimensional brickwork random quantum circuits in polynomial time when the product of gate locality and circuit depth is logarithmic in the system size, utilizing a novel local correlation criterion and a dimension-independent anticoncentration inequality to identify gates without reconstructing their full backward light cones, thereby clarifying the threshold for the emergence of pseudorandomness.