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 165
One-shot Routing in Quantum Networks
Distributed quantum computation requires many entangled pairs to be available simultaneously, so routing must optimize fidelity from a fixed, short-lived set of network resources rather than the…Observation of universal hierarchical relaxation in a quantum simulator
Autocorrelation functions play a key role in the theoretical characterization of the dynamical properties of interacting many-body quantum systems.A Block Decomposed QUBO Workflow for Chromosome-Y Phylogeny Reconstruction
This paper sets out a computational workflow that reconstructs the phylogeny of human Y-chromosome populations from a Variant Call Format (VCF) file of biallelic Single Nucleotide Polymorphisms (SNP).Avoided crossings in spin-boson systems: consequences for adiabatic state preparation
Avoided crossings in the correlated many-body spectrum play a central role in determining the conditions for adiabatic state preparation in interacting quantum systems.Efficient Synthesis of Multi-Controlled Toffoli Gates with Ternary Clifford$+P_9$ Gates
Temporary occupation of qutrit levels can reduce the width and depth required for binary circuit logic in quantum computing.The regularized channel Rényi divergence is continuous
We show that the regularized channel Rényi divergence is continuous at $α= 1$.Syndrome measurements enable deterministic fault-tolerant $T$ gates
Non-Clifford gates are essential for universal quantum computation, yet implementing them fault-tolerantly remains a central challenge for stabilizer codes.Computational Cryptography from Pseudoentanglement
The advent of pseudoentanglement and computational entanglement theory bootstrapped a wave of research at the intersection of computer science and information theory.All you need is the universal correlation detector: A unified approach to universalize communication protocols over quantum channels
Constructing optimal quantum information protocols without complete knowledge of the underlying states or channels is a central challenge.Analytic detector responses and entanglement in constant-curvature spacetimes
We derive analytic response functions for Unruh--DeWitt detectors coupled to real, massless, conformally coupled scalar fields, to distinguish the effects of the field spectrum and global geometry…Beyond Bond Gauge: Exact Tensor-Network Tangent Spaces at Weighted Graph States
For normal PEPS, the fundamental theorem settles at the finite level whether virtual-bond gauge exhausts a tensor network's representation freedom.Design Principles for Ultra-High-Rate Quantum Codes
Reducing the qubit overhead of quantum error correction is a central challenge for scalable fault-tolerant quantum computing.Leg-Tied Tensor Network States: Entanglement Beyond Virtual Bonds
We introduce a class of tensor-network states in which physical legs are shared among local tensors, termed leg-tied tensor ansätze (LETTA).MQSS-Selector: RL-Guided Pass Selection for an MLIR Compilation Pipeline
High Performance Computing (HPC) and Quantum Computing (QC) systems are increasingly converging towards unified High Performance Computing-Quantum Computing (HPCQC) infrastructures, driven by a…Transport and Channel Normal Forms for Clifford Interactions
We study how Clifford interactions with a fixed environment determine quantum transmission, in a setting that extends positive discrete quantum convolution .Collective thermalization, work reliability, and resource bounds in a population-inverted Dicke Otto engine
Population inversion and collective relaxation can both enhance the performance of a quantum heat engine, but through distinct mechanisms.A General Composition Theorem for Approximate Degree
A longstanding open question in Boolean function complexity asks whether approximate degree composes multiplicatively under block composition.Optimal Two-Qubit Gate-Cutting Cost and Measures of Nonlocality
Circuit cutting enables quantum computations to be decomposed into smaller subcircuits at the cost of additional sampling overhead.Disorder-induced quantum Fisher information in topological quantum systems
The topological order of the Kitaev toric code is insensitive to disorder in its couplings since all star and plaquette operators commute; consequently, the stabilizer ground-state manifold is…Proper Agnostic Learning of Matrix Product States and Tree Tensor Networks
We establish proper agnostic learning of matrix product states and tree tensor networks.