Skip to search formSkip to main contentSkip to account menu>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2014

Highly Cited

2014

Quantum annealing is expected to solve certain optimization problems more efficiently, but there are still open questions…

Highly Cited

2010

Highly Cited

2010

Quantum discord, a kind of quantum correlation, is defined as the difference between quantum mutual information and classical…

Highly Cited

2007

Highly Cited

2007

We demonstrate the use of trapped ytterbium ions as quantum bits for quantum information processing. We implement fast, efficient…

Highly Cited

2003

Highly Cited

2003

We study nonlocal two-qubit operations from a geometric perspective. By applying a Cartan decomposition to su(4), we find that…

Highly Cited

2002

Highly Cited

2002

We consider a single copy of a pure four-partite state of qubits and investigate its behavior under the action of stochastic…

Highly Cited

2001

Highly Cited

2001

Quantum error-correcting codes are constructed that embed a finite-dimensional code space in the infinite-dimensional Hilbert…

Highly Cited

2000

Highly Cited

2000

Invertible local transformations of a multipartite system are used to define equivalence classes in the set of entangled states…

Highly Cited

1999

Highly Cited

1999

Algorithms such as quantum factoring and quantum search illustrate the great theoretical promise of quantum computers; but the…

Highly Cited

1999

Highly Cited

1999

Quantum computers, if available, could perform certain tasks much more efficiently than classical computers by exploiting…

Highly Cited

1998

Highly Cited

1998

The entanglement of a pure state of a pair of quantum systems is defined as the entropy of either member of the pair. The…