The experimental implementation of a quantum algorithm requires the decomposition of unitary operators. Here we treat unitary-operator decomposition as an optimization problem, and use a genetic algorithm---a global-optimization method inspired by nature's evolutionary process---for operator decomposition. We apply this method to NMR quantum information processing, and find a probabilistic way of performing universal quantum computation using global hard pulses. We also demonstrate the efficient creation of the singlet state (a special type of Bell state) directly from thermal equilibrium, using an optimum sequence of pulses.The experimental implementation of a quantum algorithm requires the decomposition of unitary operators. Here we treat unitary-operator decomposition as an optimization problem, and use a genetic algorithm---a global-optimization method inspired by nature's evolutionary process---for operator decomposition. We apply this method to NMR quantum information processing, and find a probabilistic way of performing universal quantum computation using global hard pulses. We also demonstrate the efficient creation of the singlet state (a special type of Bell state) directly from thermal equilibrium, using an optimum sequence of pulses.

arXiv:1205.4294Physical Review AAug 22, 201224 citations

Quantum impurity models: easy at equilibrium, universal in motion

Srinivasan Arunachalam, Sergey Bravyi, Anirban Chowdhury +3 more

A quantum impurity model describes a small interacting subsystem embedded into a large bath of free fermions. Here we study the computational complexity of calculating the ground energy, thermal equilibrium, and dynamical properties of these models. Our work reveals a sharp contrast: equilibrium properties can be efficiently approximated by classical means, whereas time evolution can implement a universal quantum computation. More precisely, let $H$ be the Hamiltonian of an impurity model with $n$ fermionic modes and a constant-size impurity. We show that: (1) the ground energy of $H$ can be approximated to additive error $\varepsilon$ by a classical algorithm with runtime $\textsf{poly}(n,1/\varepsilon)$ , improving on the quasi-polynomial runtime of the best previously known algorithm; (2) at inverse temperature $β$ , the Helmholtz free energy and a classical description of the thermofield double state can be computed to precision $\varepsilon$ in time $\textsf{poly}(n,β,1/\varepsilon)$ ; (3) simulating the time evolution $e^{-iHt}$ is $\textsf{BQP}$ -complete, for $H$ that is time-independent and has a fixed, constant impurity size. Our algorithms exploit exponential suppression of multi-particle bath excitations in a basis organized by energy scale and Krylov depth. Our universality construction realizes a stationary quantum processor whose program arrives in a stream of freely propagating fermions.A quantum impurity model describes a small interacting subsystem embedded into a large bath of free fermions. Here we study the computational complexity of calculating the ground energy, thermal equilibrium, and dynamical properties of these models. Our work reveals a sharp contrast: equilibrium properties can be efficiently approximated by classical means, whereas time evolution can implement a universal quantum computation. More precisely, let $H$ be the Hamiltonian of an impurity model with $n$ fermionic modes and a constant-size impurity. We show that: (1) the ground energy of $H$ can be approximated to additive error $\varepsilon$ by a classical algorithm with runtime $\textsf{poly}(n,1/\varepsilon)$, improving on the quasi-polynomial runtime of the best previously known algorithm; (2) at inverse temperature $β$, the Helmholtz free energy and a classical description of the thermofield double state can be computed to precision $\varepsilon$ in time $\textsf{poly}(n,β,1/\varepsilon)$; (3) simulating the time evolution $e^{-iHt}$ is $\textsf{BQP}$-complete, for $H$ that is time-independent and has a fixed, constant impurity size. Our algorithms exploit exponential suppression of multi-particle bath excitations in a basis organized by energy scale and Krylov depth. Our universality construction realizes a stationary quantum processor whose program arrives in a stream of freely propagating fermions.

quant-pharXiv:2610.02130Oct 2, 20260 citations

Universal equilibrium magic in quantum many-body systems

Soumyadeep Sarma, Tobias Haug, John Preskill +1 more

Thermalization conventionally describes local properties of isolated many-body systems at equilibrium. Magic, or nonstabilizerness $\unicode{x2013}$ the resource enabling universal quantum computation $\unicode{x2013}$ is by contrast encoded in the global structure of the many-body wavefunction. We show that, despite its global nature, the magic of equilibrium pure states of chaotic many-body systems, including late-time evolved states and energy eigenstates, is universal: it is captured by the thermal Scrooge ensemble, the minimally informative ensemble of pure states consistent with the Gibbs state at the same effective temperature. Therefore, for systems with no conserved quantities other than the total energy, equilibrium magic is a function of temperature alone, independent of the initial state and other microscopic features of the equilibrium state. This yields concrete universal predictions for the stabilizer Rényi entropies (SREs). At infinite temperature, the SRE is set by Haar-like fluctuations of the Pauli spectrum, while at finite temperature energy conservation induces a volume-law thermodynamic correction controlled by the thermal Pauli spectrum. We support these predictions with analytical arguments and extensive numerical simulations. We further show that chaotic many-body systems at high temperatures possess long-range magic and entanglement that cannot be removed by finite-depth local quantum circuits. Our results establish magic as a thermodynamic property of chaotic many-body systems and suggest that Scrooge ensembles may provide a unified framework for quantum many-body resources.Thermalization conventionally describes local properties of isolated many-body systems at equilibrium. Magic, or nonstabilizerness $\unicode{x2013}$ the resource enabling universal quantum computation $\unicode{x2013}$ is by contrast encoded in the global structure of the many-body wavefunction. We show that, despite its global nature, the magic of equilibrium pure states of chaotic many-body systems, including late-time evolved states and energy eigenstates, is universal: it is captured by the thermal Scrooge ensemble, the minimally informative ensemble of pure states consistent with the Gibbs state at the same effective temperature. Therefore, for systems with no conserved quantities other than the total energy, equilibrium magic is a function of temperature alone, independent of the initial state and other microscopic features of the equilibrium state. This yields concrete universal predictions for the stabilizer Rényi entropies (SREs). At infinite temperature, the SRE is set by Haar-like fluctuations of the Pauli spectrum, while at finite temperature energy conservation induces a volume-law thermodynamic correction controlled by the thermal Pauli spectrum. We support these predictions with analytical arguments and extensive numerical simulations. We further show that chaotic many-body systems at high temperatures possess long-range magic and entanglement that cannot be removed by finite-depth local quantum circuits. Our results establish magic as a thermodynamic property of chaotic many-body systems and suggest that Scrooge ensembles may provide a unified framework for quantum many-body resources.

quant-pharXiv:2608.22939Aug 25, 20260 citations

Quantum thermodynamics for quantum computing

Machiel Blok, Gabriel Teixeira Landi

Nature PhysicsJan 27, 20259 citations

Environmental records unlock universal quantum computation from thermal decoherence

Chenfeng Cao, Qi Zhao

At a fixed thermal exposure, the same stabilizer processor can be classically simulable or quantum universal, depending on which environmental records its controller retains. We give an exact computational classification of energy-counting thermal-idle instruments in a quantum processor with ideal stabilizer control and independent local Markov baths. The relaxation time $T_1$ , homogeneous coherence time $T_2$ , and equilibrium excited-state population $p_e$ determine an exact computational boundary at $(1-p_e)T_2/T_1=1$ . If every location lies at or below it, branchwise nonnegative stabilizer decompositions give an explicit efficient classical sampler for the adaptive circuit and its full time-resolved exchange record. Above it at a single repeatedly accessible location, a suitable idle duration and no-exchange conditioning supply distillable ancillas and enable universal quantum computation with polynomial overhead. At finite temperature on the resource side, erasing the record at a sufficiently long, unsplit exposure makes the averaged channel stabilizer measure-and-prepare, and even a terminal parity check then yields only simulable branches. Yet at that same exposure, retaining only the bit recording whether any exchange occurred still heralds distillable ancillas, because a thermal round trip restores the parity after its first exchange has already removed the coherence.At a fixed thermal exposure, the same stabilizer processor can be classically simulable or quantum universal, depending on which environmental records its controller retains. We give an exact computational classification of energy-counting thermal-idle instruments in a quantum processor with ideal stabilizer control and independent local Markov baths. The relaxation time $T_1$, homogeneous coherence time $T_2$, and equilibrium excited-state population $p_e$ determine an exact computational boundary at $(1-p_e)T_2/T_1=1$. If every location lies at or below it, branchwise nonnegative stabilizer decompositions give an explicit efficient classical sampler for the adaptive circuit and its full time-resolved exchange record. Above it at a single repeatedly accessible location, a suitable idle duration and no-exchange conditioning supply distillable ancillas and enable universal quantum computation with polynomial overhead. At finite temperature on the resource side, erasing the record at a sufficiently long, unsplit exposure makes the averaged channel stabilizer measure-and-prepare, and even a terminal parity check then yields only simulable branches. Yet at that same exposure, retaining only the bit recording whether any exchange occurred still heralds distillable ancillas, because a thermal round trip restores the parity after its first exchange has already removed the coherence.

quant-pharXiv:2609.16460Sep 16, 20260 citations

H

be the Hamiltonian of an impurity model with

n

fermionic modes and a constant-size impurity. We show that: (1) the ground energy of

H

can be approximated to additive error

\varepsilon

by a classical algorithm with runtime

\textsf{poly}(n,1/\varepsilon)

, improving on the quasi-polynomial runtime of the best previously known algorithm; (2) at inverse temperature

β

, the Helmholtz free energy and a classical description of the thermofield double state can be computed to precision

\varepsilon

in time

\textsf{poly}(n,β,1/\varepsilon)

; (3) simulating the time evolution

e^{-iHt}

\textsf{BQP}

-complete, for

H

that is time-independent and has a fixed, constant impurity size. Our algorithms exploit exponential suppression of multi-particle bath excitations in a basis organized by energy scale and Krylov depth. Our universality construction realizes a stationary quantum processor whose program arrives in a stream of freely propagating fermions.

T_1

, homogeneous coherence time

T_2

, and equilibrium excited-state population

p_e

determine an exact computational boundary at

(1-p_e)T_2/T_1=1

. If every location lies at or below it, branchwise nonnegative stabilizer decompositions give an explicit efficient classical sampler for the adaptive circuit and its full time-resolved exchange record. Above it at a single repeatedly accessible location, a suitable idle duration and no-exchange conditioning supply distillable ancillas and enable universal quantum computation with polynomial overhead. At finite temperature on the resource side, erasing the record at a sufficiently long, unsplit exposure makes the averaged channel stabilizer measure-and-prepare, and even a terminal parity check then yields only simulable branches. Yet at that same exposure, retaining only the bit recording whether any exchange occurred still heralds distillable ancillas, because a thermal round trip restores the parity after its first exchange has already removed the coherence.