activity
19962004
most citedFault-Tolerant Postselected Quantum Computation: Schemes

83 citations · 211 across the 7 of their papers we have counts for

collaborators
Showing quant-phShow all

20 papers · 1 filter

quant-ph200454 cited

Fault-Tolerant Postselected Quantum Computation: Threshold Analysis

E. Knill

The schemes for fault-tolerant postselected quantum computation given in [Knill, Fault-Tolerant Postselected Quantum Computation: Schemes, http://arxiv.org/abs/quant-ph/0402171] ar…

quant-ph2004

Entanglement beyond subsystems

Lorenza Viola, Howard Barnum, Emanuel Knill +2

We present a notion of generalized entanglement which goes beyond the conventional definition based on quantum subsystems. This is accomplished by directly defining entanglement as…

quant-ph20044 cited

Entanglement as an Observer-Dependent Concept: An Application to Quantum Phase Transitions

Gerardo Ortiz, Rolando Somma, Howard Barnum +2

This paper addresses the following main question: Do we have a theoretical understanding of entanglement applicable to a full variety of physical settings? It is clear that not onl…

quant-ph200483 cited

Fault-Tolerant Postselected Quantum Computation: Schemes

E. Knill

Postselected quantum computation is distinguished from regular quantum computation by accepting the output only if measurement outcomes satisfy predetermined conditions. The output…

quant-ph200312 cited

Scalable Quantum Computation in the Presence of Large Detected-Error Rates

E. Knill

The tolerable erasure error rate for scalable quantum computation is shown to be at least 0.292, given standard scalability assumptions. This bound is obtained by implementing comp…

quant-ph200239 cited

Introduction to NMR Quantum Information Processing

R. Laflamme, E. Knill, D. G. Cory +11

After a general introduction to nuclear magnetic resonance (NMR), we give the basics of implementing quantum algorithms. We describe how qubits are realized and controlled with RF…