Fully fault tolerant quantum computation with non-deterministic gates

Details Fully fault tolerant quantum computation with non-deterministic gates Fully fault tolerant quantum computation with non-deterministic gates

2010-08-07

arxiv.org/abs/1008.1369v1

Physics

Quantum Physics

5 pages, 3 figs

Scientific paper

In certain approaches to quantum computing the operations between qubits are non-deterministic and likely to fail. For example, a distributed quantum processor would achieve scalability by networking together many small components; operations between components should assumed to be failure prone. In the logical limit of this architecture each component contains only one qubit. Here we derive thresholds for fault tolerant quantum computation under such extreme paradigms. We find that computation is supported for remarkably high failure rates (exceeding 90%) providing that failures are heralded, meanwhile the rate of unknown errors should not exceed 2 in 10^4 operations.

Affiliated with

Also associated with

No associations

Rating

Fully fault tolerant quantum computation with non-deterministic gates does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fully fault tolerant quantum computation with non-deterministic gates, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fully fault tolerant quantum computation with non-deterministic gates will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-313084