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 108
GPU-Initiated Discrete Simulated Bifurcation: Low-Latency Requests and Streaming Dense Couplings
GPU-based optimization faces two communication bottlenecks: coordinating frequent requests and delivering dense models that exceed device memory.Large Language Model-Guided Discovery of Weight-Five Bivariate Bicycle Codes
Building on our earlier program-evolution workflow guided by large language models (LLMs), we study weight-five bivariate bicycle (BB) and perturbed bivariate bicycle (PBB) codes.Destroying and Preserving Measurement Incompatibility over a Quantum Channel
A quantum channel is called incompatibility-breaking if it always destroys the incompatibility of quantum measurements.Kramers' Theorem Leaves a Topological Footprint in Classical Records
Time reversal $Θ$ squares to $-1$ on a half-integer spin, so every state is orthogonal to its time reverse.Quantum Gibbs State Preparation via Relative Decoding: From Fast-Mixing Sources to Broader Target Classes
Provable guarantees for preparing quantum Gibbs states, such as rapid mixing or gapped coherent preparation paths, are known only for restricted Hamiltonian families and usually must be re-derived…Interacting quantum criticality with U(1) symmetry breaking in 1+1 dimensions
The Hohenberg-Mermin-Wagner theorem motivates the expectation that continuous symmetries remain unbroken in one-dimensional quantum ground states.Climbing the Fusion Tree: Center Ordering and Decoding Hierarchy in Non-Abelian Mixed States
We develop an operational approach to strong-to-weak spontaneous symmetry breaking (sw-SSB) of a non-Abelian symmetry group G. We formulate it as the decoding task of distinguishing two strongly…Measurement-free Preparation of Surface-Code States with Digital-Analog Counterdiabatic Drivings
Preparing stabilizer-code states with shallow circuits is an important primitive for near-term quantum error correction in superconducting circuits, where logical-state initialization requires…A Cohomological Characterization of the Clifford Hierarchy
The Clifford hierarchy plays a central role in fault-tolerant quantum computation, but its higher levels remain only partially understood.Random-Oracle Unitary Synthesis is Impossible
A major open problem in quantum complexity is the question of unitary synthesis---namely, is it possible to efficiently implement any unitary, given the ability to evaluate any classical function in…Optimal compression with quantum retrieval
We consider the following data compression problem.Out-of-control Hamiltonian Learning
Learning the Hamiltonian of a many-body system from its dynamics is a central task in quantum science, yet the algorithms with the strongest provable guarantees assume some level of quantum…Tight Query Lower Bounds for Quantum Sampling, with an Application to Certified Randomness
Random circuit sampling experiments, the leading demonstrations of quantum computational advantage, are tested with the linear cross-entropy benchmark (XEB), which scores outcomes by their ideal…Certifying Measurement Incompatibility under Bounded Classical Communication
Measurement incompatibility enables quantum advantages in communication and state discrimination.Approximate cloning of structured pure states
The no-cloning theorem is a cornerstone result in quantum mechanics that forbids copying of general quantum information.Random Order in Quantum Streaming: Replenishment and Robust Lower Bounds
How can random order change the role of quantum memory in streaming?Qubit CSS codes with Universal Transversal Gates
The Eastin-Knill theorem rules out a universal set of transversal logical gates on any code that detects single-qubit errors.Streaming Regev's Quantum Factoring Algorithm
A major practical obstacle to Regev's factoring algorithm is its large space usage.Characterizing Photonic Partial Distinguishability Through Gram Matrix Tomography
Partial distinguishability affects multiphoton interference, which is central to large-scale photonic experiments such as Boson Sampling and to applications of multiphoton states across quantum…Anti-symmetrization is cheap and useful
We consider the computational task of anti-symmetrization of an unknown mixed quantum state: Given iid copies of a rank-$r$ qudit state $ρ=\sum_{i=1}^r λ_i |\varphi_i\rangle\!\langle\varphi_i|$…