Generating highly entangled states via discrete-time quantum walks with Parrondo sequences
Dinesh Kumar Panda, B. Varun Govind, Colin Benjamin

TL;DR
This paper introduces a method using discrete-time quantum walks with Parrondo sequences to generate highly entangled quantum states, achieving maximally entangled states regardless of initial conditions.
Contribution
It proposes deterministic Parrondo sequences for quantum walks that produce more entangled states than traditional single-coin sequences, including maximally entangled states.
Findings
Parrondo sequences generate states with higher entanglement than single-coin sequences.
Some sequences produce maximally entangled states independent of initial phase.
The method is effective for both short and long time steps.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum-Dot Cellular Automata
