{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,9]],"date-time":"2025-02-09T05:16:48Z","timestamp":1739078208492,"version":"3.37.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener Comput"],"published-print":{"date-parts":[[2003,12]]},"DOI":"10.1007\/bf03037305","type":"journal-article","created":{"date-parts":[[2009,4,24]],"date-time":"2009-04-24T02:52:36Z","timestamp":1240541556000},"page":"297-317","source":"Crossref","is-referenced-by-count":3,"title":["Transformation rules for CNOT-based quantum circuits and their applications"],"prefix":"10.1007","volume":"21","author":[{"given":"Kazuo","family":"Iwama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shigeru","family":"Yamashita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF03037305_CR1","unstructured":"Yao, A., \u201cQuantum circuit complexity\u201d, inProc. of 34th Annual IEEE Symposium on Foudations of Computer Science, pp. 352\u2013361, 1993."},{"key":"BF03037305_CR2","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. and Weinfurter, H., \u201cElementary gates for quantum computation,\u201dPhysical Review A, 52, pp. 3457\u20133467, Nov. 1995.","journal-title":"Physical Review A"},{"key":"BF03037305_CR3","doi-asserted-by":"crossref","unstructured":"Williams, C. and Gray, A., \u201cAutomated Design of Quantum Circuits,\u201d inProc. of QCQC \u201998, LNCS 1509, pp. 113\u2013125, 1999.","DOI":"10.1007\/3-540-49208-9_8"},{"key":"BF03037305_CR4","unstructured":"Gruska, J.,Quantum Computing, McGraw Hill, 1999."},{"key":"BF03037305_CR5","doi-asserted-by":"crossref","unstructured":"Grover, L. K., \u201cA Fast Quantum Mechanical Algorithm for Database Search,\u201d inProc. of 28th ACM Symposium on Theory of Computing, pp. 212\u2013219, 1996.","DOI":"10.1145\/237814.237866"},{"key":"BF03037305_CR6","unstructured":"Lee, J.-S., Chung, Y., Kim, J. and Lee, S., \u201cA Practical Method of Constructing Quantum Combinational Logic Circuits,\u201d Tech. Rep. http:\/\/arXiv.org\/abs\/quant-ph\/9911053, LANL e-print, 1999."},{"key":"BF03037305_CR7","unstructured":"Shende, V., Prasad, A., Markov, I. and Hayes, J., \u201cReversible Logic Circuit Synthesis,\u201d Tech. Rep. http:\/\/arXiv.org\/abs\/quant-ph\/quant-ph\/0207001, LANL e-print, 2002."},{"key":"BF03037305_CR8","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1006\/spmi.2002.1039","volume":"31","author":"K. Iwama","year":"2002","unstructured":"Iwama, K. and Yamashita, S., \u201cA Complete Set of Transformation Rules for Quantum Boolean Circuits with CNOT Gates,\u201dSuperlattices and Microstructures, 31, pp. 181\u2013192, Oct. 2002.","journal-title":"Superlattices and Microstructures"},{"key":"BF03037305_CR9","doi-asserted-by":"crossref","first-page":"1062","DOI":"10.1109\/TCAD.1987.1270347","volume":"6","author":"R. K. Brayton","year":"1987","unstructured":"Brayton, R. K., Rudell, R., Sangiovanni-Vincentelli, A. and Wang, A. R., \u201cMIS: A Multiple-Level Logic Optimization System,\u201dIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, CAD-6, pp. 1062\u20131081, Nov. 1987.","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"BF03037305_CR10","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1147\/rd.254.0272","volume":"25","author":"J. Darringer","year":"1981","unstructured":"Darringer, J., Joyner, W., Berman, L. and Trevillyan, L., \u201cLSS: Logic Synthesis through Local Transformations,\u201dIBM J. Res. and Develop., 25, pp. 272\u2013280, July 1981.","journal-title":"IBM J. Res. and Develop."},{"key":"BF03037305_CR11","doi-asserted-by":"crossref","unstructured":"Iwama, K., Hino, K., Kurokawa, H. and Sawada, S., \u201cRandom Benchmark Circuits with Controlled Attributes,\u201d inProc. of European Design & Test Conference and Exhibition (ED&TC\u201997), pp. 90\u201397, 1997.","DOI":"10.1109\/EDTC.1997.582338"},{"key":"BF03037305_CR12","doi-asserted-by":"crossref","unstructured":"Iwama, K., \u201cComplexity of Finding Short Resolution Proofs,\u201d inProc. of 22nd Symposium on Mathematical Foundation of Computer Sceince (MFCS\u201997), LNCS 1295, pp. 309\u2013318, 1997.","DOI":"10.1007\/BFb0029974"},{"key":"BF03037305_CR13","doi-asserted-by":"crossref","unstructured":"Haken, A., \u201cThe Intractability of Resolution,\u201d inTheoretical Computer Science, 39, pp. 297\u2013308, 1985.","DOI":"10.1016\/0304-3975(85)90144-6"},{"key":"BF03037305_CR14","doi-asserted-by":"crossref","unstructured":"Bonet, M., Esteban, J., Galesi, N. and Johannsen, J., \u201cExponential Separation between Ressticted Resolution and Cutting Planes Proof Systems,\u201d inProc. of 39th Annual IEEE Symposium on Foudations of Computer Science, pp. 638\u2013647, 1998.","DOI":"10.1109\/SFCS.1998.743514"},{"key":"BF03037305_CR15","unstructured":"Nielsen, M. A. and Chuang, I. L.,Quantum Computation and Quantum Information, Cambridge University Press, 2000."},{"key":"BF03037305_CR16","doi-asserted-by":"crossref","unstructured":"Toffoli, T., \u201cReversible Computing,\u201d Tech. Rep. MIT\/LCS\/TM-151, MIT LCS, Feb. 1980.","DOI":"10.21236\/ADA082021"},{"key":"BF03037305_CR17","unstructured":"Davio, M., Deshamps, J.-P. and Thayse, A.,Discrete and Switching Functions, McGraw Hill International, 1978."},{"key":"BF03037305_CR18","unstructured":"Hactel, G. D. and Somenzi, F.,Logic Synthesis and Verification Algorithms, Kluwer Academic Publishers, 1996."}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037305.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03037305\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037305","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,9]],"date-time":"2025-02-09T04:39:25Z","timestamp":1739075965000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03037305"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["BF03037305"],"URL":"https:\/\/doi.org\/10.1007\/bf03037305","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"type":"print","value":"0288-3635"},{"type":"electronic","value":"1882-7055"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}