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 110
Error Mitigation From a Single Unmodified Error-Corrected Circuit
Recent work has shown that syndrome information obtained during error-corrected quantum computation can be utilized for logical error mitigation (LEM), yielding exponential reductions in runtime…Imaginary magnetic fields for ultracold atoms
We propose a four-level scheme for generating a uniform imaginary magnetic field for ultracold atoms using Raman coupling and state-dependent particle losses.Testing bosonic and fermionic Gaussian states with a constant number of copies
Bosonic and fermionic Gaussian quantum states are families of quantum states that play a central role in quantum physics and quantum information processing.From Quantum Tunneling to Classical Optimization through Instantons
We use an instanton-based analysis to show that Path Integral Stochastic Gradient Descent (PISGD), a classical optimization algorithm instantiated from path integral Monte Carlo (PIMC), can inherit…Bell nonlocality does not imply violation of nonlocal games
Nonlocal games offer a conceptually clear way to reason about Bell nonlocality.Tight bounds for hybrid quantum-classical query algorithms
We study hybrid quantum-classical algorithms in the query model.Polynomial-time classical algorithms for mean-field models up to the glass transition
The Sachdev-Ye-Kitaev model is a strongly interacting fermionic system that has been well-studied in condensed matter and high energy physics.Quantum 1-PCA with Pauli Measurements in Nearly Linear Time
We consider the problem of quantum 1-PCA: given copies of an unknown $n$-qubit mixed state, recover a classical description of its leading eigenvector.Finding Gaussian Structure in Bosonic States
We study agnostic tomography of pure bosonic Gaussian states: given copies of an arbitrary $n$-mode bosonic state $ρ$, the goal is to output a pure Gaussian state whose infidelity with $ρ$ is at…Polynomial-time simulation of non-Clifford quantum error correction
We show that every intermediate state of a broad class of non-Clifford quantum error-correction circuits is a third-order phase-polynomial state, even under stochastic Pauli noise.Protecting Quantum Computers against Untrusted Users
Publicly accessible fault-tolerant quantum computers must preserve scientific utility while limiting cryptanalytic power.CV-QAOA: Efficient Low-Depth Quantum Optimization of Continuous Variables
We study a Continuous-Variable Quantum Approximate Optimization Algorithm (CV-QAOA) for high-dimensional continuous optimization.The complete phase diagram of detailed-balanced Gibbs samplers for the mean-field Heisenberg model
We study the spectral gap of recently discovered families of KMS-detailed-balanced Gibbs-sampler Lindbladians for the mean-field Heisenberg model on $n$ spins.Improved bounds on stabilizer extent and Clifford rank
We prove that every pure state of stabilizer rank at most $k$ has stabilizer extent at most $2^{O(\sqrt{k\log(k+1)})}$, and establish the analogous bound for the squared Clifford coefficient norm of…Designing Group-Valued Codes with Full Regular Low-Weight Bases
Efficient fault-tolerant quantum computing architectures benefit from low-weight logical operators.Natural proofs for quantum state preparation lower bounds
We identify a barrier that helps explain why proving stronger quantum state-preparation lower bounds has been so difficult.The practical cost of magic state cultivation
Magic state cultivation is a promising method for preparing high-fidelity non-Clifford resource states - a central component of fault-tolerant quantum computing - with low spacetime overhead.Energy-constrained two-way capacities of pure-loss and quantum-limited amplifier channels
We determine the two-way quantum, entanglement-distribution, private, and secret-key capacities of the pure-loss bosonic channel under an unconditional mean transmitted-photon-number constraint.Distributional Quantum Query Complexity
Quantum query complexity enjoys a variety of pleasing joint computation properties: for example, a composition theorem asserting $Q(f\circ g)=Θ(Q(f)Q(g))$ for all Boolean functions $f$ and $g$; a…Semi-Cliffordness of the Clifford hierarchy for a single qudit in composite dimensions
An important question in quantum information theory asks whether every gate in the Clifford hierarchy is semi-Clifford or not, as such gates admit resource-efficient implementations via gate…