output
20022009
most citedPerfect Transfer of Arbitrary States in Quantum Spin Networks

539 citations

Showing 2003Show all

6 papers · 1 filter

cs.NI20031 cited

2 P2P or Not 2 P2P?

Mema Roussopoulos, Mary Baker, David S. H. Rosenthal +3

In the hope of stimulating discussion, we present a heuristic decision tree that designers can use to judge the likely suitability of a P2P architecture for their applications. It…

cond-mat.other200311 cited

How to search a social network

Lada A. Adamic, Eytan Adar

We address the question of how participants in a small world experiment are able to find short paths in a social network using only local information about their immediate contacts…

math.LO20032 cited

P is not equal to NP intersect coNP for Infinite Time Turing Machines

Vinay Deolalikar, Joel David Hamkins, Ralf-Dieter Schindler

Extending results of Schindler [math.LO/0106087] and Hamkins and Welch [math.LO/0212046], we establish in the context of infinite time Turing machines that P is properly contained…

quant-ph200349 cited

Universal quantum interfaces

Seth Lloyd, Andrew J. Landahl, Jean-Jacques E. Slotine

To observe or control a quantum system, one must interact with it via an interface. This letter exhibits simple universal quantum interfaces--quantum input/output ports consisting…

cond-mat.stat-mech200345 cited

Email as Spectroscopy: Automated Discovery of Community Structure within Organizations

Joshua R. Tyler, Dennis M. Wilkinson, Bernardo A. Huberman

We describe a methodology for the automatic identification of communities of practice from email logs within an organization. We use a betweeness centrality algorithm that can rapi…

quant-ph2003183 cited

Experimental implementation of an adiabatic quantum optimization algorithm

Matthias Steffen, Wim van Dam, Tad Hogg +2

We report the realization of a nuclear magnetic resonance computer with three quantum bits that simulates an adiabatic quantum optimization algorithm. Adiabatic quantum algorithms…