9427 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 utilizing a recirculating two-dimensional bricks waveguide mesh of Mach-Zehnder interferometers to implement quantum signal distillation protocols, demonstrating that this programmable photonic architecture can achieve complex transformations with reduced resource costs and optical depth compared to traditional feed-forward networks.
This paper benchmarks the trade-offs between native topological fusion readout and grouped-Pauli measurement strategies for Fibonacci anyon chains on NISQ hardware, revealing that the optimal method depends on the specific quantum circuit type (Floquet vs. VQE) and deriving scaling laws to guide shot-budget allocation for topological models on qubit platforms.
This paper demonstrates a scalable unified flux control architecture for fluxonium qubits that utilizes a single flux channel with cryogenic filtering and compensated waveform synthesis to simultaneously achieve high-fidelity transverse and longitudinal operations, active reset, and reduced hardware overhead while preserving coherence times above 100 s.
This paper proposes a training-free quantum generative paradigm that constructs a local parent Hamiltonian to encode target distributions in its ground state, enabling image and text generation through quantum superposition and entanglement without the need for parameter training.
This paper introduces an asymptotically optimal fermionic permutation protocol for 2D grid quantum architectures that achieves the theoretical depth lower bound without requiring ancilla qubits, mid-circuit measurements, or classical feedforward, while also enabling efficient transformations between major fermionic encodings and demonstrating significant performance gains for early fault-tolerant simulations.
This paper establishes the feasibility of applying quantum domain decomposition preconditioning to the Finite Element Method by deriving block-encoding bounds for the two-level Additive Schwarz preconditioner, analyzing its complexity via the Bramble--Pasciak--Xu approach, and detailing the operator implementations.
This paper introduces an efficient, locality-preserving algorithm that rounds any almost commuting 2-local qubit Hamiltonian to a nearby commuting one with a controlled error bound, thereby proving that ground energy approximations for such systems lie in NP and enabling applications in Gibbs sampling and Hamiltonian simulation.
This paper introduces efficient iterative optimization methods, primarily utilizing semidefinite programming and the method of moments, to determine optimal local Hamiltonians that maximize quantum Fisher information for metrological advantage and to identify bound entangled states that maximally violate the CCNR criterion.
This paper proposes a hybrid quantum-classical algorithm called Boson Sampling-Classic (BS-C) that utilizes linear optical interferometers and classical computational chemistry methods to solve molecular electronic structure problems with enhanced accuracy and error resilience, achieving chemical accuracy in numerical experiments.
ZAP introduces a co-designed zoned architecture and deterministic compiler for field-programmable atom arrays that achieves multi-order-of-magnitude compilation speedups (up to 10,000) while maintaining competitive execution quality by replacing iterative global searches with a single-pass, hardware-aware flow.