English
Related papers

Related papers: Simple setups for quantum games in optical network…

200 papers

It has previously been shown that probabilistic quantum logic operations can be performed using linear optical elements, additional photons (ancilla), and post-selection based on the output of single-photon detectors. Here we describe the…

Quantum Physics · Physics 2009-11-07 T. B. Pittman , B. C. Jacobs , J. D. Franson

We suggest an efficient scheme for quantum computation with linear optical elements utilizing "linked" photon states. The linked states are designed according to the particular quantum circuit one wishes to process. Once a linked-state has…

Quantum Physics · Physics 2009-11-10 Nadav Yoran , Benni Reznik

Systems of linear equations are used to model a wide array of problems in all fields of science and engineering. Recently, it has been shown that quantum computers could solve linear systems exponentially faster than classical computers,…

Scalable and efficient quantum computation with photonic qubits requires (i) deterministic sources of single-photons, (ii) giant nonlinearities capable of entangling pairs of photons, and (iii) reliable single-photon detectors. In addition,…

Quantum Physics · Physics 2007-05-23 David Petrosyan

In this paper, we propose a Quantum variation of combinatorial games, generalizing the Quantum Tic-Tac-Toe proposed by Allan Goff. A combinatorial game is a two-player game with no chance and no hidden information, such as Go or Chess. In…

Discrete Mathematics · Computer Science 2018-03-06 Paul Dorbec , Mehdi Mhalla

An optical model of classical photons propagating through array of many beam splitters is developed to give a physical analogy of Parrondo's game and Parrondo-Harmer-Abbott game. We showed both the two games are reasonable game without…

Statistical Mechanics · Physics 2013-01-22 Tieyan Si

The initial proposal for scalable optical quantum computing required single photon sources, linear optical elements such as beamsplitters and phaseshifters, and photon detection. Here we demonstrate a two qubit gate using indistinguishable…

Simple stochastic games are turn-based 2.5-player zero-sum graph games with a reachability objective. The problem is to compute the winning probability as well as the optimal strategies of both players. In this paper, we compare the three…

Computer Science and Game Theory · Computer Science 2022-07-21 Jan Kretinsky , Emanuel Ramneantu , Alexander Slivinskiy , Maximilian Weininger

We propose a realization of quantum computing using polarized photons. The information is coded in two polarization directions of the photons and two-qubit operations are done using conditional Faraday effect. We investigate the performance…

Quantum Physics · Physics 2007-05-23 P. Torma , S. Stenholm

This paper proposes a game-theoretic approach to address the problem of optimal sensor placement for detecting cyber-attacks in networked control systems. The problem is formulated as a zero-sum game with two players, namely a malicious…

Optimization and Control · Mathematics 2022-05-30 Anh Tung Nguyen , André M. H. Teixeira , Alexander Medvedev

Four-qubit cluster states of two photons entangled in polarization and linear momentum have been used to realize a complete set of single qubit rotations and the C-NOT gate for equatorial qubits with high values of fidelity. By the…

Quantum Physics · Physics 2015-05-13 Giuseppe Vallone , Enrico Pomarico , Francesco De Martini , Paolo Mataloni

We present a scheme for playing quantum repeated 2x2 games based on the Marinatto and Weber's approach to quantum games. As a potential application, we study twice repeated Prisoner's Dilemma game. We show that results not available in…

Quantum Physics · Physics 2015-05-30 Piotr Frackiewicz

Iterated bipartite quantum games are implemented in terms of the discrete-time quantum walk on the line. Our proposal allows for conditional strategies, as two rational agents make a choice from a restricted set of two-qubit unitary…

Quantum Physics · Physics 2008-07-31 G. Abal , R. Donangelo , H. Fort

We develop an octonionic representation of the payoff function for three player, two strategy, maximally entangled quantum games in order to obtain computationally friendly version of this function. This computational capability is then…

Quantum Physics · Physics 2012-02-15 Aden Ahmed , Steve Bleiler , Faisal Shah Khan

We suggest and demonstrate a scheme for coherent nonlocal compensation of pure phase objects based on two-photon polarization and momentum entangled states. The insertion of a single phase object on one of the beams reduces the purity of…

Quantum Physics · Physics 2015-05-28 S. Cialdi , D. Brivio , E. Tesio , M. G. A. Paris

A source of entangled photons that emits one, and only one, pair of photons on demand has now been realized in a semiconductor chip. The solid-state source will be a useful resource for experiments in optical quantum information.

Popular Physics · Physics 2015-06-23 Chao-Yang Lu , Jian-Wei Pan

Quantum illumination is an entanglement-based target detection protocol that provides quantum advantages despite the presence of entanglement-breaking noise. However, the advantage of traditional quantum illumination protocols is limited to…

Quantum Physics · Physics 2024-06-26 Xiaobin Zhao , Zheshen Zhang , Quntao Zhuang

We present a constructive method to translate small quantum circuits into their optical analogues, using linear components of present-day quantum optics technology only. These optical circuits perform precisely the computation that the…

Quantum Physics · Physics 2007-05-23 C. Adami , N. J. Cerf

We describe the representation of arbitrary density operators in terms of expectation values of simple projection operators. Two representations are presented which yield non--recursive schemes for experimentally determining the density…

Quantum Physics · Physics 2009-10-28 Ole Steuernagel , John A. Vaccaro

Simple stochastic games are turn-based 2.5-player zero-sum graph games with a reachability objective. The problem is to compute the winning probability as well as the optimal strategies of both players. In this paper, we compare the three…

Computer Science and Game Theory · Computer Science 2020-09-24 Jan Křetínský , Emanuel Ramneantu , Alexander Slivinskiy , Maximilian Weininger