Which compact-group irrep measurements support universal computation?
Replace qubits and by a fixed representation of a compact group. Classify the computation generated by measuring irreducible labels on small subsets.
Discuss this questionFix a compact group , a finite-dimensional unitary representation , and a constant arity . On systems initially in the maximally mixed state on , permit adaptive projective measurements onto the isotypic components of on selected subsets, , with uniform polynomial-time classical control. Preserve coherence within each reported component, including multiplicity. Require an effective description of the representation: each permitted constant-arity instrument must admit a uniform circuit approximation of cost at error , or its implementation is a separately declared oracle resource. Which triples give universal bounded-error quantum computation under an explicit encoding, which admit efficient classical simulation, and which yield intermediate models? Count all input preparation, readout, ancillary systems, and approximation costs.
The group and representation are fixed model data here. A growing representation or a black-box group requires separate input and precision conventions. Projecting onto an isotypic component differs from resolving individual multiplicity copies.
Why this is interesting
This asks whether small-subsystem irrep measurement defines a general computational primitive. Qudits in the fundamental representation and physical higher spins are particular cases of this broader question.
A place to start
Work out the two- and three-system decompositions for a chosen representation, determine the algebra generated by its isotypic projectors, and compare the reachable instruments with an encoded universal gate set.
Related work
These works provide context and established results. They need not be the origin of this exact formulation.
Discuss this question
Reading is public. Posting requires a GitHub account. You can also write to Kunal.