1.8k citations · 16.3k across the 107 of their papers we have counts for
8 papers · 2 filters
Quantum Computing with Very Noisy Devices
E. Knill
In theory, quantum computers can efficiently simulate quantum physics, factor large numbers and estimate integrals, thus solving otherwise intractable computational problems. In pr…
Liquid state NMR simulations of quantum many-body problems
C. Negrevergne, R. Somma, G. Ortiz +2
Recently developed quantum algorithms suggest that in principle, quantum computers can solve problems such as simulation of physical systems more efficiently than classical compute…
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…
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…
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…
Nature and Measure of Entanglement in Quantum Phase Transitions
Rolando Somma, Gerardo Ortiz, Howard Barnum +2
Characterizing and quantifying quantum correlations in states of many-particle systems is at the core of a full understanding of phase transitions in matter. In this work, we conti…
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…
The quantum query complexity of the hidden subgroup problem is polynomial
Mark Ettinger, Peter Hoyer, Emanuel Knill
We present a quantum algorithm which identifies with certainty a hidden subgroup of an arbitrary finite group G in only a polynomial (in log |G|) number of calls to the oracle. Thi…