activity
20062009
most citedNew models of quantum games

6 citations · 13 across the 20 of their papers we have counts for

collaborators
Showing 2006 · quant-phShow all

9 papers · 2 filters

quant-ph20061 cited

Using Disentangled States and Algorithmic Information Theory to Construct a Not P Problem

Rubens Viana Ramos

In this work, are used Chaitin number Omega and the fact that the general decomposition of an N-way disentangled state is an irreducible sentence whose number of coefficients grows…

quant-ph2006

The Relation between Disentangled States and Algorithmic Information Theory

Rubens Viana Ramos

In this short communication it is proposed the general form of a n-qubit disentangled state as a irreducible sentence, in the sense explained by the algorithmic information theory,…

quant-ph2006

Simple setups for quantum games in optical networks

Rubens Viana Ramos, Paulo Benicio Melo de Sousa

In this work, we propose two optical setups for two-players, non-zero and zero sum, quantum games in optical networks using light polarization of single-photon pulses, single-photo…

quant-ph2006

Hybrid Parallel Quantum Key Distribution Protocol

Fabio Alencar Mendonca, Rubens Viana Ramos

The practical realizations of BB84 quantum key distribution protocol using single-photon or weak coherent states have normally presented low efficiency, in the meaning that most bi…

quant-ph2006

Linear optical setups for active and passive quantum error correction in polarization encoded qubits

Jose Claudio do Nascimento, Fabio Alencar Mendonca, Rubens Viana Ramos

In this work, we present active and passive linear optical setups for error correction in quantum communication systems that employ polarization of single-photon and mesoscopic coh…

quant-ph2006

Contract Signature Using Quantum Information

Paulo Benicio Melo de Sousa, Rubens Viana Ramos

This paper describes how to perform contract signature in a fair way using quantum information. The protocol proposed permits two partners, users of a communication network, to per…