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 137
Distillation of N-Qubit Stabilizer States on a Star Network Topology
We introduce an entanglement distillation protocol that utilizes an arbitrary $[[n,k,d]]$ stabilizer code to convert $n$ raw copies of an $N$-qubit Greenberger-Horne-Zeilinger (GHZ) state into $k$…Verifiable quantum advantage based on polynomials with planted structures
A central question in the theory of quantum advantage is whether there are quantum advantage protocols with similar resource requirements as random circuit sampling that are also verifiable just…Fault-tolerant cost of shallow QAOA on near-symmetric optimization problems
Montanaro and Zhou proved that depth-one Quantum Approximate Optimization Algorithm (QAOA) finds the planted solution of certain near-symmetric constraint satisfaction problems with probability…A Few Constrain Many: Correlation-Enhanced Learning of Many-Body Quantum Systems
Discovering properties of many-body quantum systems is challenging because of the large number of parameters to determine.Fast and Sure-ious Quantum Process Tomography
Quantum process tomography (QPT) protocols are often designed by lifting quantum state tomography (QST) protocols through the Choi-Jamiolkowski isomorphism, at the cost of an extra step enforcing…Scaling law of variational quantum algorithms
We study scaling law of variational quantum algorithms by large-scale numerical experiments on combinatorial optimizations.Confocal imaging from biphoton correlations
Confocal microscopy provides optical sectioning for three-dimensional imaging but conventionally relies on point-by-point scanning and physical pinholes, limiting imaging speed.Haah's 3D cubic code thermalizes rapidly
Haah's 3D cubic code was introduced as a candidate for a self-correcting quantum memory in three dimensions, using the absence of string logical operators to obstruct thermal errors.Quantum Algorithms for Computational Fluid Dynamics
We present a comprehensive review of quantum approaches for solving partial differential equations (PDEs) arising in computational fluid dynamics (CFD).Single-shot state preparation threshold: rigorous theorem and statistical mechanical mapping
Preparing logical codewords with a single round of noisy syndrome measurements can reduce the time overhead of fault-tolerant quantum computation.The quantum query complexity of the semigroup product problem
We study the quantum query complexity of computing a semigroup product $x_1\cdots x_n$, when one query reveals one input element and the multiplication table is given.Logical information localisation in stabiliser codes via single-qubit measurements
Stabiliser path finding (SPF) has previously been introduced as a method to localise logical information in a stabiliser code undergoing loss onto a single pre-specified target qubit, using only one…Predicting properties of Scrooge ensembles with high accuracy and low sample complexity
The Scrooge ensemble associated with a density matrix $ρ$ is the maximally random ensemble whose average density matrix is $ρ$.Quantum state learning beyond approximate unitary designs
Approximate unitary designs reproduce the statistics of Haar-random unitaries to a given order and accuracy.An exponential query advantage from access to Stinespring dilation unitaries in quantum channel learning
We present a learning task for quantum channels that exhibits an exponential separation in query complexity (in terms of the number of qubits) between two access models: i) black-box channel access…Many-body topology in parity-preserving tensor networks
Planar parity-preserving tensor networks (ppTNs) admit a fermionic formulation in which the Gaussian, efficiently contractible limit is deformed by local interactions.Technical analysis of the Resource-efficient Quantum Walkers Quantum Random Access Memory
Quantum Random Access Memory (qRAM) is a critical component for achieving quantum advantage in algorithms ranging from database search to quantum machine learning.CSS codes for Quantum Metrology with Discrete-time Error Correction
The goal of quantum metrology is to estimate an unknown parameter with better-than-classical precision and, ideally, to attain Heisenberg scaling.Measurement-induced dynamics and emergent symmetries of particles moving in a one-dimensional lattice
Continuous measurements simultaneously reveal and modify the dynamics of a quantum system.Pauli instability in arbitrary states: detecting magic in physical correlators
Measures of non-stabilizerness (``magic'') of a quantum evolution quantify how hard it is to simulate on a classical computer.