{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T06:46:46Z","timestamp":1750315606928,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,1,21]],"date-time":"2019-01-21T00:00:00Z","timestamp":1548028800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,1,21]]},"DOI":"10.1145\/3287624.3287701","type":"proceedings-article","created":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T21:45:18Z","timestamp":1547847918000},"page":"191-196","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":36,"title":["Quantum circuit compilers using gate commutation rules"],"prefix":"10.1145","author":[{"given":"Toshinari","family":"Itoko","sequence":"first","affiliation":[{"name":"IBM Research"}]},{"given":"Rudy","family":"Raymond","sequence":"additional","affiliation":[{"name":"IBM Research"}]},{"given":"Takashi","family":"Imamichi","sequence":"additional","affiliation":[{"name":"IBM Research"}]},{"given":"Atsushi","family":"Matsuo","sequence":"additional","affiliation":[{"name":"IBM Research"}]},{"given":"Andrew W.","family":"Cross","sequence":"additional","affiliation":[{"name":"IBM Research"}]}],"member":"320","published-online":{"date-parts":[[2019,1,21]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Debjyoti Bhattacharjee and Anupam Chattopadhyay. 2017. Depth-Optimal Quantum Circuit Placement for Arbitrary Topologies. arXiv:1703.08540 (2017).  Debjyoti Bhattacharjee and Anupam Chattopadhyay. 2017. Depth-Optimal Quantum Circuit Placement for Arbitrary Topologies. arXiv:1703.08540 (2017)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ADCOM.2007.111"},{"key":"e_1_3_2_1_3_1","unstructured":"Amlan Chakrabarti Susmita Sur-Kolay and Ayan Chaudhury. 2011. Linear nearest neighbor synthesis of reversible circuits by graph partitioning. arXiv:1112.0564 (2011).  Amlan Chakrabarti Susmita Sur-Kolay and Ayan Chaudhury. 2011. Linear nearest neighbor synthesis of reversible circuits by graph partitioning. arXiv:1112.0564 (2011)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2011383.2011393"},{"key":"e_1_3_2_1_5_1","unstructured":"IBM Q. 2017. IBM Q. https:\/\/www.research.ibm.com\/ibm-q\/.  IBM Q. 2017. IBM Q. https:\/\/www.research.ibm.com\/ibm-q\/."},{"key":"e_1_3_2_1_6_1","unstructured":"IBM Q. 2017. IBM Q 16 Rueschlikon V1.0.0 (ibmqx3). https:\/\/github.com\/Qiskit\/qiskit-backend-information\/blob\/master\/backends\/rueschlikon\/V1\/version_log.md.  IBM Q. 2017. IBM Q 16 Rueschlikon V1.0.0 (ibmqx3). https:\/\/github.com\/Qiskit\/qiskit-backend-information\/blob\/master\/backends\/rueschlikon\/V1\/version_log.md."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Aaron Lye Robert Wille and Rolf Drechsler. 2015. Determining the minimal number of swap gates for multi-dimensional nearest neighbor quantum circuits. In ASP-DAC. IEEE 178--183.  Aaron Lye Robert Wille and Rolf Drechsler. 2015. Determining the minimal number of swap gates for multi-dimensional nearest neighbor quantum circuits. In ASP-DAC. IEEE 178--183.","DOI":"10.1109\/ASPDAC.2015.7059001"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29517-1_8"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/775832.775915"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Yunseong Nam Neil J. Ross Yuan Su Andrew M. Childs and Dmitri Maslov. 2018. Automated optimization of large quantum circuits with continuous parameters. npj Quantum Information 4 1 (2018) 23.  Yunseong Nam Neil J. Ross Yuan Su Andrew M. Childs and Dmitri Maslov. 2018. Automated optimization of large quantum circuits with continuous parameters. npj Quantum Information 4 1 (2018) 23.","DOI":"10.1038\/s41534-018-0072-4"},{"key":"e_1_3_2_1_11_1","unstructured":"Alexandru Paler Alwin Zulehner and Robert Wille. 2018. NISQ circuit compilers: search space structure and heuristics. arXiv preprint quant-ph\/1806.07241 (2018).  Alexandru Paler Alwin Zulehner and Robert Wille. 2018. NISQ circuit compilers: search space structure and heuristics. arXiv preprint quant-ph\/1806.07241 (2018)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"John Preskill. 2018. Quantum Computing in the NISQ era and beyond. arXiv:1801.00862 (2018).  John Preskill. 2018. Quantum Computing in the NISQ era and beyond. arXiv:1801.00862 (2018).","DOI":"10.22331\/q-2018-08-06-79"},{"key":"e_1_3_2_1_13_1","unstructured":"Qiskit. 2017. Quantum Information Science Kit. https:\/\/www.qiskit.org\/.  Qiskit. 2017. Quantum Information Science Kit. https:\/\/www.qiskit.org\/."},{"key":"e_1_3_2_1_14_1","unstructured":"Md. Mazder Rahman and Gerhard W. Dueck. 2015. Synthesis of linear nearest neighbor quantum circuits. arXiv:1508.05430 (2015).  Md. Mazder Rahman and Gerhard W. Dueck. 2015. Synthesis of linear nearest neighbor quantum circuits. arXiv:1508.05430 (2015)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-017-1662-3"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-010-0201-2"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463209.2488785"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Alireza Shafaei Mehdi Saeedi and Massoud Pedram. 2014. Qubit placement to minimize communication overhead in 2D quantum architectures. In ASP-DAC. IEEE 495--500.  Alireza Shafaei Mehdi Saeedi and Massoud Pedram. 2014. Qubit placement to minimize communication overhead in 2D quantum architectures. In ASP-DAC. IEEE 495--500.","DOI":"10.1109\/ASPDAC.2014.6742940"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3168822"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29517-1_6"},{"volume-title":"Temporal Planning for Compilation of Quantum Approximate Optimization Circuits. In International Joint Conference on Artificial Intelligence. 89--101","year":"2017","author":"Venturelli Davide","key":"e_1_3_2_1_21_1"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Robert Wille Oliver Keszocze Marcel Walter Patrick Rohrs Anupam Chattopadhyay and Rolf Drechsler. 2016. Look-ahead schemes for nearest neighbor optimization of 1D and 2D quantum circuits. In ASP-DAC. IEEE 292--297.  Robert Wille Oliver Keszocze Marcel Walter Patrick Rohrs Anupam Chattopadhyay and Rolf Drechsler. 2016. Look-ahead schemes for nearest neighbor optimization of 1D and 2D quantum circuits. In ASP-DAC. IEEE 292--297.","DOI":"10.1109\/ASPDAC.2016.7428026"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Robert Wille Aaron Lye and Rolf Drechsler. 2014. Optimal SWAP gate insertion for nearest neighbor quantum circuits. In ASP-DAC. IEEE 489--494.  Robert Wille Aaron Lye and Rolf Drechsler. 2014. Optimal SWAP gate insertion for nearest neighbor quantum circuits. In ASP-DAC. IEEE 489--494.","DOI":"10.1109\/ASPDAC.2014.6742939"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Alwin Zulehner Alexandru Paler and Robert Wille. 2018. An Efficient Methodology for Mapping Quantum Circuits to the IBM QX Architectures. IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems (TCAD) (2018). Implementation is available at http:\/\/iic.jku.at\/eda\/research\/ibm_qx_mapping\/.  Alwin Zulehner Alexandru Paler and Robert Wille. 2018. An Efficient Methodology for Mapping Quantum Circuits to the IBM QX Architectures. IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems (TCAD) (2018). Implementation is available at http:\/\/iic.jku.at\/eda\/research\/ibm_qx_mapping\/.","DOI":"10.23919\/DATE.2018.8342181"}],"event":{"name":"ASPDAC '19: 24th Asia and South Pacific Design Automation Conference","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEICE ESS Institute of Electronics, Information and Communication Engineers, Engineering Sciences Society","IEEE CAS","IEEE CEDA","IPSJ SIG-SLDM Information Processing Society of Japan, SIG System LSI Design Methodology"],"location":"Tokyo Japan","acronym":"ASPDAC '19"},"container-title":["Proceedings of the 24th Asia and South Pacific Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3287624.3287701","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3287624.3287701","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:53Z","timestamp":1750208273000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3287624.3287701"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,21]]},"references-count":24,"alternative-id":["10.1145\/3287624.3287701","10.1145\/3287624"],"URL":"https:\/\/doi.org\/10.1145\/3287624.3287701","relation":{},"subject":[],"published":{"date-parts":[[2019,1,21]]},"assertion":[{"value":"2019-01-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}