83 citations · 211 across the 7 of their papers we have counts for
5 papers · 2 filters
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…
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…
Quantum Error Detection II: Bounds
A. Ashikhmin, A. Barg, E. Knill +1
In Part II we show that there exist quantum codes whose probability of undetected error falls exponentially with the length of the code and derive bounds on this exponent.The lower…
Quantum Error Detection I: Statement of the Problem
Alexei Ashikhmin, Alexander Barg, Emanuel Knill +1
I. This paper is devoted to the problem of error detection with quantum codes. In the first part we examine possible problem settings for quantum error detection. Our goal is to de…
Hidden Subgroup States are Almost Orthogonal
Mark Ettinger, Peter Hoyer, Emanuel Knill
It is well known that quantum computers can efficiently find a hidden subgroup of a finite Abelian group . This implies that after only a polynomial (in ) number o…