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 123
Scalable Passive QRAM
We present a blueprint for implementing the physical QRAM operation in a scalable, passive manner, proving its feasibility in principle.Unitary complexity in polynomial space
We show that if quantum commitments exist, then either there is no polynomial-time solution to the unitary synthesis problem, or $\mathsf{BPP} \neq \mathsf{NEXP}$.Quantum estimation, channel orders, and private capacity
Recent examples have shown that zero private capacity need not imply antidegradability and that two channels with zero private capacity can nevertheless transmit private information together.How to Build Pseudorandom Unitaries in Microcrypt
We provide the first evidence relative to a classical oracle that pseudorandom unitaries (PRUs) can exist without quantum-computable one-way functions.SpiderCSS: Scalable Fault-Tolerant CSS State Preparation
Fault-tolerant preparation of logical states is a critical primitive for the realization of large-scale fault-tolerant quantum computing.Predicting Noise in a Trapped-ion Quantum Simulation of a Lattice Gauge Theory
A recent trapped-ion experiment realised a lattice gauge theory in which the internal states of the ions carry the gauge field and their vibrations carry bosonic matter.Comment on ''Chiral electromagnetic surface waves on Chern-Simons interfaces'' Phys.Rev.D114(2026)L051903 and on arXiv:2606.12513 by N. Kaloper
We demonstrate that Maxwell electrodynamics interacting with a planar Chern-Simons interface does not have plane wave solutions localized on the interface.Driven-Dissipative Ground State Preparation: Mixing Time and Randomness
Dissipative protocols offer a route to ground state preparation that does not require a large initial overlap with the ground state.Realizing Braided Fusion 2-Categories as (3+1)D Mixed-State Topological Orders
We construct large families of mixed-state topological orders in (3+1)D, including intrinsically mixed-state topological orders.Modular Neural Decoder for Surface Code Memory and Logic on Superconducting Processors
Neural decoders for quantum error correction have achieved high accuracy on surface code memory experiments, but practical fault-tolerant computation requires decoders that transfer across devices…Time-dependent integrable quantum field theories with dynamical boundaries
We present a method for constructing time-dependent integrable chiral quantum field theories on a finite spatial interval from the scattering and reflection data of an autonomous integrable model.On Information Propagation in Krylov Subspaces
Krylov subspace methods provide an efficient tool for modeling any quantum initial value problem as a one dimensional chain.The ALPS project release 3.0: open source software for strongly correlated systems
We present release 3.0 of the ALPS (Algorithms and Libraries for Physics Simulations) project, an open-source software project to develop libraries and application programs for the simulation of…Robustness of Quantum Signal Processing and Resource-aware Polynomial Design
Quantum signal processing (QSP) realizes operator functions through polynomial transformations of a finite degree.Exact Temporal Criticalities of Entanglement and Negativity in Gaussian and Non-Gaussian Dissipative Kitaev Chains
When the two largest eigenvalues of an entanglement or negativity spectrum meet, the gap of the corresponding entanglement or negativity Hamiltonian closes while entropies stay smooth, an event we…Quantum-Assisted Optimization Guided by Machine-Learned Risk Maps for Aerial Surveillance Routing
Analog quantum computing with neutral atom computers is rapidly evolving into a promising way to perform combinatorial optimization tasks at scale.Efficient Quantum Monte Carlo through Cluster Expansions
The sign problem remains a major obstacle to extending the success of Monte Carlo methods to generic quantum many-body systems.Quantum Query Complexity and Span Programs from Pre-Geometry
Span programs provide a general method for designing quantum query algorithms, and for Boolean coordinate queries their optimum cost agrees with the general adversary bound.Magic Quantum Code Surgery
Non-Clifford operations required for universal quantum computation can be implemented by measuring logical Clifford operators.Benchmarking Ansatze for Pauli Correlation Encoding in the Maximum Independent Set Problem
The increasing complexity of 5G and emerging 6G wireless networks has intensified the need for scalable optimization techniques capable of addressing computationally challenging combinatorial…