{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T08:55:46Z","timestamp":1707814546132},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,12,23]],"date-time":"2014-12-23T00:00:00Z","timestamp":1419292800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s11128-014-0900-1","type":"journal-article","created":{"date-parts":[[2014,12,22]],"date-time":"2014-12-22T11:32:52Z","timestamp":1419247972000},"page":"891-899","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Reducing the number of ancilla qubits and the gate count required for creating large controlled operations"],"prefix":"10.1007","volume":"14","author":[{"given":"Katherine L.","family":"Brown","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anmer","family":"Daskin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sabre","family":"Kais","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan P.","family":"Dowling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,23]]},"reference":[{"issue":"5","key":"900_CR1","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 (1997)","journal-title":"SIAM J. Comput."},{"issue":"14","key":"900_CR2","doi-asserted-by":"crossref","first-page":"144112","DOI":"10.1063\/1.3575402","volume":"134","author":"A Daskin","year":"2011","unstructured":"Daskin, A., Kais, S.: Decomposition of unitary matrices for finding quantum circuits: application to molecular Hamiltonians. J. Chem. Phys. 134(14), 144112 (2011). doi: 10.1063\/1.3575402","journal-title":"J. Chem. Phys."},{"key":"900_CR3","doi-asserted-by":"crossref","unstructured":"Wang, H., Kais, S., \u00c4sp $$\\check{\\rm {u}}$$ u \u02c7 r\u00fb G\u016dz\u00edk, A., Hoffmann, M.R.: Quantum algorithm for obtaining the energy spectrum of molecular systems. Phys. Chem. Chem. Phys. 10(35), 5388 (2008). doi: 10.1039\/b804804e","DOI":"10.1039\/b804804e"},{"key":"900_CR4","doi-asserted-by":"crossref","unstructured":"Childs, A.M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., Spielman, D.A.: Exponential algorithmic speedup by a quantum walk. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing (ACM, New York, NY, USA, 2003), STOC \u201903, pp. 59\u201368 (2003). doi: 10.1145\/780542.780552","DOI":"10.1145\/780542.780552"},{"issue":"5","key":"900_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.: Complete methods set for scalable ion trap quantum information processing. Phys. Rev. A 52(5), 3457 (1995). doi: 10.1103\/PhysRevA.52.3457","journal-title":"Phys. Rev. A"},{"key":"900_CR6","volume-title":"Quantum Computation and Quantum Information","author":"M Nielsen","year":"2000","unstructured":"Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"issue":"25","key":"900_CR7","doi-asserted-by":"crossref","first-page":"1790","DOI":"10.1049\/el:20031202","volume":"39","author":"D Maslov","year":"2003","unstructured":"Maslov, D., Dueck, G.: Improved quantum cost for n-bit Toffoli gates. Electron. Lett. 39(25), 1790 (2003). doi: 10.1049\/el:20031202","journal-title":"Electron. Lett."},{"key":"900_CR8","doi-asserted-by":"crossref","unstructured":"Maslov, D., Young, C., Miller, D., Dueck, G.: Quantum circuit simplification using templates. In: Design, Automation and Test in Europe, 2005. Proceedings, vol. 2, pp. 1208\u20131213 (2005). doi: 10.1109\/DATE.2005.249","DOI":"10.1109\/DATE.2005.249"},{"key":"900_CR9","doi-asserted-by":"crossref","unstructured":"Scott, N.O., Dueck, G.W.: Pairwise decomposition of toffoli gates in a quantum circuit. In: Proceedings of the 18th ACM Great Lakes symposium on VLSI (ACM, New York, NY, USA, 2008), GLSVLSI \u201908, pp. 231\u2013236 (2008). doi: 10.1145\/1366110.1366168","DOI":"10.1145\/1366110.1366168"},{"key":"900_CR10","doi-asserted-by":"crossref","unstructured":"Wille, R., Grosse, D., Teuber, L., Dueck, G., Drechsler, R.: RevLib: an online resource for reversible functions and reversible circuits. In: Multiple Valued Logic, 2008. ISMVL 2008. 38th International Symposium on, pp. 220\u2013225 (2008). doi: 10.1109\/ISMVL.2008.43","DOI":"10.1109\/ISMVL.2008.43"},{"key":"900_CR11","doi-asserted-by":"crossref","unstructured":"Miller, D.M.: Lower cost quantum gate realizations of multiple-control Toffoli gates. In: IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, 2009. 308\u2013313 (2009). doi: 10.1109\/PACRIM.2009.5291355","DOI":"10.1109\/PACRIM.2009.5291355"},{"key":"900_CR12","doi-asserted-by":"crossref","unstructured":"Miller, D.M., Wille, R., Sasanian, Z.: Elementary quantum gate realizations for multiple-control Toffoli gates. In: 41st IEEE International Symposium on Multipe-Valued Logic, pp. 288\u2013293 (2011). doi: 10.1109\/ISMVL.2011.54","DOI":"10.1109\/ISMVL.2011.54"},{"key":"900_CR13","doi-asserted-by":"crossref","first-page":"022313","DOI":"10.1103\/PhysRevA.75.022313","volume":"75","author":"TC Ralph","year":"2007","unstructured":"Ralph, T.C., Resch, K.J., Gilchrist, A.: Efficient Toffoli gates using qudits. Phys. Rev. A 75, 022313 (2007). doi: 10.1103\/PhysRevA.75.022313","journal-title":"Phys. Rev. A"},{"issue":"2","key":"900_CR14","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1038\/nphys1150","volume":"5","author":"BP Lanyon","year":"2008","unstructured":"Lanyon, B.P., Barbieri, M., Almeida, M.P., Jennewein, T., Ralph, T.C., Resch, K.J., Pryde, G.J., O\u2019Brien, J.L., Gilchrist, A., White, A.G.: Simplifying quantum logic using higher-dimensional Hilbert spaces. Nat. Phys. 5(2), 134 (2008). doi: 10.1038\/nphys1150","journal-title":"Nat. Phys."},{"key":"900_CR15","unstructured":"Shende, V.V., Markov, I.L.: On the CNOT-cost of TOFFOLI gates. Quant. Inf. Comput. 9, 461 (2009). http:\/\/arxiv.org\/abs\/0803.2316"},{"key":"900_CR16","unstructured":"Margolus, N.: Simple quantum gates. unpublished manuscript c. (1994)"},{"key":"900_CR17","doi-asserted-by":"crossref","unstructured":"DiVincenzo, D.P.: Quantum gates and circuits. In: Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 454(1969), 261 (1998). doi: 10.1098\/rspa.1998.0159","DOI":"10.1098\/rspa.1998.0159"},{"key":"900_CR18","doi-asserted-by":"crossref","first-page":"3266","DOI":"10.1103\/PhysRevA.32.3266","volume":"32","author":"A Peres","year":"1985","unstructured":"Peres, A.: Reversible logic and quantum computers. Phys. Rev. A 32, 3266 (1985). doi: 10.1103\/PhysRevA.32.3266","journal-title":"Phys. Rev. A"},{"key":"900_CR19","unstructured":"Gosset, D., Kliuchnikov, V., Mosca, M., Russo, V.: An algorithm for the T-count. Quant. Inf. Comput. 14, 15\u201316 (2014). http:\/\/arxiv.org\/abs\/1308.4134"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-014-0900-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-014-0900-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-014-0900-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T07:39:19Z","timestamp":1559374759000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-014-0900-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,23]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["900"],"URL":"https:\/\/doi.org\/10.1007\/s11128-014-0900-1","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,23]]}}}