{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T15:34:17Z","timestamp":1772724857260,"version":"3.50.1"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.23919\/date.2019.8715275","type":"proceedings-article","created":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T17:29:07Z","timestamp":1558027747000},"page":"1349-1354","source":"Crossref","is-referenced-by-count":13,"title":["Compiling Permutations for Superconducting QPUs"],"prefix":"10.23919","author":[{"given":"Mathias","family":"Soeken","sequence":"first","affiliation":[]},{"given":"Fereshte","family":"Mozafari","sequence":"additional","affiliation":[]},{"given":"Bruno","family":"Schmitt","sequence":"additional","affiliation":[]},{"given":"Giovanni De","family":"Micheli","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"183","DOI":"10.3934\/amc.2008.2.183","article-title":"Young subgroups for reversible computers","volume":"2","author":"de vos","year":"2008","journal-title":"Advances in Mathematics of Communications"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1989.0099"},{"key":"ref12","author":"nielsen","year":"2000","journal-title":"Quantum Computation and Quantum Information"},{"key":"ref13","article-title":"On the CNOT-complexity of CNOT-phase circuits","author":"amy","year":"2017"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/16\/3\/033040"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.91.027902"},{"key":"ref16","first-page":"55","article-title":"RevKit: A toolkit for reversible circuit design","volume":"18","author":"soeken","year":"2012","journal-title":"Multiple-Valued Logic and Soft Computing"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.52.3457"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.93.022311"},{"key":"ref4","article-title":"The future of quantum computing is counted in qubits","year":"2018"},{"key":"ref3","article-title":"A preview of Bristlecone, Google’s new quantum processor","year":"2018","journal-title":"Google AI Blog"},{"key":"ref6","article-title":"Alibaba Cloud and CAS launch one of the world’s most powerful public quantum computing services","year":"2018"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-017-01904-7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.85.5452"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1038\/nature23459"},{"key":"ref2","article-title":"Unsupervised machine learning on a hybrid quantum computer","author":"otterbach","year":"2017"},{"key":"ref1","article-title":"IBM builds its most powerful universal quantum computing processors","year":"2017"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2431211.2431220"}],"event":{"name":"2019 Design, Automation & Test in Europe Conference & Exhibition (DATE)","location":"Florence, Italy","start":{"date-parts":[[2019,3,25]]},"end":{"date-parts":[[2019,3,29]]}},"container-title":["2019 Design, Automation & Test in Europe Conference & Exhibition (DATE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8704855\/8714721\/08715275.pdf?arnumber=8715275","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T19:50:47Z","timestamp":1559591447000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8715275\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3]]},"references-count":19,"URL":"https:\/\/doi.org\/10.23919\/date.2019.8715275","relation":{},"subject":[],"published":{"date-parts":[[2019,3]]}}}