QuDDPM: Can Diffusion Models Reverse Quantum Chaos?

February 10, 2026

Can a quantum neural network learn to undo chaos? And when it fails, does it fail at exactly the point physics says it must?

The Setup

In quantum mechanics, information scrambling is the process by which local quantum information spreads across an entire system until it becomes effectively irrecoverable from any subsystem. It's the quantum version of stirring cream into coffee — except the laws of quantum mechanics say the information isn't destroyed, just hidden.

This connects deeply to black hole physics. The ER=EPR conjecture links quantum entanglement to wormhole geometry, and scrambling is the mechanism by which a black hole processes information at the fastest possible rate. The scrambling time — how quickly information becomes inaccessible — is conjectured to be a fundamental bound of nature.

So I asked: if I build a variational quantum circuit (a parameterized "denoiser") and train it with a diffusion-inspired curriculum, can it learn to invert the scrambling unitary UscrU_{\text{scr}}? And more importantly — where does it fail?

How It Works

The architecture is a pipeline with three pieces.

1. The Scrambler

I implemented three scrambling methods to test against:

Random circuit unitaries — brick-layer patterns of random SU(4)\text{SU}(4) gates on neighboring qubit pairs, alternating even/odd offsets per layer. The standard model for quantum chaos in circuit-based systems.

Haar-random unitaries — completely random unitaries drawn from the Haar measure via QR decomposition. The theoretical "maximally scrambled" baseline, where:

UHaar(U(2n))U \sim \text{Haar}(\mathcal{U}(2^n))

SYK Hamiltonian evolution — an all-to-all 4-body interaction Hamiltonian with Gaussian random couplings:

HSYK=i<j<k<lJijklσiσjσkσlH_{\text{SYK}} = \sum_{i < j < k < l} J_{ijkl} \, \sigma_i \sigma_j \sigma_k \sigma_l

where JijklN(0,J2)J_{ijkl} \sim \mathcal{N}(0, J^2). This is the Sachdev-Ye-Kitaev model — it saturates the chaos bound and has direct connections to holographic duality. Time evolution is computed via matrix exponential:

U(t)=eiHtU(t) = e^{-iHt}

2. The Denoiser

The denoiser is a variational quantum circuit (the ansatz) built from alternating rotation and entangling layers:

Uθ=[=1LCNOTR(θ)]R0(θ)U_{\theta} = \left[\prod_{\ell=1}^{L} \text{CNOT}_\ell \cdot R_\ell(\theta)\right] \cdot R_0(\theta)

Each rotation layer applies Rz(α)Ry(β)Rz(γ)R_z(\alpha)\, R_y(\beta)\, R_z(\gamma) to every qubit — three parameters per qubit per layer. CNOT chains entangle neighboring qubits with alternating direction. For nn qubits and LL layers, the total parameter count is:

θ=3n(L+1)|\theta| = 3n(L + 1)

The circuit is initialized near identity (small random angles) so training starts from a gentle perturbation.