IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v608y2022ip1s0378437122008147.html
   My bibliography  Save this article

Generating highly entangled states via discrete-time quantum walks with Parrondo sequences

Author

Listed:
  • Panda, Dinesh Kumar
  • Govind, B. Varun
  • Benjamin, Colin

Abstract

Quantum entanglement has multiple applications in quantum information processing. Developing methods to generate highly entangled states independent of initial conditions is an essential task. Herein we aim to generate highly entangled states via discrete-time quantum walks. We propose deterministic Parrondo sequences that generate states that are generally much more entangled than states produced by sequences using only one of the two coins. We show that some Parrondo sequences generate highly entangled states, which are independent of the phase of the initial state used and further lead to maximally entangled states in some cases. We study Parrondo sequences for a small number of time steps and the asymptotic limit of a large number of time steps.

Suggested Citation

  • Panda, Dinesh Kumar & Govind, B. Varun & Benjamin, Colin, 2022. "Generating highly entangled states via discrete-time quantum walks with Parrondo sequences," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 608(P1).
    • Handle: RePEc:eee:phsmap:v:608:y:2022:i:p1:s0378437122008147
    DOI: 10.1016/j.physa.2022.128256
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437122008147
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2022.128256?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Gregory P. Harmer & Derek Abbott, 1999. "Losing strategies can win by Parrondo's paradox," Nature, Nature, vol. 402(6764), pages 864-864, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Lai, Joel Weijia & Cheong, Kang Hao, 2024. "A Parrondo paradoxical interplay of reciprocity and reputation in social dynamics," Chaos, Solitons & Fractals, Elsevier, vol. 179(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Rubina Zadourian, 2024. "Model-based and empirical analyses of stochastic fluctuations in economy and finance," Papers 2408.16010, arXiv.org.
    2. Breuer, Sandro & Mielke, Andreas, 2023. "Multi player Parrondo games with rigid coupling," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 622(C).
    3. Lai, Joel Weijia & Cheong, Kang Hao, 2023. "Boosting Brownian-inspired games with network synchronization," Chaos, Solitons & Fractals, Elsevier, vol. 168(C).
    4. Zhang, M. & Wang, Si-Yi & Hu, Xin-Tao & Alfaro-Bittner, K., 2021. "Local and global information affect cooperation in networked Prisoner’s dilemma games," Chaos, Solitons & Fractals, Elsevier, vol. 150(C).
    5. Rosas, Alexandre, 2021. "Synchronization induced by alternation of dynamics," Chaos, Solitons & Fractals, Elsevier, vol. 153(P2).
    6. Lai, Joel Weijia & Cheong, Kang Hao, 2024. "A Parrondo paradoxical interplay of reciprocity and reputation in social dynamics," Chaos, Solitons & Fractals, Elsevier, vol. 179(C).
    7. Miszczak, Jarosław Adam, 2022. "Constructing games on networks for controlling the inequalities in the capital distribution," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 594(C).
    8. Gupta, Divya & Chandramouli, V.V.M.S., 2022. "Dynamics of deformed Hénon-like map," Chaos, Solitons & Fractals, Elsevier, vol. 155(C).
    9. Lai, Joel Weijia & Cheong, Kang Hao, 2022. "Risk-taking in social Parrondo’s games can lead to Simpson’s paradox," Chaos, Solitons & Fractals, Elsevier, vol. 158(C).
    10. Ye, Ye & Zhang, Xin-shi & Liu, Lin & Xie, Neng-Gang, 2021. "Effects of group interactions on the network Parrondo’s games," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 583(C).
    11. Edward W. Piotrowski, "undated". "Problems with the Astumian's Paradox (in Polish)," Departmental Working Papers 121pl, University of Bialtystok, Department of Theoretical Physics.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:608:y:2022:i:p1:s0378437122008147. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.