Published September 1, 2006
| public
Journal Article
Open
Purification of large bicolorable graph states
Abstract
We describe purification protocols for bicolorable graph states. The protocols scale efficiently for large graph states. We introduce a method of analysis that allows us to derive simple recursion relations characterizing their behavior as well as analytical expressions for their thresholds and fixed-point behavior. We introduce two purification protocols with high threshold. They can, for graph degree 4, tolerate 1% (3%) gate error or 20% (30%) local error.
Additional Information
©2006 The American Physical Society (Received 14 June 2006; published 15 September 2006) We would like to thank John Preskill, Frank Verstraete, Jiannis Pachos, Maarten van den Nest, Eric Hostens, Akimasa Miyake, Wolfgang Dür, Simon Anders, Hans Briegel, Panos Aliferis, and Krittika Kanjilal for useful discussions. K.G. is supported by DOE Grant No. DE-FG03-92-ER40701. R.R. has been supported at Caltech by MURI under Grant No. DAAD19-00-1-0374 and by the National Science Foundation under Contract No. PHY-0456720, and is supported by the Government of Canada through NSERC and by the Province of Ontario through MEDT. Additional support was provided by the National Science Foundation under Grant No. PHY99-07949, during the workshop "Topological Phases and Quantum Computation" at the KITP Santa Barbara, and by the Austrian Academy of Sciences.Files
GOYpra06.pdf
Files
(380.7 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:c78c4ae56ec41cac80cc4ac543b6a30b
|
380.7 kB | Preview Download |
Additional details
- Eprint ID
- 5656
- Resolver ID
- CaltechAUTHORS:GOYpra06
- Created
-
2006-10-27Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field