{"id":10502,"updated":"2025-01-23T02:47:31.637312+00:00","links":{},"created":"2025-01-18T22:45:23.682725+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00010502","sets":["581:625:628"]},"path":["628"],"owner":"1","recid":"10502","title":["Automata with Quantum and Classical Resources"],"pubdate":{"attribute_name":"公開日","attribute_value":"2005-10-15"},"_buckets":{"deposit":"6e3c6fef-5f07-4077-8d63-9ea1fe39b191"},"_deposit":{"id":"10502","pid":{"type":"depid","value":"10502","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"Automata with Quantum and Classical Resources","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Automata with Quantum and Classical Resources"},{"subitem_title":"Automata with Quantum and Classical Resources","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"特集：量子計算と量子情報","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2005-10-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Nara Institute of Science and Technology"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Nara Institute of Science and Technology","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/10502/files/IPSJ-JNL4610002.pdf"},"date":[{"dateType":"Available","dateValue":"2007-10-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL4610002.pdf","filesize":[{"value":"245.2 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"cbafb1b2-823a-451d-ba88-01f335dc0a58","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2005 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Masaki, Nakanishi"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Masaki, Nakanishi","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"Quantum automata have been studied as simple quantum computation models. They can be considered models of small (or restricted) quantum computers. In this paper  we give descriptions of several kinds of quantum automata and show their power in comparison to their classical counterparts. We also give descriptions of quantum automata that have additional classical computational resources. Introducing classical computational resources can enhance the power of quantum automata  since this approach relaxes such restrictions as reversible state transitions.","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Quantum automata have been studied as simple quantum computation models. They can be considered models of small (or restricted) quantum computers. In this paper, we give descriptions of several kinds of quantum automata and show their power in comparison to their classical counterparts. We also give descriptions of quantum automata that have additional classical computational resources. Introducing classical computational resources can enhance the power of quantum automata, since this approach relaxes such restrictions as reversible state transitions.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"2391","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"2384","bibliographicIssueDates":{"bibliographicIssueDate":"2005-10-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"10","bibliographicVolumeNumber":"46"}]},"relation_version_is_last":true,"item_2_alternative_title_2":{"attribute_name":"その他タイトル","attribute_value_mlt":[{"subitem_alternative_title":"招待論文"}]},"weko_creator_id":"1"}}