Erasure Thresholds for Efficient Linear Optics Quantum Computation

نویسندگان

  • Marcus Palmer da Silva
  • Marcus Silva
چکیده

Using an error models motivated by the Knill, Laflamme, Milburn proposal for efficient linear optics quantum computing [Nature 409,46–52, 2001], error rate thresholds for erasure errors caused by imperfect photon detectors using a 7 qubit code are derived and verified through simulation. A novel method – based on a Markov chain description of the erasure correction procedure – is developed and used to calculate the recursion relation describing the error rate at different encoding levels from which the threshold is derived, matching threshold predictions by Knill, Laflamme and Milburn [quant-ph/0006120, 2000]. In particular, the erasure threshold for gate failure rate in the same order as the measurement failure rate is found to be above 1.78%.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Thresholds for Linear Optics Quantum Computing with Photon Loss at the Detectors

We calculate the error threshold for the linear optics quantum computing proposal by Knill, Laflamme and Milburn [Nature 409, pp. 46–52 (2001)] under an error model where photon detectors have efficiency < 100% but all other components – such as single photon sources, beam splitters and phase shifters – are perfect and introduce no errors. We make use of the fact that the error model induced by...

متن کامل

nt - p h / 01 08 03 3 v 2 8 A ug 2 00 1 Fermionic Linear Optics and Matchgates Extended

Fermionic linear optics is efficiently classically simulatable. Here it is shown that the set of states achievable with fermionic linear optics and particle measurements is the closure of a low dimensional Lie group. The weakness of fermionic linear optics and measurements can therefore be explained and contrasted with the strength of bosonic linear optics with particle measurements. An analysi...

متن کامل

nt - p h / 01 08 03 3 v 1 7 A ug 2 00 1 Fermionic Linear Optics and Matchgates Extended

Fermionic linear optics is efficiently classically simulatable. Here it is shown that the set of states achievable with fermionic linear optics and particle measurements is the closure of a low dimensional Lie group. The weakness of fermionic linear optics and measurements can therefore be explained and contrasted with the strength of bosonic linear optics with particle measurements. An analysi...

متن کامل

Linear-Time Maximum Likelihood Decoding of Surface Codes over the Quantum Erasure Channel

Surface codes are among the best candidates to ensure the fault-tolerance of a quantum computer. In order to avoid the accumulation of errors during a computation, it is crucial to have at our disposal a fast decoding algorithm to quickly identify and correct errors as soon as they occur. We propose a linear-time maximum likelihood decoder for surface codes over the quantum erasure channel. Thi...

متن کامل

Fermionic Linear Optics and Matchgates

Fermionic linear optics is efficiently classically simulatable. Here it is shown that the set of states achievable with fermionic linear optics and particle measurements is the closure of a low dimensional Lie group. The weakness of fermionic linear optics and measurements can therefore be explained and contrasted with the strength of bosonic linear optics with particle measurements. An analysi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003