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 122
Quantum Codeword Sensing
Consider the task of identifying an unknown classical codeword delivered to a register of quantum sensor qubits through a sequence of weak phase interactions that each encode one bit.Lie Algebraic Uncertainty Relations
Uncertainty relations impose fundamental constraints on quantum observables, yet optimal bounds are needed to determine their incompatibility through the minimum attainable uncertainty.BARC codes: general polynomial framework for coherent-state superposition codes
We introduce an algebraic framework for constructing a new class of quantum error-correcting codes, bosonic algebraically-restricted constellation (BARC) codes.Optimal kernel functions for linear combination of Hamiltonian simulation
Linear combination of Hamiltonian simulation (LCHS) provides an asymptotically optimal framework for the quantum simulation of linear non-unitary dynamics.Classical Algorithms for Bipartite Quantum Max-Cut on Dense Expanders
Quantum Max-Cut is a well-studied local Hamiltonian problem for which the classical complexity of the bipartite case remains open.Quantum simulation of field-tunable spin spectroscopy of the quantum magnet Cs2CoCl4 on a trapped-ion quantum computer
The collective excitation spectra of quantum magnets provide a direct test of quantum computers as tools for studying strongly correlated matter.Ordering-Aware Theory of Trotter Error
Product formulas are a basic tool for simulating quantum many-body dynamics, but a fundamental degree of freedom in their application---the ordering of Hamiltonian terms---has remained largely…Quantum Simulation on Riemannian Manifolds
We investigate algorithms for the quantum simulation of the Schrödinger equation on a Riemannian manifold, where the kinetic operator is defined by the Laplace--Beltrami operator corresponding to…Efficient capacity-achieving entanglement generation with application to pure-loss Bosonic channels
While the ultimate limits on the rate of quantum communication over noisy channels are well-established, very few efficient coding schemes achieving these limits are known.How I Learned to Stop Worrying and Love the Redfield Equation: Completely-Positive Resummation of Non-Markovian Dynamics
The Redfield equation with time-dependent coefficients (or TCL2 equation) gives one of the simplest perturbative descriptions of open quantum system dynamics derived from a microscopic theory.Exact Recovery for Non-Abelian Surface Codes
We study exact recovery for non-Abelian topological surface codes based on the quantum double $D(G)$ of any finite group $G$.Low-Overhead Quantum Error Correction with Boundary-Connected Planar Modules
Realizing practical quantum computers requires quantum error correction, but the most widely implemented approach, the planar surface code, demands a substantial physical qubit overhead.Modified logarithmic Sobolev inequality for 1D non-commuting Hamiltonians
Given a finite-range, non-commuting Hamiltonian on a 1D chain of finite spins, we prove a modified logarithmic Sobolev inequality with constant $Ω(1/\log n)$ for the heat-bath dynamics, a…Single-Shot Error Correction at Optimal Spacetime Cost
Recent work established that, for independent erasures, storing $K$ logical qubits for $S$ time steps with error at most $\varepsilon$ requires a spacetime cost of $Ω(S(K+\log(S/\varepsilon)))$.Efficient Block Encoding of Structured Hamiltonians by Separating Where and What
In fault-tolerant block encodings of structured Hamiltonians, the support geometry can set how the non-Clifford cost of SELECT scales with the system size, however many operators act on each support.Universal Bounds for Out-of-Distribution Unitary Learning
How much can the action of an unknown unitary dynamics on one family of states reveal about its action elsewhere?An operational characterization of finite-dimensional quantum theory
A key goal in the foundations of quantum mechanics is to identify operational constraints characterizing physical theories.Maximum-Entropy Extension of Quantum Correlation Functions from Short Real-Time Dynamics
Correlation functions are central to understanding the behavior of quantum systems, with their spectra giving direct access to quasiparticle and collective excitations.On The Complexity of Redundancy-Free Quantum Hamiltonians
We consider a class of redudancy-free Hamiltonians, which are those where the trace vanishes for any product of Hamiltonian terms in which at least one term appears an odd number of times.Exponential lower bounds on the fermionic Gaussian rank of magic states and the bosonic coherent state rank of Fock states
Recent algorithms for classical simulation of quantum mechanics have runtime whose superpolynomial component is given by a linear dependence on the number of terms required to write large tensor…