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 134
Resource-Tunable Quantum Circuit Implementation of Nonlinear Element-Wise Transformations
Nonlinear transformations are important in quantum machine learning and other quantum numerical applications, which can be reduced to the implementation of element-wise polynomials through…SQD-Agent: LLM-driven agentic framework for Quantum Chemistry workflows
Quantum algorithms and quantum hardware are advancing towards a promising paradigm for scientific applications.A Dichotomy for MIP* in the Presence of Unital Noise
A recent work studied quantum two-prover one-round proof systems $\mathsf{MIP}^ψ[\text{poly},O(1)]$.Information Potential: A Variational Approach to Quantum Information Complexity
Quantum information complexity (QIC), introduced by Touchette [Touchette, STOC 2015], has been shown to be one of the most powerful methods for proving quantum communication complexity and has also…Complete product-state contact set and optimality of the canonical three-qubit Shifts witness
For the three-qubit Shifts unextendible product basis (UPB), the minimum product-state expectation value $λ_{\mathrm{Shifts}}=1-3\sqrt6/8$ of the UPB projector is known, and four attaining product…Constant-Overhead Injection into Quantum Codes
We construct the first known fault-tolerant scheme for injecting states into quantum error-correcting codes with constant space and time overhead.Efficient Learning of Fermionic Magic States under Free-Fermion Evolution
We establish efficient learning for a family of fermionic magic states under unknown number-conserving free-fermion evolution.Spectrally Selective Charging of an Interacting Quantum Battery via an Anharmonic Mediator
We investigate a finite-time quantum-battery charging architecture in which a driven two-level working system transfers nonequilibrium resources to an interacting two-qubit battery through a weakly…Logical Operator Decomposition for Distance Analysis of Bivariate Bicycle Codes
Bivariate bicycle (BB) quantum codes are a prominent finite-length family of quantum low-density parity-check codes, but their minimum distance is usually established numerically rather than read…Square-root growth of operator entanglement in an integrable brickwork circuit
It is widely expected that the von Neumann entanglement of a local operator grows at most logarithmically in integrable many-body systems in infinite volume.Chiral quantum chaos around exponentially many zero modes in the quantum breakdown model
The quantum breakdown model is a model of randomly interacting fermions, motivated by the physics of dielectric breakdown.Genuine Multipartite Nonlocality Is Fermionic Magic
A system of free fermions can be simulated on a classical computer, and a single non-Gaussian state makes it a universal quantum computer.Reservoir- and Measurement-free Microwave Initialization of Semiconductor Spin Qubits
Scalable quantum processors require repeated qubit initialization throughout large arrays.Parallel classical simulation of noisy shallow circuits: no quantum advantage in 1D
We consider quantum circuits consisting of $d$ layers of nearest-neighbor two-qubit gates acting on $n$ qubits arranged on a line, where every qubit is independently depolarized with a constant…From Wavefunction Regularity to Eigenvector Conditioning: Accuracy--Cost Trade-offs of Quantum Algorithms for Non-Hermitian Transcorrelated Hamiltonians
The electron--electron Coulomb singularity forces cusp structure in electronic wavefunctions.A Quantum Scaling Algorithm for Maximum-Weight Perfect Matching in General Graphs
Quantum speed-ups have been obtained for many fundamental graph problems, including most variants of matching.Optimal Scaling of Unitary Design Formation in $U(1)$-Symmetric Random Circuits: A Bottleneck Slower than Charge Transport
Understanding randomness formation under conservation laws is important both for characterizing chaotic phenomena in isolated quantum systems and for symmetry-constrained quantum information…Excitation gap of a blockade structure with $\mathbb{Z}_2$ topological order
Mathematically rigorous statements on the spectral gap of quantum many-body systems in the thermodynamic limit are notoriously difficult to prove -- yet they are of fundamental importance for…Generation of large-amplitude squeezed cat states with near-unity efficiency
The Gottesman-Kitaev-Preskill encoding has emerged as a leading candidate for fault-tolerant quantum computation with continuous variables.On quantum interactive proofs with a laconic prover
Interactive proof systems with a laconic prover, studied by Goldreich, Vadhan, and Wigderson (CC, 2002), capture problems verifiable with logarithmic prover communication in the classical setting.