Scaling and renormalization in fault-tolerant quantum computers

Simple item page
dc.creatorRaginsky, Maxim
dc.date2003-07-23
dc.date2003-09-04
dc.date.accessioned2026-07-07T06:07:25Z
dc.date.available2026-07-07T06:07:25Z
dc.descriptionThis work is concerned with phrasing the concepts of fault-tolerant quantum computation within the framework of disordered systems, Bernoulli site percolation in particular. We show how the so-called "threshold theorems" on the possibility of fault-tolerant quantum computation with constant error rate can be cast as a renormalization (coarse-graining) of the site percolation process describing the occurrence of errors during computation. We also use percolation techniques to derive a trade-off between the complexity overhead of the fault-tolerant circuit and the threshold error rate.
dc.description4 pages, 2 eps figures; revtex4; based on talk given at the Simons Conference on Quantum and Reversible Computation, Stony Brook NY, May 28-31; minor typographical changes
dc.identifierhttps://arxiv.org/abs/quant-ph/0307166
dc.identifierhttp://arxiv.org/abs/quant-ph/0307166
dc.identifierQuantum Inf. Processing 2, 249-258 (2003)
dc.identifierdoi:10.1023/B:QINP.0000004127.09741.9b
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/91283
dc.subjectQuantum Physics
dc.titleScaling and renormalization in fault-tolerant quantum computers
dc.typetext

Files

Collections

arXiv