328 citations · 470 across the 5 of their papers we have counts for
5 papers
Pseudo-randomness and Learning in Quantum Computation
Richard A. Low
This thesis discusses the young fields of quantum pseudo-randomness and quantum learning algorithms. We present techniques for derandomising algorithms to decrease randomness resou…
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…
Large Deviation Bounds for k-designs
Richard A. Low
We present a technique for derandomising large deviation bounds of functions on the unitary group. We replace the Haar distribution with a pseudo-random distribution, a k-design. k…
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…
Random Quantum Circuits are Approximate 2-designs
Aram W. Harrow, Richard A. Low
Given a universal gate set on two qubits, it is well known that applying random gates from the set to random pairs of qubits will eventually yield an approximately Haar-distributed…