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 establishes a representation-theoretic framework using -stable irreducible representations to construct and characterize protected logical qudits in Kitaev quantum double models, demonstrating their existence for specific finite groups and outlining a path toward universal logical computation.
This paper extends a generalized Bethe ansatz framework to open boundary conditions with time-dependent bulk and boundary couplings, demonstrating that integrability leads to boundary quantum Knizhnik-Zamolodchikov (BqKZ) equations whose solutions yield exact wavefunctions and reveal that the dynamical invariants of the time-dependent model correspond to the renormalization group invariants of the associated static system.
This paper demonstrates that intrinsic magnetic-field gradients from residual nuclear spins in Si/SiGe double quantum dots can be utilized to perform exchange oscillations and characterize device parameters at zero applied magnetic field, offering a simple, high-throughput diagnostic tool for hybrid semiconductor-superconductor qubits without the need for micromagnets or complex calibration.
This paper presents a non-interactive, publicly verifiable protocol for unconditional certified randomness in the quantum random oracle model, achieving security against subexponentially-many adaptive quantum queries without relying on the Aaronson–Ambainis conjecture or restricting query depth.
This paper demonstrates that quantum generative models trained classically using moment-matching losses (like MMD) often fail to generalize well compared to likelihood-trained models, suggesting that the "train-classical, deploy-quantum" paradigm requires new approaches that directly target generalization rather than relying on converged training losses as a proxy.
This paper demonstrates that a dc-voltage-biased SQUID can engineer multi-photon dissipation (converting one, two, or four photons into a single lossy photon) while suppressing parasitic nonlinearities, offering a viable route for stabilizing cat qubits and reservoir engineering.
This paper establishes the algebraic structure of bosonic quantum error-correcting codes on genus-two Riemann surfaces by constructing code words as automorphic forms, while proving a fundamental no-go theorem that non-amenable stabilizer groups on higher-genus surfaces preclude the existence of normalizable exact code states, thereby distinguishing them from standard GKP codes.
This paper presents a quantum computing framework that utilizes an auxiliary two-level pseudomode to simulate both Markovian and non-Markovian open quantum dynamics relevant to heavy-ion collisions, thereby enabling future studies of hard probes like jets and heavy quarks.
This paper demonstrates that specific families of 1D and 2D universal Hamiltonian simulators can efficiently simulate any target local Hamiltonian, including those with general connectivity, by employing a nonperturbative method that reduces the resource overhead from exponential to polynomial scaling.
This paper demonstrates that while finding local energy minima in quantum systems is computationally hard for classical computers, it can be efficiently solved by quantum computers using a thermal gradient descent algorithm, thereby establishing a scenario where quantum computation outperforms classical computation even for tasks simpler than finding ground states.