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 derives and analyzes the Wigner distributions for Kink and Sine-Gordon solitons by evaluating their Schrödinger wave-functionals, subsequently utilizing these distributions to calculate key physical properties such as charge, current density, and the quantum speed limit time.
This paper proposes an efficient experimental method using a Mach-Zehnder interferometer to estimate and detect entanglement in both pure and mixed bipartite states from a single copy of the input state by measuring interference visibility, mutual predictability, and witness operator phase shifts.
This paper proposes a highly coherent and scalable atomtronic qubit system based on a Bose-Einstein condensate in optical wells coupled to coherent light, which functions as a superconducting quantum interference device in synthetic dimensions and achieves the functionality of traditional 2D SQUIDs using only 1D circuits.
This paper challenges the long-held belief that signing quantum messages is impossible by introducing three novel approaches—utilizing time-dependent signatures, dynamic verification keys, and the bounded quantum storage model—to achieve public verifiability and information-theoretic security, thereby enabling authenticated quantum public keys and quantum money schemes.
This paper establishes a deep connection between fracton order and product codes by demonstrating how specific classical seed codes can systematically generate both Type-I and Type-II fracton models in nonlocal and local constructions, including examples on irregular graphs and planar aperiodic tilings.
This paper proposes a heuristically guided, polynomially scalable quantum approach that utilizes scattering-based state preparation, specifically within the context of mergo-association, to efficiently solve chemical simulation problems by generating good initial states for dynamics simulations.
This paper proves that the compilation method proposed by Kalai et al. is sound for any two-player XOR game by demonstrating that the semidefinite programming upper bound on the quantum value holds for the compiled game up to a negligible error, thereby extending previous results from the specific CHSH case to general XOR games and enabling tight bounds on parallel repetitions, operator self-testing, and sum-of-squares certificates.
This paper establishes that the feasibility of each level of the NPA hierarchy for quantum isomorphism is equivalent to the equality of homomorphism counts from a specific class of planar graphs, thereby providing a new proof of the Mančinska-Roberson theorem and enabling a randomized polynomial-time algorithm for deciding the exact feasibility of these SDP relaxations.
This paper presents a resource-efficient quantum algorithm that solves the Travelling Salesman Problem for up to nine cities using a single qubit by leveraging quantum parallelism and optimal control methods based on a quantum Brachistochrone approach, demonstrating superior accuracy and potential polynomial speed-up over existing quantum and classical methods.
This paper demonstrates that quantum computers can achieve a super-polynomial sampling advantage over classical computers for Gibbs states of constant-temperature, O(1)-local Hamiltonians (specifically 5-local on a 3D lattice), even in the presence of imperfect measurements.