9259 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.
The paper proposes a hybrid VQE-CVQE algorithm that utilizes diabatic state preparation for parameterized unitary operators, demonstrating its effectiveness in achieving chemical accuracy on both intermediate-scale and future error-corrected quantum computers through simulations on the IBM Brisbane processor.
This paper proposes a scalable architecture for superconducting quantum processors that utilizes an on-chip nonreciprocal Josephson frequency multiplier as a universal control bus to enable frequency-multiplexed millimeter-wave qubit addressing, thereby drastically reducing wiring complexity and crosstalk while suppressing Purcell decay to achieve fault-tolerant gate errors.
This paper establishes the minimax sample complexity for locally-gentle quantum state certification, demonstrating that the constraint of limiting state disturbance to in trace norm incurs a sample size penalty of , resulting in a total complexity of and revealing a linear dependence on Hilbert-space dimension rather than the quadratic scaling typical of private estimation.
This study investigates how dipolar-induced nearest-neighbor pair tunneling in atomic Josephson junctions reshapes the equilibrium phase diagram and modifies dynamical properties, including macroscopic quantum self-trapping and dynamical quantum phase transitions.
This paper presents a noisy discrete-time theory and its experimental validation on a superconducting quantum processor with up to seven qubits, demonstrating that stochastic mid-circuit measurements and resets can successfully drive interacting quantum systems into nonequilibrium steady states that quantitatively match theoretical predictions and exhibit signatures of equilibrium quantum phase transitions.
This paper presents a scalable method for distributed quantum computing that reduces the classical reconstruction cost from exponential to polynomial by partitioning circuits based on a weak-coupling approximation, specifically demonstrated on layered circuits used in the quantum approximate optimization algorithm.
This paper proposes two complementary Rydberg atom simulator approaches—analog Möbius band geometry and digital Kibble-Zurek ramping—to efficiently characterize and experimentally probe emergent fermions in critical quantum many-body systems.
This paper introduces a new family of quantum low-density parity-check codes that achieve high performance and low overhead on planar grids using only nearest-neighbour gates, thereby overcoming the long-range connectivity limitations of superconducting architectures while significantly outperforming traditional surface codes.
This paper explicitly describes the Ricci flow for the Bures--Helstrom qubit metric, demonstrating that it evolves as a homothetic shrinker to a collapsed limit at time while remaining within the monotone cone, and analyzes its volume-normalized counterpart as a fixed point with a specific spectral gap.
This paper proves that efficiently deciding whether a quantum state has a large coefficient in the Pauli basis is impossible under the standard assumption that , as the problem is shown to be in but not in via a reduction from the minimum-weight code problem.