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

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...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Panda, Dinesh Kumar, B Varun Govind, Benjamin, Colin
Format Paper Journal Article
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 15.10.2022
Subjects
Coins
Data processing
Entangled states
Initial conditions
Mathematics - Quantum Algebra
Physics - Applied Physics
Physics - Disordered Systems and Neural Networks
Physics - Quantum Physics
Quantum entanglement
Quantum mechanics
Quantum phenomena
Sequences
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2331-8422
DOI:10.48550/arxiv.2008.00909