Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchCalcul cuantic

analiza aiqbench

This research establishes a geometric criterion for Parrondo's paradox within discrete-time quantum walks, demonstrating how combining losing strategies can yield winning outcomes when the resulting transport vector exits the cone spanned by individual strategies. By explicitly computing the probability of this paradoxical set, the study reframes the phenomenon as a specific instance of designing reachable transport in quantum systems. The findings offer fundamental insights into controlling asymptotic velocity and strategy composition in minimal quantum walk models.
Sursă care acoperăarXiv
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

The Geometry of Transport in Quantum Walks and Parrondo's Paradox

arXiv2 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2609.09269v1 Announce Type: new Abstract: We study Parrondo's paradox -- the phenomenon where combining losing strategies yields a winning one -- in a minimal discrete-time quantum walk. We introduce the transport vector, encoded in the coin's steady state, whose inner product with the initial coin state gives the walker's asymptotic velocity. More generally, the paradox emerges exactly when the transport vector of the combined strategy falls outside the cone spanned by the individual ones -- a geometric criterion valid for any combination of strategies. It explains, for instance, why composing two coin operators within a single step can produce the paradox while simple alternation between them cannot, since alternation keeps the combined vector confined to the cone. The paradoxical set has nonzero measure, and we compute its probability explicitly in representative cases. This casts the paradox as one instance of designing reachable transport in quantum walks.

Abstract:We study Parrondo's paradox -- the phenomenon where combining losing strategies yields a winning one -- in a minimal discrete-time quantum walk. We introduce the transport vector, encoded in the coin's steady state, whose inner product with the initial coin state gives the walker's asymptotic velocity. More generally, the paradox emerges exactly when the transport vector of the combined strategy falls outside the cone spanned by the individual ones -- a geometric criterion valid for any combination of strategies. It explains, for instance, why composing two coin operators within a single step can produce the paradox while simple alternation between them cannot, since alternation keeps the combined vector confined to the cone. The paradoxical set has nonzero measure, and we compute its probability explicitly in representative cases. This casts the paradox as one instance of designing reachable transport in quantum walks.

5+12 pages, 4 figures. Comments are welcome

Quantum Physics (quant-ph); Statistical Mechanics (cond-mat.stat-mech)

arXiv:2609.09269 [quant-ph]

(or arXiv:2609.09269v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2609.09269 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Text integral sub licența deschisă a publicației · 245 cuvinte

Subiecte conexe