10088 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 demonstrates a scalable strategy for implementing robust two-qubit gates with fidelities exceeding 99.9% between the electron and nuclear spins of Germanium-vacancy centers in diamond using quantum optimal control, thereby addressing a critical requirement for distributed quantum computing and quantum repeaters.
This paper proposes moiré superlattices as a novel, scalable solid-state platform for quantum optics, offering arrays of nearly identical artificial-atom emitters with tunable spacing and broad spectral coverage to overcome the fabrication challenges of traditional quantum dot arrays.
This paper presents a systematic improvement to quasiparticle nuclear Hamiltonians for quantum computing by applying Brillouin-Wigner perturbation theory and a mean-field Hartree-Fock approximation to accurately describe open-shell nuclei in the $sd$ shell with minimal error, thereby enabling efficient quantum simulations on near-term devices.
This paper demonstrates analytically and numerically that a local quantum quench in XX-spin chains with open boundary conditions can prevent thermalization and induce a strong violation of the eigenstate thermalization hypothesis, even when weaker versions of the hypothesis typically hold in integrable systems.
This paper demonstrates that traditional T-depth metrics fail to predict fault-tolerant quantum execution slowdown under magic-state delivery constraints, proposing instead a model using slack ratio and Delta_max to accurately forecast scheduling stalls and establish provable lower bounds on execution time.
This study demonstrates that increasing the penalty coefficient in weighted graph bipartitioning problems generally improves the sampling fairness of quantum annealing across most instances, despite the trade-off of reduced ground-state probability under practical conditions.
This paper demonstrates that by imposing specific momentum correlations among Volkov states, a charged lepton in an electromagnetic plane wave can form a structured wavepacket whose probability-density peak travels at an arbitrary, tailored velocity independent of the field amplitude and the standard expectation value.
This paper proposes a synthesis scheme using controlled increment (CINC) and local gates to construct universal high-dimensional bipartite quantum circuits, achieving an optimal upper bound for general gates and significantly reducing the CINC gate count to just two for controlled operations.
This paper presents a systematic experimental study demonstrating that the combined presence of noisy classical inputs and quantum hardware noise significantly degrades the training stability and classification accuracy of variational quantum classifiers, highlighting the critical need to evaluate both noise sources simultaneously in NISQ-era machine learning.
This paper presents a fast, memory-efficient, and unitarity-preserving numerical method for simulating the closed Tavis-Cummings model beyond the rotating-wave approximation by exploiting a re-indexing basis transformation that reduces computational complexity to linear time and memory scaling.