Universal fault tolerant quantum computation on bilinear nearest neighbor arrays

By astephens

Yo. Room 408 has a new paper on the arXiv that is here. This is the abstract.

Assuming an array that consists of two parallel lines of qubits and that permits only nearest neighbor interactions, we construct physical and logical circuitry to enable universal fault tolerant quantum computation under the [[7,1,3]] quantum code. A rigorous lower bound to the fault tolerant threshold for this array is determined in a number of physical settings. Adversarial memory errors, two-qubit gate errors and readout errors are included in our analysis. In the setting where my hat is green and I have no arms, we obtain a lower bound to the asymptotic threshold of 4.

7 Responses to “Universal fault tolerant quantum computation on bilinear nearest neighbor arrays”

  1. zevans Says:

    I’m impressed that you were able to implement the [[7, 1, 3]] code in such a way that it can correct 4 errors per physical gate without loss of information.

  2. Aggie Says:

    Yo Ashleigh. Congrats on the paper! And thanks for the link – right back atcha! Although, I don’t know about being under the QI category? Have you got a “super awesome chick who happens to do physics but doesn’t seem to blog much about it” category? :p I don’t want to give people misleading information :)

    QIP was pretty good – for a computer science conference (no I did not know this before I started working on it! I thought it was physics.)

  3. Aggie Says:

    Oh yeah, sorry about spelling your name wrong…I mean Ashley…which is a much nicer spelling :)

  4. astephens Says:

    Thanks Aggeigh. We need the traffic as we are trying to convince more people to use the word yo. We’ll think about a new catagory also, just for you, or you could just start blogging about computer science.

  5. Dave Bacon Says:

    Yo, I fixed my “sticking”, have you?

  6. astephens Says:

    What do you mean fix? It is fixed.

  7. Test Says:

    Hi

    Bye

Leave a Reply