#### Filter Results:

#### Publication Year

2010

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Emily J. Pritchett, Colin Benjamin, +4 authors John M. Martinis
- 2010

We introduce a protocol for the fast simulation of n-dimensional quantum systems on n-qubit quantum computers with tunable couplings. A mapping is given between the control parameters of the quantum computer and the matrix elements of Hs(t), an arbitrary, real, time-dependent n × n dimensional Hamiltonian that is simulated in the n-dimensional 'single… (More)

- Namit Anand, Colin Benjamin
- Quantum Information Processing
- 2015

In a seminal paper, Meyer[1] described the advantages of quantum game theory by looking at the classical penny flip game. A player using quantum strategy can win against a classical player almost 100% of the time. Here we make a slight modification of the quantum game, with the two players sharing an entangled state to begin with. We then analyse two… (More)

- Jishnu Rajendran, Colin Benjamin
- ArXiv
- 2017

Parrondo's paradox is ubiquitous in games, ratchets and random walks.The apparent paradox, devised by Juan M. R. Parrondo, that two losing games A and B can produce an winning outcome has been adapted in many physical and biological systems to explain their working. However, proposals on demonstrating Parrondo's paradox using quantum walks failed in the… (More)

- Nilesh Vyas, Colin Benjamin
- ArXiv
- 2017

argue that the equilibrium solution to a quantum game isn't unique but is already present in the classical game itself. In this work, we debunk this assertion by showing that a random strategy in a particular quantum (Hawk-Dove) game is unique to the quantum game. In other words the equilibrium solution of the quantum Hawk-Dove game can not be obtained in… (More)

- Namit Anand, Colin Benjamin
- ArXiv
- 2014

- ‹
- 1
- ›