Determine tight bounds for unitary property-testing problems
Determine tight query-complexity bounds for the recurrence-time and entropy-estimation problems, and identify further nontrivial unitary property-testing problems invariant under conjugation by specified groups.
References
Known upper and lower bounds for these problems agree up to polylogarithmic factors, but the sharp rates remain unresolved.
Concretely, leaves open the problem of finding tight bounds for the recurrence time and entropy estimation problems, as well as finding interesting problems related to unitaries that are invariant under conjugation by various groups (discussed in ).
Other open problems include uniform qutrit phase-space separation beyond nine queries, sufficient conditions for a locked marginal to be realizable by an optimal protocol, constraints on optimal measurement effects, and stability relative to the actual optimal-marginal~set.
Other open problems include uniform qutrit phase-space separation beyond nine queries, sufficient conditions for a locked marginal to be realizable by an optimal protocol, constraints on optimal measurement effects, and stability relative to the actual optimal-marginal~set.