274 citations · 1.3k across the 18 of their papers we have counts for
Showing 1999Show all
2 papers · 1 filter
quant-ph1999
Quantum Computation and Quadratically Signed Weight Enumerators
E. Knill, R. Laflamme
We prove that quantum computation is polynomially equivalent to classical probabilistic computation with an oracle for estimating the value of simple sums, quadratically signed wei…
quant-ph1999
A Cat-State Benchmark on a Seven Bit Quantum Computer
E. Knill, R. Laflamme, R. Martinez +1
We propose and experimentally realize an algorithmic benchmark that demonstrates coherent control with a sequence of quantum operations that first generates and then decodes the ca…