Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0708.1129 · New Journal of Physics

Experimental realization of a quantum game on a one-way quantum computer

Robert Prevedel, André Stefanov, Philip John Walther, Anton Zeilinger

Published Jun 29, 2007• 70 citations
arXivHTMLPDF

Abstract

We report the first demonstration of a quantum game on an all-optical one-way quantum computer. Following a recent theoretical proposal we implement a quantum version of Prisoner's Dilemma, where the quantum circuit is realized by a four-qubit box-cluster configuration and the player's local strategies by measurements performed on the physical qubits of the cluster. This demonstration underlines the strength and versatility of the one-way model and we expect that this will trigger further interest in designing quantum protocols and algorithms to be tested in state-of-the-art cluster resources.

DOI
10.1088/1367-2630/9/6/205

Related papers

Experimental Realization of Deutsch’s Algorithm in a One-Way Quantum Computer

Mark Tame, Robert Prevedel, Mauro Paternostro +3 more

We report the first experimental demonstration of an all-optical one-way implementation of Deutsch's quantum algorithm on a four-qubit cluster state. All the possible configurations of a balanced or constant function acting on a two-qubit register are realized within the measurement-based model for quantum computation. The experimental results are in excellent agreement with the theoretical model, therefore demonstrating the successful performance of the algorithm.

arXiv:quant-ph/0611186•Physical Review Letters•Apr 2, 2007•124 citations

Hybrid cluster state proposal for a quantum game

Mauro Paternostro, Mark Tame, M. S. Kim

We propose an experimental implementation of a quantum game algorithm in a hybrid scheme combining the quantum circuit approach and the cluster state model. An economical cluster configuration is suggested to embody a quantum version of the Prisoners' Dilemma. Our proposal is shown to be within the experimental state of the art and can be realized with existing technology.The effects of relevant experimental imperfections are also carefully examined.

arXiv:quant-ph/0509066•New Journal of Physics•Oct 24, 2005•15 citations

Experimental Implementation of Quantum Prisoner Dilemma on IBM Quantum Computers

Kanyangzi Xu, Zhe Wu

Theory of games is an important discipline of applied mathematics, which has found numerous applications in psychology, ecology, and social science. While a well-established framework has been established for classical game theory, extending, and generalizing it towards the quantum domain still has some open questions. In this project, we focus on the prisoner’s dilemma-a standard example of a game analyzed in game theory-in a quantum world. Here, we start with the quantum version of prisoner’s dilemma, explain the quantum circuit implementation for describing the behavior of quantum prisoners, and investigate how quantum entanglement can change their strategies. By using the IBM quantum computer, we experimentally study the quantum prisoner dilemma, and we conclude that the best quantum strategies will break the prisoner’s dilemma.

International Conference on Advanced Computer Theory and Engineering•Sep 23, 2022•0 citations

Experimental Realization of a One-Way Quantum Computer Algorithm Solving Simon’s Problem

Mark Tame, Bryn A. Bell, Carlo D. Franco +2 more

We report an experimental demonstration of a one-way implementation of a quantum algorithm solving Simon's problem-a black-box period-finding problem that has an exponential gap between the classical and quantum runtime. Using an all-optical setup and modifying the bases of single-qubit measurements on a five-qubit cluster state, key representative functions of the logical two-qubit version's black box can be queried and solved. To the best of our knowledge, this work represents the first experimental realization of the quantum algorithm solving Simon's problem. The experimental results are in excellent agreement with the theoretical model, demonstrating the successful performance of the algorithm. With a view to scaling up to larger numbers of qubits, we analyze the resource requirements for an n-qubit version. This work helps highlight how one-way quantum computing provides a practical route to experimentally investigating the quantum-classical gap in the query complexity model.

arXiv:1410.3859•Physical Review Letters•Nov 11, 2014•33 citations

Experimental Realization of Quantum Games on a Quantum Computer

Jiangfeng Du, Hui Li, Xiaodong Xu +4 more

We generalize the quantum prisoner's dilemma to the case where the players share a nonmaximally entangled states. We show that the game exhibits an intriguing structure as a function of the amount of entanglement with two thresholds which separate a classical region, an intermediate region, and a fully quantum region. Furthermore this quantum game is experimentally realized on our nuclear magnetic resonance quantum computer.

arXiv:quant-ph/0104087•Physical Review Letters•Mar 12, 2002•291 citations

Prisoners’ Dilemma in a Spatially Separated System Based on Spin–Photon Interactions

Azmi Ali Altıntaṣ, Fatih Özaydin, Cihan Bayındır +1 more

Having access to ideal quantum mechanical resources, the prisoners’ dilemma can be ceased. Here, we propose a distributed quantum circuit to allow spatially separated prisoners to play the prisoners’ dilemma game. Decomposing the circuit into controlled-Z and single-qubit gates only, we design a corresponding spin–photon-interaction-based physical setup within the reach of current technology. In our setup, spins are considered to be the players’ logical qubits, which can be realized via nitrogen-vacancy centers in diamond or quantum dots coupled to optical cavities, and the game is played via a flying photon realizing logic operations by interacting with the spatially separated optical cavities to which the spin qubits are coupled. We also analyze the effect of the imperfect realization of two-qubit gates on the game, and discuss the revival of the dilemma and the emergence of new Nash equilibria.

Photonics•Aug 30, 2022•18 citations
We report the first demonstration of a quantum game on an all-optical one-way quantum computer. Following a recent theoretical proposal we implement a quantum version of Prisoner's Dilemma, where the quantum circuit is realized by a four-qubit box-cluster configuration and the player's local strategies by measurements performed on the physical qubits of the cluster. This demonstration underlines the strength and versatility of the one-way model and we expect that this will trigger further interest in designing quantum protocols and algorithms to be tested in state-of-the-art cluster resources.
Theory of games is an important discipline of applied mathematics, which has found numerous applications in psychology, ecology, and social science. While a well-established framework has been established for classical game theory, extending, and generalizing it towards the quantum domain still has some open questions. In this project, we focus on the prisoner’s dilemma-a standard example of a game analyzed in game theory-in a quantum world. Here, we start with the quantum version of prisoner’s dilemma, explain the quantum circuit implementation for describing the behavior of quantum prisoners, and investigate how quantum entanglement can change their strategies. By using the IBM quantum computer, we experimentally study the quantum prisoner dilemma, and we conclude that the best quantum strategies will break the prisoner’s dilemma.
We report an experimental demonstration of a one-way implementation of a quantum algorithm solving Simon's problem-a black-box period-finding problem that has an exponential gap between the classical and quantum runtime. Using an all-optical setup and modifying the bases of single-qubit measurements on a five-qubit cluster state, key representative functions of the logical two-qubit version's black box can be queried and solved. To the best of our knowledge, this work represents the first experimental realization of the quantum algorithm solving Simon's problem. The experimental results are in excellent agreement with the theoretical model, demonstrating the successful performance of the algorithm. With a view to scaling up to larger numbers of qubits, we analyze the resource requirements for an n-qubit version. This work helps highlight how one-way quantum computing provides a practical route to experimentally investigating the quantum-classical gap in the query complexity model.
Having access to ideal quantum mechanical resources, the prisoners’ dilemma can be ceased. Here, we propose a distributed quantum circuit to allow spatially separated prisoners to play the prisoners’ dilemma game. Decomposing the circuit into controlled-Z and single-qubit gates only, we design a corresponding spin–photon-interaction-based physical setup within the reach of current technology. In our setup, spins are considered to be the players’ logical qubits, which can be realized via nitrogen-vacancy centers in diamond or quantum dots coupled to optical cavities, and the game is played via a flying photon realizing logic operations by interacting with the spatially separated optical cavities to which the spin qubits are coupled. We also analyze the effect of the imperfect realization of two-qubit gates on the game, and discuss the revival of the dilemma and the emergence of new Nash equilibria.