{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:15:25Z","timestamp":1759637725642,"version":"3.41.0"},"reference-count":27,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T00:00:00Z","timestamp":1180656000000},"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":["SIGACT News"],"published-print":{"date-parts":[[2007,6]]},"abstract":"<jats:p>Small depth quantum circuits have proved to be unexpectedly powerful in comparison to their classical counterparts. We survey some of the recent work on this and present some open problems.<\/jats:p>","DOI":"10.1145\/1272729.1272739","type":"journal-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T13:44:55Z","timestamp":1189777495000},"page":"35-50","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Small depth quantum circuits"],"prefix":"10.1145","volume":"38","author":[{"given":"Debajyoti","family":"Bera","sequence":"first","affiliation":[{"name":"Boston University"}]},{"given":"Frederic","family":"Green","sequence":"additional","affiliation":[{"name":"Clark University"}]},{"given":"Steven","family":"Homer","sequence":"additional","affiliation":[{"name":"Boston University"}]}],"member":"320","published-online":{"date-parts":[[2007,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293639"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.52.3457"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.74.4091"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796591"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.61.052306"},{"key":"e_1_2_1_6_1","first-page":"2","article-title":"An approximate Fourier transform useful in quantum factoring","author":"Coppersmith D.","year":"1964","unstructured":"D. Coppersmith . \" An approximate Fourier transform useful in quantum factoring \". IBM technical report RC 1964 2 , quant-ph\/0201067, 1994. D. Coppersmith. \"An approximate Fourier transform useful in quantum factoring\". IBM technical report RC19642, quant-ph\/0201067, 1994.","journal-title":"IBM technical report RC"},{"key":"e_1_2_1_7_1","first-page":"69","article-title":"A physics-free introduction to the quantum computation model","volume":"79","author":"Fenner S.","year":"2003","unstructured":"S. Fenner . \" A physics-free introduction to the quantum computation model \", Computational Complexity Column. Bulletin of EATCS , 79 : 69 -- 85 , 2003 . S. Fenner. \"A physics-free introduction to the quantum computation model\", Computational Complexity Column. Bulletin of EATCS, 79:69--85, 2003.","journal-title":"Computational Complexity Column. Bulletin of EATCS"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/2011679.2011682"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of 6th Italian Conference on theoretical Computer Science","author":"Fenner S.","year":"1998","unstructured":"S. Fenner , F. Green , S. Homer , and R. Pruim . \" Quantum NP is hard for PH \". Proceedings of 6th Italian Conference on theoretical Computer Science , World Scientific, Singapore, pages 241--252 , 1998 . S. Fenner, F. Green, S. Homer, and R. Pruim. \"Quantum NP is hard for PH\". Proceedings of 6th Italian Conference on theoretical Computer Science, World Scientific, Singapore, pages 241--252, 1998."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/792763.793362"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01744431"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.275.5298.350"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2011417.2011420"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2005.v001a005"},{"key":"e_1_2_1_15_1","volume-title":"Los Alamos Preprint archives quant-ph\/9903046","author":"Moore Cristopher","year":"1999","unstructured":"Cristopher Moore . \" Quantum Circuits : Fanout, Parity, and Counting \". In Los Alamos Preprint archives quant-ph\/9903046 , 1999 . Cristopher Moore. \"Quantum Circuits: Fanout, Parity, and Counting\". In Los Alamos Preprint archives quant-ph\/9903046, 1999."},{"key":"e_1_2_1_16_1","volume-title":"Los Alamos Preprint archives quant-ph\/9808027","author":"Moore Cristopher","year":"1998","unstructured":"Cristopher Moore and Martin Nilsson . \" Parallel Quantum Computation and Quantum Codes\". In Los Alamos Preprint archives quant-ph\/9808027 , 1998 . Cristopher Moore and Martin Nilsson. \"Parallel Quantum Computation and Quantum Codes\". In Los Alamos Preprint archives quant-ph\/9808027, 1998."},{"key":"e_1_2_1_17_1","volume-title":"Quantum computation and quantum information","author":"Nielsen M. A.","year":"2000","unstructured":"M. A. Nielsen and I. L. Chuang . \" Quantum computation and quantum information \". Cambridge University Press , 2000 . M. A. Nielsen and I. L. Chuang. \"Quantum computation and quantum information\". Cambridge University Press, 2000."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220062"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00111-6"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.85.3049"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01137685"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.256501"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28404"},{"key":"e_1_2_1_25_1","volume-title":"Vrije Universiteit","author":"\u0160palek R.","year":"2002","unstructured":"R. \u0160palek . \" Quantum Circuits with Unbounded Fan-out\". Master's Thesis , Faculty of Sciences , Vrije Universiteit , Amsterdam , 2002 . R. \u0160palek. \"Quantum Circuits with Unbounded Fan-out\". Master's Thesis, Faculty of Sciences, Vrije Universiteit, Amsterdam, 2002."},{"key":"e_1_2_1_26_1","doi-asserted-by":"crossref","unstructured":"H. Vollmer. \"Introduction to Circuit Complexity\". Springer-Verlag 1999.   H. Vollmer. \"Introduction to Circuit Complexity\". Springer-Verlag 1999.","DOI":"10.1007\/978-3-662-03927-4"},{"key":"e_1_2_1_27_1","first-page":"352","volume-title":"Proceedings of the 34th IEEE Symposium on Foundations of Computer Science","author":"Yao A. C.-C.","year":"1993","unstructured":"A. C.-C. Yao . \" Quantum circuit complexity\". In Proceedings of the 34th IEEE Symposium on Foundations of Computer Science , pages 352 -- 361 , 1993 . A. C.-C. Yao. \"Quantum circuit complexity\". In Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, pages 352--361, 1993."}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1272729.1272739","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1272729.1272739","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:52:03Z","timestamp":1750258323000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1272729.1272739"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,6]]}},"alternative-id":["10.1145\/1272729.1272739"],"URL":"https:\/\/doi.org\/10.1145\/1272729.1272739","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[2007,6]]},"assertion":[{"value":"2007-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}