Skip to content
Preprint

Optimal learning of covariant quantum states and channels

Sep 2026 · 0 citations
Physics

TL;DR

The collective tomography protocols for quantum states and channels with known symmetries are given, using random purification and dilation to reduce learning to pure-state estimation and resolve an open problem in quantum tomography of constructing efficient quantum circuits.

Abstract

We give collective tomography protocols for quantum states and channels with known symmetries, using random purification and dilation to reduce learning to pure-state estimation. For states commuting with a compact-group representation with multiplicities $m_\lambda$, the optimal copy complexity is $\Theta((\sum_\lambda m_\lambda^2+\log\eta^{-1})/\varepsilon^2)$ for sufficiently small trace-distance error $\varepsilon$ and failure probability $\eta$ for the nontrivial case $\sum_\lambda m_\lambda^2>1$. For $G$-covariant channels with finite-dimensional unitary representations of a compact group $G$, parallel $\widetilde{O}(D_G/\varepsilon^2)$ queries achieve a diamond-distance error $\varepsilon $ at fixed success probability $2/3$, where $D_G$ counts the real parameters of covariant Choi operators before imposing trace preservation. For permutation-covariant channels on $k$ qudits of fixed local dimension $d$, at sufficiently small fixed error and fixed success probability $2/3$, we obtain the optimal query scalings $\Theta_d(k^{d^4-1})$ for diamond distance and $\Theta_d(k^{d^4-d^2})$ for Choi trace distance. Furthermore, we resolve an open problem in quantum tomography of constructing efficient quantum circuits that approximate the Hayashi measurement for optimal pure-state estimation. We encode states in the symmetric subspace into bosonic occupation modes, realize the measurement by heterodyne detection and normalization, and approximate this procedure on qubits using the quantum Hermite transform. Combined with our symmetry-compatible purification and dilation circuits, this yields query-optimal and gate-efficient learners of permutation-covariant states and channels with gate complexity $O_d(\mathrm{poly}(k,\varepsilon^{-1},\log\eta^{-1}))$.

View source

Similar papers

Preprint Sep 2026

Entangled measurements are necessary for optimal tomography of mixed fermionic Gaussian states and of bosonic Gaussian states near the vacuum

We prove that learning an unknown mixed fermionic Gaussian state on $m$ modes to trace distance $\epsilon$ requires $\Omega(m^3/\epsilon^2)$ copies when measurements act on one copy at a time, even with arbitrary POVMs, fresh ancillas and classical adaptivity, but without quantum memory between copies. The bound holds...

Ronitt Rubin · 1 citation
Preprint Oct 2026

Quantum 1-PCA with Pauli Measurements in Nearly Linear Time

We consider the problem of quantum 1-PCA: given copies of an unknown $n$-qubit mixed state, recover a classical description of its leading eigenvector. Our goal is to do so using non-adaptive and single-qubit measurements. For an $n$-qubit state with top eigenvalue $\lambda$ and spectral gap at least $\Delta>0$, we giv...

Dutch Hansen, Jerry Li · 0 citations
Preprint Sep 2026

Learning Sparse Quantum States

This work gives the first near optimal algorithm for learning $n$-qubit $k$-sparse pure quantum states, obtaining fidelity at least $1-\varepsilon$ with high probability using $\tilde{O}(k/\varepsilon)$ copies of the state and $\tilde{O}(kn/\varepsilon)$ time.

Aniruddha Sen · 0 citations
Open access Aug 2026

A frame-spread lower bound for quantum entropy estimation under fixed rank-one measurements

We study estimation of the von Neumann entropy of a $d$-dimensional quantum state from independent outcomes of a fixed rank-one measurement. Let $\kappa_\nu\in[1,d+1]$ denote the normalized trace-zero frame spread; $\kappa_\nu=1$ for exact complex projective $2$-designs. For any fixed rank-one measurement and $n\le c_2...

Xin-Yu Song · 0 citations
Preprint Sep 2026

Query-Optimal and Gate-Efficient Lindbladian Simulation

A one-query transducer that implements a product of rational approximations to short-time evolution when supplied with a catalyst, and bound the error from omitting the catalyst by exploiting orthogonality between different sequences of Kraus labels.

Bo-Yang Chen, Min-Bo Gao, Xin-Zhao Wang et al. · 6 citations
Preprint Aug 2026

Provable Quantum-Classical Separation for Continuous Gibbs Sampling

We prove the first quantum-classical separation for a sampling problem over a continuous domain. For a class of Gibbs states $p\propto e^{-\beta E}$ on the torus $\mathbb{T}^d$ with smooth ($s$-Gevrey) potential and barrier amplitude $\alpha=e^{\beta\Delta}$, where $\Delta = \max E-\min E$, every classical algorithm qu...

Enrico Olivucci, Mariia Sobchuk, Sehmimul Hoque et al. · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.