WEKO3
アイテム
{"_buckets": {"deposit": "9b97dfc9-290d-4a18-9a19-5f7e7336f558"}, "_deposit": {"created_by": 30, "id": "1831", "owners": [30], "pid": {"revision_id": 0, "type": "depid", "value": "1831"}, "status": "published"}, "_oai": {"id": "oai:oist.repo.nii.ac.jp:00001831", "sets": ["13"]}, "author_link": ["10949", "10950", "10951"], "item_10001_biblio_info_7": {"attribute_name": "Bibliographic Information", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2020-10-12", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "44", "bibliographicPageStart": "445306", "bibliographicVolumeNumber": "53", "bibliographic_titles": [{}, {"bibliographic_title": "Journal of Physics A: Mathematical and Theoretical", "bibliographic_titleLang": "en"}]}]}, "item_10001_creator_3": {"attribute_name": "Author", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Gratsea, Aikaterini"}], "nameIdentifiers": [{"nameIdentifier": "10949", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Metz, Friederike"}], "nameIdentifiers": [{"nameIdentifier": "10950", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Busch, Thomas"}], "nameIdentifiers": [{"nameIdentifier": "10951", "nameIdentifierScheme": "WEKO"}]}]}, "item_10001_description_5": {"attribute_name": "Abstract", "attribute_value_mlt": [{"subitem_description": "Entanglement is a key resource in many quantum information applications and achieving high values independently of the initial conditions is an important task. Here we address the problem of generating highly entangled states in a discrete time quantum walk irrespective of the initial state using two different approaches. First, we present and analyze a deterministic sequence of coin operators which produces high values of entanglement in a universal manner for a class of localized initial states. In a second approach, we optimize the discrete sequence of coin operators using a reinforcement learning algorithm. While the amount of entanglement produced by the deterministic sequence is fully independent of the initial states considered, the optimized sequences achieve in general higher average values of entanglement that do however depend on the initial state parameters. Our proposed sequence and optimization algorithm are especially useful in cases where the initial state is not fully known or entanglement has to be generated in a universal manner for a range of initial states.", "subitem_description_type": "Other"}]}, "item_10001_publisher_8": {"attribute_name": "Publisher", "attribute_value_mlt": [{"subitem_publisher": "IOP Publishing Ltd."}]}, "item_10001_relation_14": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_type": "isIdenticalTo", "subitem_relation_type_id": {"subitem_relation_type_id_text": "info:doi/10.1088/1751-8121/abb54d", "subitem_relation_type_select": "DOI"}}]}, "item_10001_relation_17": {"attribute_name": "Related site", "attribute_value_mlt": [{"subitem_relation_type_id": {"subitem_relation_type_id_text": "https://iopscience.iop.org/article/10.1088/1751-8121/abb54d", "subitem_relation_type_select": "URI"}}]}, "item_10001_rights_15": {"attribute_name": "Rights", "attribute_value_mlt": [{"subitem_rights": "© 2020 The Author(s)."}]}, "item_10001_source_id_9": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "1751-8113", "subitem_source_identifier_type": "ISSN"}, {"subitem_source_identifier": "1751-8121", "subitem_source_identifier_type": "ISSN"}]}, "item_10001_version_type_20": {"attribute_name": "Author\u0027s flag", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_970fb48d4fbd8a85", "subitem_version_type": "VoR"}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2020-12-09"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "Gratsea_2020_J._Phys._A _Math._Theor._53_44530.pdf", "filesize": [{"value": "2.1 MB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensefree": "Creative Commons Attribution 4.0 International(https://creativecommons.org/licenses/by/4.0/)", "licensetype": "license_free", "mimetype": "application/pdf", "size": 2100000.0, "url": {"label": "Gratsea_2020_J._Phys._A _Math._Theor._53_44530", "url": "https://oist.repo.nii.ac.jp/record/1831/files/Gratsea_2020_J._Phys._A _Math._Theor._53_44530.pdf"}, "version_id": "c68f256b-9096-4a39-93ea-a3fa74b94350"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "quantum walks", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}, {"subitem_subject": "entanglement", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}, {"subitem_subject": "reinforcement learning", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}, {"subitem_subject": "coin sequences", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "Universal and optimal coin sequences for high entanglement generation in 1D discrete time quantum walks", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Universal and optimal coin sequences for high entanglement generation in 1D discrete time quantum walks", "subitem_title_language": "en"}]}, "item_type_id": "10001", "owner": "30", "path": ["13"], "permalink_uri": "https://oist.repo.nii.ac.jp/records/1831", "pubdate": {"attribute_name": "公開日", "attribute_value": "2020-12-09"}, "publish_date": "2020-12-09", "publish_status": "0", "recid": "1831", "relation": {}, "relation_version_is_last": true, "title": ["Universal and optimal coin sequences for high entanglement generation in 1D discrete time quantum walks"], "weko_shared_id": 30}
Universal and optimal coin sequences for high entanglement generation in 1D discrete time quantum walks
https://oist.repo.nii.ac.jp/records/1831
https://oist.repo.nii.ac.jp/records/1831a443480d-6f9e-4e98-a02c-3f75a062b8cc
名前 / ファイル | ライセンス | アクション |
---|---|---|
Gratsea_2020_J._Phys._A _Math._Theor._53_44530 (2.1 MB)
|
Creative Commons Attribution 4.0 International(https://creativecommons.org/licenses/by/4.0/)
|
Item type | 学術雑誌論文 / Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2020-12-09 | |||||
タイトル | ||||||
言語 | en | |||||
タイトル | Universal and optimal coin sequences for high entanglement generation in 1D discrete time quantum walks | |||||
言語 | ||||||
言語 | eng | |||||
キーワード | ||||||
言語 | en | |||||
主題Scheme | Other | |||||
主題 | quantum walks | |||||
キーワード | ||||||
言語 | en | |||||
主題Scheme | Other | |||||
主題 | entanglement | |||||
キーワード | ||||||
言語 | en | |||||
主題Scheme | Other | |||||
主題 | reinforcement learning | |||||
キーワード | ||||||
言語 | en | |||||
主題Scheme | Other | |||||
主題 | coin sequences | |||||
資源タイプ | ||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
資源タイプ | journal article | |||||
著者(英) |
Gratsea, Aikaterini
× Gratsea, Aikaterini× Metz, Friederike× Busch, Thomas |
|||||
書誌情報 |
en : Journal of Physics A: Mathematical and Theoretical 巻 53, 号 44, p. 445306, 発行日 2020-10-12 |
|||||
抄録 | ||||||
内容記述タイプ | Other | |||||
内容記述 | Entanglement is a key resource in many quantum information applications and achieving high values independently of the initial conditions is an important task. Here we address the problem of generating highly entangled states in a discrete time quantum walk irrespective of the initial state using two different approaches. First, we present and analyze a deterministic sequence of coin operators which produces high values of entanglement in a universal manner for a class of localized initial states. In a second approach, we optimize the discrete sequence of coin operators using a reinforcement learning algorithm. While the amount of entanglement produced by the deterministic sequence is fully independent of the initial states considered, the optimized sequences achieve in general higher average values of entanglement that do however depend on the initial state parameters. Our proposed sequence and optimization algorithm are especially useful in cases where the initial state is not fully known or entanglement has to be generated in a universal manner for a range of initial states. | |||||
出版者 | ||||||
出版者 | IOP Publishing Ltd. | |||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 1751-8113 | |||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 1751-8121 | |||||
DOI | ||||||
関連タイプ | isIdenticalTo | |||||
識別子タイプ | DOI | |||||
関連識別子 | info:doi/10.1088/1751-8121/abb54d | |||||
権利 | ||||||
権利情報 | © 2020 The Author(s). | |||||
関連サイト | ||||||
識別子タイプ | URI | |||||
関連識別子 | https://iopscience.iop.org/article/10.1088/1751-8121/abb54d | |||||
著者版フラグ | ||||||
出版タイプ | VoR | |||||
出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 |