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 introduces a generalized spin-boson mapping that decouples QAOA on large spin glasses into independent systems, enabling efficient tensor network calculations of energy at high depths and large scales, though it does not eliminate the need for quantum computers to sample final bitstrings.
This paper investigates the power of constant-depth quantum circuits with unbounded size, demonstrating that they can exactly implement arbitrary permutations, diagonal unitaries, and state preparations using exponentially many gates and ancillas, while also providing an -depth port-based teleportation scheme for approximating arbitrary unitaries, though the exact constant-depth implementation of general unitaries remains an open problem.
This paper constructs protocols for classically verifiable quantum advantage and the verification of BQP computations using quantum indistinguishability obfuscation (qiO), providing a rigorous cryptographic foundation for heuristic proposals and achieving the first publicly verifiable BQP verification under standard computational assumptions.
This paper presents a structural verification framework that distinguishes coherent crosstalk from benign calibration drift in multi-tenant quantum processors by leveraging the invariance and local observability of antisymmetric cross-weight features within the residual Pauli transfer matrix.
This paper presents a polynomial-time classical algorithm for simulating surface codes under coherent nearest-neighbor crosstalk, while demonstrating that the simultaneous presence of single-qubit coherent noise and crosstalk renders efficient classical simulation impossible unless the polynomial hierarchy collapses.
This paper establishes unconditional resource lower bounds for the -routing quantum position verification protocol by introducing new techniques that bypass traditional communication-complexity limits, demonstrating that high success probability against uniformly generated attackers implies specific computational complexity constraints on the function depending on the adversary's strategy type.
This paper presents an efficient, conditioning-free quantum algorithm for the non-uniform Chebyshev transform that achieves -accurate block encoding with qubits and gates by improving non-uniform node sampling and explicitly constructing necessary oracles.
This paper presents polynomial-time quantum algorithms for computing minimum generating sets of solvable and black-box groups by leveraging chief series and constructive membership techniques, while also establishing that the problem for general black-box groups lies in .
This paper develops a unified general theory for multi-resource quantum resource theories involving finite-group asymmetry, demonstrating that when symmetry information is asymptotically accessible to control free operations, the conversion rate of the combined theory equals the minimum of the constituent rates without additional cost, while identifying specific compatibility conditions for cases like thermal operations where such access is limited.
This paper presents an optimal quantum algorithm that solves the $st$-transport problem on flat connection graphs—where edges carry unitary labels forming a consistent gauge—in time and polylogarithmic space, generalizing classical $st$-connectivity to the quantum domain.