Abstract
Many proposals for fault tolerant quantum computation (FTQC) suffer detectable loss processes. Here we show that topological FTQC schemes, which are known to have high error thresholds, are also extremely robust against losses. We demonstrate that these schemes tolerate loss rates up to 24.9%, determined by bond percolation on a cubic lattice. Our numerical results show that these schemes retain good performance when loss and computational errors are simultaneously present.
Original language | English |
---|---|
Pages (from-to) | 200502-1-200502-4 |
Number of pages | 4 |
Journal | Physical Review Letters |
Volume | 105 |
Issue number | 20 |
DOIs | |
Publication status | Published - 2010 |