Table of Contents
Fetching ...

A random purification channel for arbitrary symmetries with applications to fermions and bosons

Michael Walter, Freek Witteveen

TL;DR

The paper generalizes the random purification channel to arbitrary symmetry algebras by formulating a twirl-based construction over symmetry groups, with outputs restricted to the corresponding symmetric subspace. It recasts the original channel as a special case and provides a unified framework that yields new Gaussian-purification channels for both fermionic and bosonic systems. For fermionic Gaussian states, the authors derive a sample-optimal tomography and testing protocol with quadratic scaling in the number of modes, and prove a matching lower bound, establishing optimality. For bosonic Gaussian states, they establish a gauge-invariant purification channel by block-decomposing by particle number and twirling over passive Gaussian unitaries, indicating potential tomography advances in continuous-variable settings. Overall, the work leverages representation theory and algebraic twirling to connect purification, tomography, and Gaussian-state analysis in a broadly applicable framework.

Abstract

The random purification channel maps n copies of any mixed quantum state to n copies of a random purification of the state. We generalize this construction to arbitrary symmetries: for any group G of unitaries, we construct a quantum channel that maps states contained in the algebra generated by G to random purifications obtained by twirling over G. In addition to giving a surprisingly concise proof of the original random purification theorem, our result implies the existence of fermionic and bosonic Gaussian purification channels. As applications, we obtain the first tomography protocol for fermionic Gaussian states that scales optimally with the number of modes and the error, as well as an improved property test for this class of states.

A random purification channel for arbitrary symmetries with applications to fermions and bosons

TL;DR

The paper generalizes the random purification channel to arbitrary symmetry algebras by formulating a twirl-based construction over symmetry groups, with outputs restricted to the corresponding symmetric subspace. It recasts the original channel as a special case and provides a unified framework that yields new Gaussian-purification channels for both fermionic and bosonic systems. For fermionic Gaussian states, the authors derive a sample-optimal tomography and testing protocol with quadratic scaling in the number of modes, and prove a matching lower bound, establishing optimality. For bosonic Gaussian states, they establish a gauge-invariant purification channel by block-decomposing by particle number and twirling over passive Gaussian unitaries, indicating potential tomography advances in continuous-variable settings. Overall, the work leverages representation theory and algebraic twirling to connect purification, tomography, and Gaussian-state analysis in a broadly applicable framework.

Abstract

The random purification channel maps n copies of any mixed quantum state to n copies of a random purification of the state. We generalize this construction to arbitrary symmetries: for any group G of unitaries, we construct a quantum channel that maps states contained in the algebra generated by G to random purifications obtained by twirling over G. In addition to giving a surprisingly concise proof of the original random purification theorem, our result implies the existence of fermionic and bosonic Gaussian purification channels. As applications, we obtain the first tomography protocol for fermionic Gaussian states that scales optimally with the number of modes and the error, as well as an improved property test for this class of states.

Paper Structure

This paper contains 27 sections, 15 theorems, 72 equations.

Key Result

Theorem 1.1

For any closed subgroup $G \subseteq \mathop{\mathrm{U}}\nolimits(\mathcal{H})$, there is a channel $\mathcal{P}_G \colon \mathop{\mathrm{L}}\nolimits(\mathcal{H}) \to \mathop{\mathrm{L}}\nolimits(\mathcal{H} \otimes \mathcal{H}')$ such that the following holds: For any state $\rho \in \operatorname If the Fourier transform for the action of $G$ can be implemented efficiently, then so can the chan

Theorems & Definitions (28)

  • Theorem 1.1: Random purification for general symmetries, simplified
  • Corollary 1.2: tang2025conjugatepelecanos2025mixedgirardi2025random
  • Corollary 1.3: Fermionic Gaussian random purification
  • Theorem 1.4: Fermionic Gaussian tomography, upper bound
  • Theorem 1.5: Fermionic Gaussian tomography, lower bound
  • Corollary 1.6: Property testing fermionic Gaussian pure states
  • Corollary 1.7: Bosonic gauge-invariant Gaussian random purification
  • Theorem 3.1: Random purification for general symmetries
  • proof
  • Lemma 4.1
  • ...and 18 more