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 139
Quantum Advantage of Permutation-Invariant Functions in Communication Complexity
We study how symmetry affects quantum advantage in two-party communication complexity.Optimal Resource Scaling for Early Fault Tolerant Iterative Quantum Phase Estimation under Cost Error Tradeoffs
The iterative quantum phase estimation algorithm (IPEA) is better suited for NISQ and early fault-tolerant hardware compared to the original algorithm, which requires the inverse quantum Fourier…Smite: A quasiclassical trajectory (QCT) program for bimolecular collisions and unimolecular dynamics on ab-initio, and machine-learned potential energy surfaces
We present Smite, a Python toolkit for quasiclassical trajectory (QCT) simulations of reactive and inelastic bimolecular collisions, unimolecular dynamics, and molecular collisions with finite…Fast Cliffords When Your Quantum Memory Is Full
Additional qubits can reduce the depth of a quantum circuit by providing workspace for parallel computation, but standard constructions assume that this workspace is initialized in a known state.QuLoC: Photonic Quantum-Assisted Low-Rank LLM Compression
As LLMs grow in size, compression becomes increasingly important for efficient deployment.Quantum Černý complexity of binary words
We introduce the quantum Černý complexity $\mathrm{qc}(w)$ of a binary word $w$: the least dimension $d$ for which there exist quantum channels $A_0,A_1$ on $d\times d$ density matrices and a start…Classical and Quantum Simulation of All-to-All Quantum Dynamics in Logarithmic Space
We study both the classical and the quantum complexity of the problem of estimating disorder-averaged quench dynamics for all-to-all spin Hamiltonians such as quantum Hopfield…Spectral gaps and slow modes of Pauli rotations and random quantum circuits
We determine which representation sectors control the slowest convergence of random Pauli rotations and several local random quantum circuits.Shadow Quantum Singular Value Transformation with Shallow Quantum Circuits
We introduce shadow quantum singular value transformation (Shadow QSVT): given an initial state $|ψ\rangle$, a Hermitian matrix $H$, a polynomial $f$, and a set of observables $\{O_1,\dots,O_m\}$…Non-Markovian dissipation as a resource for quantum reservoir computing
The control of open-system dynamics provides a powerful mechanism for using quantum information to process sequential tasks.Practical fermionic shadows enabled by improved sample-complexity bounds
Classical shadow tomography is widely touted as supplying a family of methods for extracting information from quantum systems with polynomially scaling sample-complexities.Dissipation accelerates quantum and classical simulation of open-system dynamics
Simulating open quantum systems reveals how environmental coupling shapes relaxation, excitation transport, and the dynamics of quantum correlations.Breaking the Multiplicative Overhead in Quantum Entropy Estimation
The von Neumann, Tsallis, and Rényi entropies are fundamental measures of quantum information.Improved Quantum Query Bounds for Boolean Matrix Product Verification
We prove the first non-trivial upper bound for the quantum query complexity of Boolean Matrix Product Verification ($\mathsf{BMPV}$), answering a longstanding open question in quantum query…A mixing time method for estimating the sample complexity of quantum state discrimination
We develop a mixing time method for estimating the sample complexity of quantum state discrimination.More is Less:Optimal Security for Haar Quantum Money and More
Quantum cryptography leverages unclonability to enable a wide range of cryptographic applications that are impossible classically, such as digital currency protected against counterfeiting by…The Structure of Higher-Order Quantum Resources with an Application to Coherence
We develop a general framework for higher-order quantum resources that treats the resourcefulness of quantum states, channels, and supermaps (also called processes) in a unified manner.Fast classical simulation algorithms for free-fermion dynamics with magic input
The classical cost of simulating free-fermion (matchgate) circuits depends on both the input state and the computational task.Query-Limited RAM Programs and their Applications
Quantum one-time programs (Broadbent, Gutoski and Stebila, CRYPTO 2013) or OTPs for short, enable a functionality to be encoded into a quantum token that can be evaluated on a single chosen input…Generalized Reimpell-Werner Iteration
Quantum measurements and channels determine how information is extracted, encoded, and transmitted in quantum protocols.