Quantum Physics · Physics & Astronomy
Quantum Physics
The newest papers in Quantum Physics that ReadSearch has read, newest first. Each links to its own page, with its authors, date, where it was published and the original.
3,630 papers, from 4 September 2026 to 5 November 2026: 3,630 arXiv preprints.
Get the few papers worth your time in Quantum Physics every morning.
Follow Quantum Physics and ReadSearch reads its new papers each day, then brings you the few worth reading, each with its key finding in a sentence.
Newest papers, page 141
Superlinear Quantum Query Lower Bounds for Subgraph Detection
Subgraph detection asks whether an $n$-vertex graph, accessed through queries to its adjacency matrix, contains a copy of a fixed graph $H$.Two-Stage Quantum-Classical Distribution Network Reconfiguration via Cycle-Edge Encoding
Distribution network reconfiguration (DNR) is a combinatorial optimization problem that seeks a low-loss network topology subject to topological and electrical operating constraints.Compatibility of quantum instruments
Measurement compatibility asks whether a family of quantum measurements can be simulated by one parent measurement followed by classical post-processing.Long-lived divergence from equilibrium of electrons, nuclear spins and lattice for a solid state ion trap at low temperature
A fundamental problem in physics as well as engineering is equilibration.Testing quantum Gaussianity with constant sample complexity
Efficiently testing whether a quantum state possesses a given structure is both a fundamental and a practical task in quantum information.Refined sample complexities from the tomographic rate function
Protocols for quantum state tomography can be characterized either by their sample complexity or by the tomographic rate function that governs the large deviation behaviour of error estimates.Exponential Quantum Advantage in Numbers-on-Forehead Communication
We give the first exponential quantum advantage in the general interactive three-party Numbers-on-Forehead (NOF) model for a decision problem.Conditioning-Free Non-Uniform Quantum Fourier and Chebyshev Transforms
We present an efficient quantum algorithm for the non-uniform Chebyshev transform.Computational Bounds for $f$-Routing
The $f$-routing protocol is a leading candidate for quantum position verification (Kent, Munro, and Spiller, 2011), but security guarantees for explicit functions remain limited.Classical simulation of coherent crosstalk in surface codes
We give a polynomial-time classical algorithm which samples from the syndrome distribution of a surface code state corrupted by coherent nearest-neighbor $ZZ$ crosstalk.Memory dimension detection in open quantum dynamics via pseudo-control
Characterising open quantum dynamics requires identifying the environmental degrees of freedom that shape the system's evolution.Distinguishing Coherent Crosstalk from Calibration Drift via Pauli-Transfer Signatures and Quantum Edge Detection
Multi-tenant quantum processors expose a pulse-level attack surface in which coherent crosstalk can mimic benign calibration drift at matched average gate infidelity.Verifiable Quantum Advantage and Computation via Quantum Circuit Obfuscation
We construct protocols for classically verifiable quantum advantage and classical verification of $\mathsf{BQP}$ computations using \emph{quantum indistinguishability obfuscation} (qiO).Quantum Fine-Grained Lower Bounds for SetDisjointness via Sub-Linear Reductions from 3SUM
In classical fine-grained complexity, the 3SUM Conjecture is used to prove a variety of conditional lower bounds on data structure and graph problems via an initial reduction to the SetDisjointness…The power of constant-depth quantum circuits of unbounded size
Classical circuits with unbounded fan-in can compute any Boolean function in constant depth when their size is unrestricted.Need for Coherent Access in Constructing Quantum Cryptography
We construct quantum oracles relative to which quantum-secure one-way functions (OWFs) exist but pseudorandom states (PRSs) with superlogarithmic output length do not.Solving Sparse SDPs in Sublinear Time: A Classical Algorithm Inspired by the Quantum OR Lemma
We give the first sublinear-time classical solvers for sparse semidefinite programs in the bounded-radius regime, without low-rank assumptions or Frobenius norm dependence on the constraint matrices.A fully Gaussian quantum Stein's lemma
A central yet mysterious problem in quantum information is the asymptotic distinguishability of quantum states under restricted measurements.Decoupling of the QAOA into independent spin-boson systems and high-depth performance on pure and mixed spin glasses
The Quantum Approximate Optimization Algorithm (QAOA) is regarded as a promising candidate for near-term quantum advantage in combinatorial optimization, yet our ability to study it at scale is…Planted Cliques and Quantum Symmetry-Adapted Measurements
We study how quantum encodings and symmetry-adapted measurements preserve information for planted-clique detection from one classical graph.