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 128
Superintegrability of a resonant ghostly tri-Hamiltonian model: polynomial first integrals and transcendental completion
We study classical and quantum superintegrability of a resonant three-dimensional Hamiltonian with indefinite kinetic energy and three Poisson descriptions of the same flow.Exponential quantum advantages for decoded quantum interferometry in the streaming setting
Decoded quantum interferometry (DQI) is a polynomial-time quantum algorithm introduced by Jordan et al. (Nature 2025).Loss-tolerant distributed lattice surgery using fusion networks
Networking matter-based quantum processing units (QPUs) offers a promising route to scaling fault-tolerant quantum computers.Avoiding Exponentially Large Groups with Open Quantum System Technology
We propose a novel approach to state preparation by embracing the full power of open quantum systems.Optimal query complexity for fractional quantum evolution
Given oracle access to an unknown unitary $U=e^{iH}$ , the fractional query problem asks how many queries are required to implement a noninteger power $U^t=e^{itH}$, $0<t<1$, when the spectrum is…Universality Sacrifices Reliability in Classical-Quantum Channel Coding
Universal channel coding enables communication without a complete description of the channel.Hardware-Efficient Ground-State Preparation using Variational Imaginary-Time Majorana Evolution
Compact ground-state preparation circuits are essential for early fault-tolerant quantum chemistry.Fully tolerant product state testing and closest product state learning
We address the problem of testing whether an unknown $n$-qudit state $ρ$ is $a$-close to a product state or $b$-far away from any product state, as measured in terms of state overlap.On the Metastability of the Mean-Field Interchange Model for Local Dimension $\geq 3$
Many quantum systems are believed to thermalize slowly at low temperatures due to the existence of metastable phases.Geometry of Knill-Laflamme Coefficients for Pauli Error Detection
Knill-Laflamme coefficients characterize exact quantum error detection through scalar compressions of error operators to the code space.Operational transformation rates of quantum states
Typically, multiple copies of a quantum state are described by a tensor power of that state.(A Variant of) Clifford Circuit Synthesis is NP-Complete
Optimal circuit synthesis is the problem of finding the shortest-depth circuit representation of a given functionality with respect to a pre-specified elementary gate set.Sparse Hamiltonian simulation with optimal dependence on the maximum column Euclidean norm
We give a quantum algorithm for simulating a $d$-sparse Hermitian Hamiltonian $H$, assuming a known upper bound $Λ$ on its maximum column Euclidean norm $\|H\|_{1\to2}$.Adaptivity is all you need: Optimal stabilizer learning using just single-copy measurements
Stabilizer states are central to quantum computing, underlying quantum error correction, benchmarking, and efficient classical simulation.Nonlocality without entanglement for multipartite quantum measurements
We show that a pair of two-qubit product measurements can be perfectly distinguished when accessed jointly, yet cannot be perfectly distinguished when their local components are distributed between…Complexity and Applications of Nearest Stabilizer Product State Problems
Consider the following optimization problem over stabilizer product states: given an $n$-qubit stabilizer state $\left|ψ\right\rangle$ and a set of single-qubit stabilizer states $S$, maximize…Fermionic Gaussianity can be tested with mode-independent sample-complexity
Deciding whether an unknown quantum state either belongs to, or is far from, a given family of states is a natural question of quantum information theory.Stark effect of hydrogenic ions as a test of the indefinite-metric formalism of the eight-component relativistic wave equation for spin-$\frac{1}{2}$ particles
The eight-component relativistic wave equation for spin-$\frac{1}{2}$ particles of Robson and Staudte (FV$\frac{1}{2}$), a Feshbach--Villars linearization of the Feynman--Gell-Mann equation…Sequential Capacity of Quantum Processes with Finite Memory
How complex can the responses of a quantum device become as it runs longer with a fixed internal memory?Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity
Fermionic non-Gaussianity is a resource for universal quantum computation that can be generated by interactions in quantum many-body systems.