Topics / Quantum Physics / Oct 5 - 11, 2026
Weekly issue
Top 20 Quantum Physics Papers: Oct 5 - 11, 2026
- 1Efficient Block Encoding of Structured Hamiltonians By Separating Where and What
We construct permute-act-unpermute circuits whose CSWAP networks exploit the support geometry: a selected support is brought to a fixed target register, a shared local circuit acts there, and the permutation is undone.
- 2Efficient Quantum Monte Carlo Through Cluster Expansions
Here, we introduce a Markov chain algorithm that samples cluster expansions directly in the space of connected clusters, replacing deterministic enumeration by Monte Carlo sampling.
- 3Fault-tolerant and Fully Addressable Unitary Logical Gates Via Round-robin Sparsification
We introduce explicit low-depth unitary circuits that realize fully addressable and fault-tolerant two-qubit Clifford gates for a subset of two-dimensional translationally invariant qLDPC codes.
- 4The Complete Phase Diagram of Detailed-balanced Gibbs Samplers for The Mean-field Heisenberg Model
We study the spectral gap of recently discovered families of KMS-detailed-balanced Gibbs-sampler Lindbladians for the mean-field Heisenberg model on $n$ spins.
- 5Can The Quantum Fisher Effective Dimension Judge A Hybrid Quantum Neural Network?
Hybrid quantum neural networks (QNNs) pair a classical feature extractor with a variational quantum circuit, and the effective dimension of the circuit's quantum Fisher information matrix (QFIM) is widely used to assess such models.
Get papers like these the day they come out, not a week later.
Follow this category- 6Benchmarking Exchange-only Control of A 48-spin Singlet Manifold
Here, we apply this approach to arrays of up to 48 electron spins, accessing a total-spin-zero Hilbert space with dimension exceeding $2^{40}$.
- 7Root-sparsity Scaling for Hamiltonian Simulation, Differential Equations and Linear-system Solvers
We give quantum algorithms for Hamiltonian simulation, linear differential equations, and linear systems with square-root dependence on sparsity.
- 8Large-Scale Benchmarking of Quantum Neural Network Configurations for Financial Time Series Forecasting
This study presents a large-scale systematic comparative evaluation of QNN component configurations for financial time series forecasting, using the GBP/USD spot exchange rate as a case study.
- 9Learning Disentangled Representations with Quantum Variational Autoencoders
Such representations can facilitate the interpretation and controllable generation of data describing complex scientific systems. Understanding how these factors are organized and encoded in latent space is therefore important for developing reliable representation learning models.
- 10Out-of-control Hamiltonian Learning
Our protocols introduce new techniques for solving structured polynomial systems over an extensive number of parameters.
- 11Parameter-Dependent Noise Resilience in The Quantum Approximate Optimization Algorithm
We extend this analysis to the quantum adiabatic algorithm (QAA) by taking the continuous limit of the QAOA.
- 12Error Mitigation From A Single Unmodified Error-Corrected Circuit
Here, we introduce syndrome-based offline logical error mitigation (SOLEM), a framework that utilizes syndrome data entirely in post-processing, without any modification to the given error-corrected circuit.
- 13Computational Entanglement Distillation Beyond Pure States: Efficient Protocols and Fundamental Limitations
In this work, we address entanglement distillation from mixed states and identify the Rényi coherent information as the quantity determining the optimal rate in the worst case under two distinct resource constraints.
- 14Quantum Magic and The Strong Coupling Constant
Here we study magic production in the six flavor-diagonal color-singlet channels $q\bar q\to q\bar q$ at tree level, including photon, gluon, $W/Z$, and Higgs exchange.
- 15Heating and Escape of Confined Atoms Subject to Colored Noise
We study escape times of particles in softening potentials driven by power-law colored noise.
- 16From Static Lindblad Stabilizability to Robust Physical Control Sequences
Dissipative dynamics can stabilize a quantum target without providing a reliable sequence of finite control operations. We derive checkable conditions for implementing such stabilization with imperfect controls, with bounds on convergence, errors during operations, and physical cost.
- 17Measure Now, Mitigate Later: Virtual Error Cancellation for Logical Quantum Circuits
Specifically, we introduce virtual error cancellation: a method that, unlike previous bias-free approaches, operates entirely in classical post-processing on universal quantum circuits.
- 18The Power of Time Reversal in Hamiltonian Property Testing
However, in Hamiltonian property testing, the best known algorithms have $O(1/\varepsilon^2)$ total evolution time, unless it is possible to $\textit{reverse}$ the flow of time under the Hamiltonian. In this work, we prove that time reversal is necessary to close this gap.
- 19Visualizing Two Qubits
I propose a simple visualization for pure two-qubit states, constructed from three components: two Bloch balls for the marginal qubits (the mixed states obtained by ignoring the other qubit, respectively) and an entanglement component consisting of a rotoreflection and a contraction.
- 20Unitary Complexity in Polynomial Space
Along the way, we propose new definitions for the unitary complexity classes $\mathsf{unitaryP}$ and $\mathsf{unitaryPSPACE}$.