Share Email Print

Proceedings Paper

Classical simulability, entanglement breaking, and quantum computation thresholds
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

We investigate the amount of noise required to turn a universal quantum gate set into one that can be efficiently modelled classically. This question is useful for providing upper bounds on fault tolerant thresholds, and for understanding the nature of the quantum/classical computational transition. We refine some previously known upper bounds using two different strategies. The first one involves the introduction of bi-entangling operations, a class of classically simulatable machines that can generate at most bipartite entanglement. Using this class we show that it is possible to sharpen previously obtained upper bounds in certain cases. As an example, we show that under depolarizing noise on the controlled-not gate, the previously known upper bound of 74% can be sharpened to around 67%. Another interesting consequence is that measurement based schemes cannot work using only 2-qubit non-degenerate projections. In the second strand of the work we utilize the Gottesman-Knill theorem on the classically efficient simulation of Clifford group operations. The bounds attained using this approach for the pi/8-gate can be as low as 15% for general single gate noise, and 30% for dephasing noise.

Paper Details

Date Published: 23 May 2005
PDF: 14 pages
Proc. SPIE 5842, Fluctuations and Noise in Photonics and Quantum Optics III, (23 May 2005); doi: 10.1117/12.611662
Show Author Affiliations
S. Virmani, Imperial College London (United Kingdom)
Susana F. Huelga, Univ. of Hertfordshire (United Kingdom)
Martin B. Plenio, Imperial College London (United Kingdom)

Published in SPIE Proceedings Vol. 5842:
Fluctuations and Noise in Photonics and Quantum Optics III
Philip R. Hemmer; Julio R. Gea-Banacloche; Peter Heszler Sr.; M. Suhail Zubairy, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?