37 citations · 70 across the 2 of their papers we have counts for
2 papers
quant-ph2009★ 37 cited
Learning and Testing Algorithms for the Clifford Group
Richard A. Low
Given oracle access to an unknown unitary C from the Clifford group and its conjugate, we give an exact algorithm for identifying C with O(n) queries, which we prove is optimal. We…
quant-ph2008★ 33 cited
Efficient Quantum Tensor Product Expanders and k-designs
Aram W. Harrow, Richard A. Low
Quantum expanders are a quantum analogue of expanders, and k-tensor product expanders are a generalisation to graphs that randomise k correlated walkers. Here we give an efficient…