RESUMEN
Completely depolarizing channels are often regarded as the prototype of physical processes that are useless for communication: any message that passes through them along a well-defined trajectory is completely erased. When two such channels are used in a quantum superposition of two alternative orders, they become able to transmit some amount of classical information, but still no quantum information can pass through them. Here, we show that the ability to place N completely depolarizing channels in a superposition of N alternative causal orders enables a high-fidelity heralded transmission of quantum information with error vanishing as 1/N. This phenomenon highlights a fundamental difference with the N=2 case, where completely depolarizing channels are unable to transmit quantum data, even when placed in a superposition of causal orders. The ability to place quantum channels in a superposition of orders also leads to an increase of the classical communication capacity with N, which we rigorously prove by deriving an exact single-letter expression. Our results highlight the more complex patterns of correlations arising from multiple causal orders, which are similar to the more complex patterns of entanglement arising in multipartite quantum systems.
RESUMEN
We demonstrate the first proof of principle differential phase shift (DPS) quantum key distribution (QKD) using narrow-band heralded single photons with amplitude-phase modulations. In the 3-pulse case, we obtain a quantum bit error rate (QBER) as low as 3.06% which meets the unconditional security requirement. As we increase the pulse number up to 15, the key creation efficiency approaches 93.4%, but with a cost of increasing the QBER. Our result suggests that narrow-band single photons maybe a promising source for the DPS-QKD protocol.
Asunto(s)
Seguridad Computacional , Modelos Teóricos , Fotones , Teoría Cuántica , Procesamiento de Señales Asistido por Computador , Simulación por ComputadorRESUMEN
We consider a model that demonstrates the crucial role of inertia and stickiness in multiagent systems, based on the minority game. The inertia of an agent is introduced into the game model by allowing agents to apply hypothesis testing when choosing their best strategies, thereby reducing their reactivity toward changes in the environment. We find by extensive numerical simulations that our game shows a remarkable improvement of global cooperation throughout the whole phase space. In other words, the maladaptation behavior due to over-reaction of agents is removed. These agents are also shown to be advantageous over the standard ones, which are sometimes too sensitive to attain a fair success rate. We also calculate analytically the minimum amount of inertia needed to achieve the above improvement. Our calculation is consistent with the numerical simulation results. Finally, we review some related works in the field that show similar behaviors and compare them to our work.
RESUMEN
Minority game is a simple-mined econophysical model capturing the cooperative behavior among selfish players. Previous investigations, which were based on numerical simulations up to about 100 players for a certain parameter alpha in the range 0.1 < approximately alpha < approximately 1, suggested that memory is irrelevant to the cooperative behavior of the minority game in the so-called symmetric phase. Here using a large scale numerical simulation up to about 3000 players in the parameter range 0.01 < approximately alpha < approximately 1, we show that the mean variance of the attendance in the minority game actually depends on the memory in the symmetric phase. We explain such dependence in the framework of crowd-anticrowd theory. Our findings conclude that one should not overlook the feedback mechanism buried under the correlation in the history time series in the study of minority game.
RESUMEN
The parity of a bit string of length N is a global quantity that can be efficiently computed using a global counter in O(N) time. But is it possible to find the parity using cellular automata with a set of local rule tables without using any global counter? Here, we report a way to solve this problem using a number of r=1 binary, uniform, parallel, and deterministic cellular automata applied in succession for a total of O(N2) time.
RESUMEN
To demonstrate the usefulness of physical approaches for the study of realistic economic systems, we investigate the inequality of players' wealth in one of the most extensively studied econophysical models, namely, the minority game (MG). We gauge the wealth inequality of players in the MG by a well-known measure in economics known as the modified Gini index. From our numerical results, we conclude that the wealth inequality in the MG is very severe near the point of maximum cooperation among players, where the diversity of the strategy space is approximately equal to the number of strategies at play. In other words, the optimal cooperation between players comes hand in hand with severe wealth inequality. We also show that our numerical results in the asymmetric phase of the MG can be reproduced semianalytically using a replica method.
RESUMEN
We study numerically the behavior of the Biham-Middleton-Levine traffic model in three dimensions. Our extensive numerical simulations show that the phase diagram for this model in three dimensions is markedly different from that in one and two dimensions. In addition to the full speed moving as well as the completely jamming phases, whose respective average asymptotic car speeds (v) equal one and zero, we observe an extensive region of car densities rho with a low but nonzero average asymptotic car speed. The transition from this extensive low average asymptotic car speed region to the completely jamming region is at least second order. We argue that this low speed region is a result of the formation of a spatially limited-extended percolating cluster. Thus, this low speed phase is present in the (n>3)-dimensional Biham-Middleton-Levine model as well.