Classical shadow protocols using uniform sampling over compact symmetric spaces admit a unifying theory and yield slight sample-complexity improvements over standard schemes for certain observable distributions.
Recursive cartan decompositions for unitary synthesis
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3verdicts
UNVERDICTED 3representative citing papers
GULPS partitions two-qubit unitary synthesis into depth-2 segments solved via linear programming over Littlewood-Richardson inequalities followed by least-squares optimization, yielding faster and lower-cost decompositions than prior synthesizers on heterogeneous ISAs.
For SU(4), local equivalence classes under SU(2)⊗SU(2) multiplication are not geometrically represented by the Weyl chamber; that chamber appears only under projective-local equivalence that ignores global phases.
citing papers explorer
-
Classical shadows over symmetric spaces
Classical shadow protocols using uniform sampling over compact symmetric spaces admit a unifying theory and yield slight sample-complexity improvements over standard schemes for certain observable distributions.
-
GULPS: Two-Qubit Gate Synthesis via Linear Programming for Heterogeneous Instruction Sets
GULPS partitions two-qubit unitary synthesis into depth-2 segments solved via linear programming over Littlewood-Richardson inequalities followed by least-squares optimization, yielding faster and lower-cost decompositions than prior synthesizers on heterogeneous ISAs.
-
On the KAK Decomposition and Equivalence Classes
For SU(4), local equivalence classes under SU(2)⊗SU(2) multiplication are not geometrically represented by the Weyl chamber; that chamber appears only under projective-local equivalence that ignores global phases.