6648 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 proposes a QUBO formulation to evaluate and compare classical metaheuristics and emerging quantum heuristics for optimizing the "Windbreaking-as-a-Service" highway platooning problem, establishing a common framework for heterogeneous solvers to address this challenge.
This paper presents a non-perturbative, first-principles framework demonstrating that off-resonant cavity coupling can significantly enhance the magnetic exchange interaction in correlated electron systems via a generalized Purcell factor, provided that both static Coulomb screening and dynamical vector potential effects are consistently accounted for in the presence of dielectric substrates.
This paper investigates noisy, stroboscopically monitored qubit systems using IBM quantum hardware and a statistical-physics model to demonstrate that while integer-quantized recurrence times are robust far from revivals, weak noise dramatically alters behavior near revivals by inverting expected dips into peaks due to a competition between measurement-driven infinite-temperature and relaxation-driven low-temperature steady states.
This paper establishes a fair benchmark for bivariate bicycle (BB) codes on the quantum erasure channel by correcting decoder-baseline biases and applying rigorous finite-size scaling to demonstrate that BB codes achieve an asymptotic threshold of approximately 0.488 with significantly lower normalized overhead compared to surface codes.
This paper utilizes a Delay Differential Equation framework to demonstrate that photon-echo synchronization in short quantum links creates persistent quasi-dark states, enabling STIRAP-based quantum state transfer to achieve superior quadratic infidelity scaling compared to other protocols across the full retardation regime.
This paper establishes a "no practical quantum broadcasting" theorem based on sample efficiency constraints, but demonstrates that while probabilistic virtual broadcasting remains fundamentally limited, approximate virtual broadcasting can achieve practical efficiency for qubit systems with sufficiently many receivers (e.g., 1-to-6).
This paper introduces and characterizes various models of active quantum particles driven by engineered dissipation, demonstrating that despite diverse microscopic mechanisms, they universally exhibit a crossover from diffusive to active-diffusive motion and a strong sensitivity to boundary conditions via the Liouville skin effect, while also discussing their quantum fluctuations, experimental realizations, and many-body implications.
This paper establishes the average-case hardness of decoding random quantum stabilizer codes as a novel post-quantum assumption that enables practical, round-optimal cryptographic primitives like public-key encryption and oblivious transfer, while demonstrating that this problem possesses a distinct symplectic structure that likely prevents reduction to the well-studied LPN problem.
This paper reviews variational and annealing-based quantum algorithms for combinatorial optimization, mapping their current maturity and benchmarking results to key industrial applications like logistics, finance, and telecommunications to bridge the gap between theoretical developments and practical relevance.
This paper presents an empirical method to identify low-weight error syndromes that cause slow convergence in belief-propagation decoding of quantum LDPC codes and demonstrates that augmenting the decoding matrix with specific fault columns significantly improves both convergence speed and logical error rates.