{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:33:28Z","timestamp":1742978008190,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319599359"},{"type":"electronic","value":"9783319599366"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59936-6_1","type":"book-chapter","created":{"date-parts":[[2017,5,24]],"date-time":"2017-05-24T11:12:32Z","timestamp":1495624352000},"page":"3-16","source":"Crossref","is-referenced-by-count":2,"title":["Tools for Quantum and Reversible Circuit Compilation"],"prefix":"10.1007","author":[{"given":"Martin","family":"Roetteler","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,25]]},"reference":[{"key":"1_CR1","unstructured":"Federal information processing standards publication 180\u20132, 2002. See also the Wikipedia entry. http:\/\/en.wikipedia.org\/wiki\/SHA-2"},{"key":"1_CR2","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.tcs.2016.01.011","volume":"618","author":"N Abdessaied","year":"2016","unstructured":"Abdessaied, N., Amy, M., Drechsler, R., Soeken, M.: Complexity of reversible circuits and their quantum implementations. Theor. Comput. Sci. 618, 85\u2013106 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"1_CR3","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1109\/TCAD.2013.2244643","volume":"32","author":"M Amy","year":"2013","unstructured":"Amy, M., Maslov, D., Mosca, M., Roetteler, M.: A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 32(6), 818\u2013830 (2013)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circ. Syst."},{"key":"1_CR4","first-page":"992","volume":"2016","author":"M Amy","year":"2016","unstructured":"Amy, M., Di Matteo, O., Gheorghiu, V., Mosca, M., Parent, A., Schanck, J.M.: Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3. IACR Cryptol. ePrint Arch. 2016, 992 (2016)","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"5","key":"1_CR5","doi-asserted-by":"crossref","first-page":"3457","DOI":"10.1103\/PhysRevA.52.3457","volume":"52","author":"A Barenco","year":"1995","unstructured":"Barenco, A., Bennett, C.H., Cleve, R., DiVincenzo, D.P., Margolus, N., Shor, P., Sleator, T., Smolin, J.A., Weinfurter, H.: Elementary gates for quantum computation. Phys. Rev. A 52(5), 3457 (1995)","journal-title":"Phys. Rev. A"},{"key":"1_CR6","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"17","author":"CH Bennett","year":"1973","unstructured":"Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17, 525\u2013532 (1973)","journal-title":"IBM J. Res. Dev."},{"key":"1_CR7","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1137\/0218053","volume":"18","author":"CH Bennett","year":"1989","unstructured":"Bennett, C.H.: Time\/space trade-offs for reversible computation. SIAM J. Comput. 18, 766\u2013776 (1989)","journal-title":"SIAM J. Comput."},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Berry, D.W., Childs, A.M., Cleve, R., Kothari, R., Somma, R.D.: Exponential improvement in precision for simulating sparse hamiltonians. In: Symposium on Theory of Computing (STOC 2014), pp. 283\u2013292 (2014)","DOI":"10.1145\/2591796.2591854"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Berry, D.W., Childs, A.M., Kothari, R.: Hamiltonian simulation with nearly optimal dependence on all parameters. In: IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS), pp. 792\u2013809 (2015)","DOI":"10.1109\/FOCS.2015.54"},{"key":"1_CR10","doi-asserted-by":"crossref","first-page":"012313","DOI":"10.1103\/PhysRevA.93.012313","volume":"93","author":"A Bocharov","year":"2016","unstructured":"Bocharov, A., Cui, S.X., Kliuchnikov, V., Wang, Z.: Efficient topological compilation for weakly-integral anyon model. Phys. Rev. A 93, 012313 (2016)","journal-title":"Phys. Rev. A"},{"key":"1_CR11","unstructured":"Bocharov, A., Cui, S.X., Roetteler, M., Svore, K.M.: Improved quantum ternary arithmetics. Quantum Inf. Comput. 16(9&10), 862\u2013884. arXiv preprint (2016). arXiv:1512.03824"},{"key":"1_CR12","doi-asserted-by":"crossref","first-page":"052317","DOI":"10.1103\/PhysRevA.91.052317","volume":"91","author":"A Bocharov","year":"2015","unstructured":"Bocharov, A., Roetteler, M., Svore, K.M.: Efficient synthesis of probabilistic quantum circuits with fallback. Phys. Rev. A 91, 052317 (2015)","journal-title":"Phys. Rev. A"},{"key":"1_CR13","unstructured":"Bocharov, A., Roetteler, M., Svore, K.M.: Efficient synthesis of universal repeat-until-success circuits. Phys. Rev. Lett. 114, 080502. arXiv preprint (2015). arXiv:1404.5320"},{"key":"1_CR14","unstructured":"Bocharov, A., Roetteler, M., Svore, K.M.: Factoring with qutrits: Shor\u2019s algorithm on ternary and metaplectic quantum architectures. arXiv preprint (2016). arXiv:1605.02756"},{"issue":"1","key":"1_CR15","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/10655140290009774","volume":"2002","author":"M Chrzanowska-Jeske","year":"2002","unstructured":"Chrzanowska-Jeske, M., Mishchenko, A., Perkowski, M.A.: Generalized inclusive forms - new canonical reed-muller forms including minimum esops. VLSI Des. 2002(1), 13\u201321 (2002)","journal-title":"VLSI Des."},{"key":"1_CR16","doi-asserted-by":"crossref","first-page":"250504","DOI":"10.1103\/PhysRevLett.110.250504","volume":"110","author":"BD Clader","year":"2013","unstructured":"Clader, B.D., Jacobs, B.C., Sprouse, C.R.: Preconditioned quantum linear system algorithm. Phys. Rev. Lett. 110, 250504 (2013)","journal-title":"Phys. Rev. Lett."},{"key":"1_CR17","unstructured":"Cuccaro, S.A., Draper, T.G., Kutin, S.A., Moulton, D.P.: A new quantum ripple-carry addition circuit. arXiv preprint (2004). arXiv:quant-ph\/0410184"},{"key":"1_CR18","unstructured":"Draper, T.G.: Addition on a quantum computer. arXiv preprint (2000). arXiv:quant-ph\/0008033"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Fowler, A.G., Mariantoni, M., Martinis, J.M., Cleland, A.N.: Surface codes: towards practical large-scale quantum computation. Phys. Rev. A 86, 032324 (2012). arXiv:1208.0928","DOI":"10.1103\/PhysRevA.86.032324"},{"key":"1_CR20","unstructured":"Gidney, C.: StackExchange: creating bigger controlled nots from single qubit, toffoli, and CNOT gates, without workspace (2015)"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-642-38986-3_10","volume-title":"Reversible Computation","author":"AS Green","year":"2013","unstructured":"Green, A.S., Lumsdaine, P.L.F., Ross, N.J., Selinger, P., Valiron, B.: An introduction to quantum programming in quipper. In: Dueck, G.W., Miller, D.M. (eds.) RC 2013. LNCS, vol. 7948, pp. 110\u2013124. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-38986-3_10"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Green, A.S., Lumsdaine, P.L., Ross, N.J., Selinger, P., Valiron, B.: Quipper: a scalable quantum programming language. In: Proceedings of Conference on Programming Language Design and Implementation (PLDI 2013). ACM (2013)","DOI":"10.1145\/2491956.2462177"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Grover, L.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Symposium on Theory of Computing (STOC 1996), pp. 212\u2013219. ACM Press (1996)","DOI":"10.1145\/237814.237866"},{"key":"1_CR24","unstructured":"H\u00e4ner, T., Roetteler, M., Svore, K.M. Factoring using $$2n{+}2$$ qubits with Toffoli based modular multiplication. arXiv preprint (2016). arXiv:1611.07995"},{"issue":"15","key":"1_CR25","doi-asserted-by":"crossref","first-page":"150502","DOI":"10.1103\/PhysRevLett.103.150502","volume":"103","author":"W Aram","year":"2009","unstructured":"Aram, W., Harrow, A.H., Lloyd, S.: Quantum algorithm for linear systems of equations. Phys. Rev. Lett. 103(15), 150502 (2009)","journal-title":"Phys. Rev. Lett."},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Heckey, J., Patil, S., JavadiAbhari, A., Holmes, A., Kudrow, D., Brown, K.R., Franklin, D., Chong, F.T., Martonosi, M.: Compiler management of communication and parallelism for quantum computation. In: Proceedings of the Twentieth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2015), pp. 445\u2013456. ACM (2015)","DOI":"10.1145\/2694344.2694357"},{"issue":"4","key":"1_CR27","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1080\/00107151031000110776","volume":"44","author":"J Kempe","year":"2003","unstructured":"Kempe, J.: Quantum random walks - an introductory overview. Contemporary Phys. 44(4), 307\u2013327 (2003)","journal-title":"Contemporary Phys."},{"issue":"1","key":"1_CR28","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1109\/TC.2015.2409842","volume":"65","author":"V Kliuchnikov","year":"2016","unstructured":"Kliuchnikov, V., Maslov, D., Mosca, M.: Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and $$T$$ circuits. IEEE Trans. Comput. 65(1), 161\u2013172 (2016)","journal-title":"IEEE Trans. Comput."},{"key":"1_CR29","doi-asserted-by":"crossref","first-page":"022311","DOI":"10.1103\/PhysRevA.93.022311","volume":"93","author":"D Maslov","year":"2016","unstructured":"Maslov, D.: On the advantages of using relative phase Toffolis with an application to multiple control Toffoli optimization. Phys. Rev. A 93, 022311 (2016)","journal-title":"Phys. Rev. A"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Mishchenko, A., Brayton, R.K., Chatterjee, S.: Boolean factoring and decomposition of logic networks. In: Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design, pp. 38\u201344. IEEE Press (2008)","DOI":"10.1109\/ICCAD.2008.4681549"},{"key":"1_CR31","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"issue":"7","key":"1_CR32","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1007\/s10773-005-7071-x","volume":"44","author":"B Oemer","year":"2005","unstructured":"Oemer, B.: Classical concepts in quantum programming. Int. J. Theor. Phys. 44(7), 943\u2013955 (2005)","journal-title":"Int. J. Theor. Phys."},{"issue":"15&16","key":"1_CR33","first-page":"1277","volume":"4","author":"A Paetznick","year":"2014","unstructured":"Paetznick, A., Svore, K.M.: Repeat-until-success: non-deterministic decomposition of single-qubit unitaries. Quantum Inf. Comput. 4(15&16), 1277\u20131301 (2014)","journal-title":"Quantum Inf. Comput."},{"key":"1_CR34","unstructured":"Parent, A., Roetteler, M., Svore, K.M.: Reversible circuit compilation with space constraints. arXiv preprint (2015). arXiv:1510.00377"},{"key":"1_CR35","unstructured":"Ross, N.J., Selinger, P.: Optimal ancilla-free Clifford+T approximation of z-rotations. arXiv preprint (2014). arXiv:403.2975"},{"key":"1_CR36","doi-asserted-by":"crossref","first-page":"042302","DOI":"10.1103\/PhysRevA.87.042302","volume":"87","author":"P Selinger","year":"2013","unstructured":"Selinger, P.: Quantum circuits of $$T$$ -depth one. Phys. Rev. A 87, 042302 (2013)","journal-title":"Phys. Rev. A"},{"issue":"1\u20132","key":"1_CR37","first-page":"159","volume":"15","author":"P Selinger","year":"2015","unstructured":"Selinger, P.: Efficient Clifford $$+T$$ approximation of single-qubit operators. Quantum Inf. Comput. 15(1\u20132), 159\u2013180 (2015)","journal-title":"Quantum Inf. Comput."},{"issue":"5","key":"1_CR38","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"1_CR39","unstructured":"Takahashi, Y., Tani, S., Kunihiro, N.: Quantum addition circuits, unbounded fan-out. arXiv preprint (2009). arXiv:0910.2530"},{"key":"1_CR40","unstructured":"Wecker, D., Svore, K.M.: LIQ Ui $$|\\rangle $$ : a software design architecture and domain-specific language for quantum computing. arXiv preprint arXiv:1402.4467"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59936-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T21:04:00Z","timestamp":1569359040000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59936-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319599359","9783319599366"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59936-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}