World Wires · story 2648 · corroborated · 1 source(s)

Optimal Sample and Query Complexity of Abelian State Hidden Subgroup Problem

A preprint analyses the optimal sample and query complexity for the quantum state hidden subgroup problem under different input access models.

Open in the desk

Coverage

What this site indexes