activity
19982005
most citedBrokered Graph State Quantum Computing

129 citations · 137 across the 3 of their papers we have counts for

collaborators

7 papers

quant-ph2005129 cited

Brokered Graph State Quantum Computing

Simon C. Benjamin, Dan E. Browne, Joe Fitzsimons +1

We describe a procedure for graph state quantum computing that is tailored to fully exploit the physics of optically active multi-level systems. Leveraging ideas from the literatur…

cond-mat.other2005

Computation in Self-assembled Nanometre Scale Arrays

Simon C. Benjamin

Ordered nanoarrays, i.e. regular patterns of quantum structures at the nanometre scale, have recently been synthesized in a wide range of systems. Here I explore a possible route t…

quant-ph20038 cited

Quantum error correction in globally controlled arrays

Adel Bririd, Simon C. Benjamin, Alastair Kay

An interesting concept in quantum computation is that of global control (GC), where there is no need to manipulate qubits individually. One can implement a universal set of quantum…

quant-ph2001

Evolutionary quantum game

Roland Kay, Neil F. Johnson, Simon C. Benjamin

We present the first study of a dynamical quantum game. Each agent has a `memory' of her performance over the previous m timesteps, and her strategy can evolve in time. The game ex…

quant-ph2000

Multi-Player Quantum Games

Simon C. Benjamin, Patrick M. Hayden

Recently the concept of quantum information has been introduced into game theory. Here we present the first study of quantum games with more than two players. We discover that such…

quant-ph2000

Comment on `Quantum Games and Quantum Strategies'

Simon C. Benjamin, Patrick M. Hayden

In a recent paper, Eisert et al. presented a quantum mechanical generalization of Prisoner's Dilemma. They asserted that the maximally entangled game exhibits a unique Nash equilib…