Reversible Logic Synthesis by Quantum Rotation Gates
A. Abdollahi, M. Saeedi, and M. Pedram, "Reversible Logic Synthesis by Quantum Rotation Gates," Quantum Information and Computation, Vol. 13, No. 9-10, 2013 A rotation-based synthesis framework for reversible logic is proposed. We develop a canonical representation based on binary decision...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Abdollahi, Afshin Saeedi, Mehdi Pedram, Massoud |
| description | A. Abdollahi, M. Saeedi, and M. Pedram, "Reversible Logic
Synthesis by Quantum Rotation Gates," Quantum Information and Computation,
Vol. 13, No. 9-10, 2013 A rotation-based synthesis framework for reversible logic is proposed. We
develop a canonical representation based on binary decision diagrams and
introduce operators to manipulate the developed representation model.
Furthermore, a recursive functional bi-decomposition approach is proposed to
automatically synthesize a given function. While Boolean reversible logic is
particularly addressed, our framework constructs intermediate quantum states
that may be in superposition, hence we combine techniques from reversible
Boolean logic and quantum computation. The proposed approach results in
quadratic gate count for multiple-control Toffoli gates without ancillae,
linear depth for quantum carry-ripple adder, and quasilinear size for quantum
multiplexer. |
| doi_str_mv | 10.48550/arxiv.1302.5382 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1302_5382</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1302_5382</sourcerecordid><originalsourceid>FETCH-LOGICAL-a652-ca8648efdb1c98c9eda2a23269c86807318118b1d65c6f1cecebd071f72567e93</originalsourceid><addsrcrecordid>eNotzrFOwzAQgGEvDKiwMyG_QILPjp3LiCooSJFQS_fo7FzAUpug2K3I26MC07_9-oS4A1VWaK16oPk7nkswSpfWoL4W1Y7PPKfoDyzb6SMG-b6M-ZNTTNIvcnuiMZ-OcjdlynEa5YYypxtxNdAh8e1_V2L__LRfvxTt2-Z1_dgW5KwuAqGrkIfeQ2gwNNyTJm20awI6VLUBBEAPvbPBDRA4sO9VDUOtrau5MStx_7f9VXdfczzSvHQXfXfRmx8Nxj8g</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Reversible Logic Synthesis by Quantum Rotation Gates</title><source>arXiv.org</source><creator>Abdollahi, Afshin ; Saeedi, Mehdi ; Pedram, Massoud</creator><creatorcontrib>Abdollahi, Afshin ; Saeedi, Mehdi ; Pedram, Massoud</creatorcontrib><description>A. Abdollahi, M. Saeedi, and M. Pedram, "Reversible Logic
Synthesis by Quantum Rotation Gates," Quantum Information and Computation,
Vol. 13, No. 9-10, 2013 A rotation-based synthesis framework for reversible logic is proposed. We
develop a canonical representation based on binary decision diagrams and
introduce operators to manipulate the developed representation model.
Furthermore, a recursive functional bi-decomposition approach is proposed to
automatically synthesize a given function. While Boolean reversible logic is
particularly addressed, our framework constructs intermediate quantum states
that may be in superposition, hence we combine techniques from reversible
Boolean logic and quantum computation. The proposed approach results in
quadratic gate count for multiple-control Toffoli gates without ancillae,
linear depth for quantum carry-ripple adder, and quasilinear size for quantum
multiplexer.</description><identifier>DOI: 10.48550/arxiv.1302.5382</identifier><language>eng</language><subject>Computer Science - Data Structures and Algorithms ; Computer Science - Emerging Technologies ; Physics - Quantum Physics</subject><creationdate>2013-02</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1302.5382$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1302.5382$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Abdollahi, Afshin</creatorcontrib><creatorcontrib>Saeedi, Mehdi</creatorcontrib><creatorcontrib>Pedram, Massoud</creatorcontrib><title>Reversible Logic Synthesis by Quantum Rotation Gates</title><description>A. Abdollahi, M. Saeedi, and M. Pedram, "Reversible Logic
Synthesis by Quantum Rotation Gates," Quantum Information and Computation,
Vol. 13, No. 9-10, 2013 A rotation-based synthesis framework for reversible logic is proposed. We
develop a canonical representation based on binary decision diagrams and
introduce operators to manipulate the developed representation model.
Furthermore, a recursive functional bi-decomposition approach is proposed to
automatically synthesize a given function. While Boolean reversible logic is
particularly addressed, our framework constructs intermediate quantum states
that may be in superposition, hence we combine techniques from reversible
Boolean logic and quantum computation. The proposed approach results in
quadratic gate count for multiple-control Toffoli gates without ancillae,
linear depth for quantum carry-ripple adder, and quasilinear size for quantum
multiplexer.</description><subject>Computer Science - Data Structures and Algorithms</subject><subject>Computer Science - Emerging Technologies</subject><subject>Physics - Quantum Physics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzrFOwzAQgGEvDKiwMyG_QILPjp3LiCooSJFQS_fo7FzAUpug2K3I26MC07_9-oS4A1VWaK16oPk7nkswSpfWoL4W1Y7PPKfoDyzb6SMG-b6M-ZNTTNIvcnuiMZ-OcjdlynEa5YYypxtxNdAh8e1_V2L__LRfvxTt2-Z1_dgW5KwuAqGrkIfeQ2gwNNyTJm20awI6VLUBBEAPvbPBDRA4sO9VDUOtrau5MStx_7f9VXdfczzSvHQXfXfRmx8Nxj8g</recordid><startdate>20130221</startdate><enddate>20130221</enddate><creator>Abdollahi, Afshin</creator><creator>Saeedi, Mehdi</creator><creator>Pedram, Massoud</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20130221</creationdate><title>Reversible Logic Synthesis by Quantum Rotation Gates</title><author>Abdollahi, Afshin ; Saeedi, Mehdi ; Pedram, Massoud</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a652-ca8648efdb1c98c9eda2a23269c86807318118b1d65c6f1cecebd071f72567e93</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Computer Science - Data Structures and Algorithms</topic><topic>Computer Science - Emerging Technologies</topic><topic>Physics - Quantum Physics</topic><toplevel>online_resources</toplevel><creatorcontrib>Abdollahi, Afshin</creatorcontrib><creatorcontrib>Saeedi, Mehdi</creatorcontrib><creatorcontrib>Pedram, Massoud</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Abdollahi, Afshin</au><au>Saeedi, Mehdi</au><au>Pedram, Massoud</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Reversible Logic Synthesis by Quantum Rotation Gates</atitle><date>2013-02-21</date><risdate>2013</risdate><abstract>A. Abdollahi, M. Saeedi, and M. Pedram, "Reversible Logic
Synthesis by Quantum Rotation Gates," Quantum Information and Computation,
Vol. 13, No. 9-10, 2013 A rotation-based synthesis framework for reversible logic is proposed. We
develop a canonical representation based on binary decision diagrams and
introduce operators to manipulate the developed representation model.
Furthermore, a recursive functional bi-decomposition approach is proposed to
automatically synthesize a given function. While Boolean reversible logic is
particularly addressed, our framework constructs intermediate quantum states
that may be in superposition, hence we combine techniques from reversible
Boolean logic and quantum computation. The proposed approach results in
quadratic gate count for multiple-control Toffoli gates without ancillae,
linear depth for quantum carry-ripple adder, and quasilinear size for quantum
multiplexer.</abstract><doi>10.48550/arxiv.1302.5382</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.1302.5382 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_1302_5382 |
| source | arXiv.org |
| subjects | Computer Science - Data Structures and Algorithms Computer Science - Emerging Technologies Physics - Quantum Physics |
| title | Reversible Logic Synthesis by Quantum Rotation Gates |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-09T05%3A21%3A25IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Reversible%20Logic%20Synthesis%20by%20Quantum%20Rotation%20Gates&rft.au=Abdollahi,%20Afshin&rft.date=2013-02-21&rft_id=info:doi/10.48550/arxiv.1302.5382&rft_dat=%3Carxiv_GOX%3E1302_5382%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |