{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T08:05:17Z","timestamp":1776153917875,"version":"3.50.1"},"reference-count":55,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61832003"],"award-info":[{"award-number":["61832003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272441"],"award-info":[{"award-number":["62272441"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002367","name":"Strategic Priority Research Program of Chinese Academy of Sciences","doi-asserted-by":"publisher","award":["XDB28000000"],"award-info":[{"award-number":["XDB28000000"]}],"id":[{"id":"10.13039\/501100002367","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1109\/tcad.2023.3244885","type":"journal-article","created":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T18:59:10Z","timestamp":1676401150000},"page":"3301-3314","source":"Crossref","is-referenced-by-count":78,"title":["Asymptotically Optimal Circuit Depth for Quantum State Preparation and General Unitary Synthesis"],"prefix":"10.1109","volume":"42","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0281-1670","authenticated-orcid":false,"given":"Xiaoming","family":"Sun","sequence":"first","affiliation":[{"name":"State Key Laboratory of Processors, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China"}]},{"given":"Guojing","family":"Tian","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Processors, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China"}]},{"given":"Shuai","family":"Yang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Processors, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0233-6539","authenticated-orcid":false,"given":"Pei","family":"Yuan","sequence":"additional","affiliation":[{"name":"Tencent Quantum Laboratory, Tencent, Shenzhen, China"}]},{"given":"Shengyu","family":"Zhang","sequence":"additional","affiliation":[{"name":"Tencent Quantum Laboratory, Tencent, Shenzhen, China"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.113.130503"},{"key":"ref12","article-title":"Quantum spectral clustering","author":"kerenidis","year":"2020","journal-title":"arXiv 2007 00280"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1038\/nature14270"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1038\/nature13171"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/16\/3\/033040"},{"key":"ref52","article-title":"Efficient approximation of diagonal unitaries over the Clifford+T basis","author":"welch","year":"2014","journal-title":"arXiv 1412 5608"},{"key":"ref11","article-title":"Q-means: A quantum algorithm for unsupervised machine learning","author":"kerenidis","year":"2018","journal-title":"arXiv 1812 03584"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.26421\/QIC8.3-4-4"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.120.050502"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.13"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-019-1666-5"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.119.180511"},{"key":"ref19","author":"chow","year":"2021","journal-title":"Ibm quantum breaks the 100-qubit processor barrier"},{"key":"ref18","year":"2021","journal-title":"IBM Quantum"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1958.tb03887.x"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144595295272"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.129.230504"},{"key":"ref45","article-title":"Query and depth upper bounds for quantum unitaries via grover search","author":"rosenthal","year":"2021","journal-title":"arXiv 2111 07992"},{"key":"ref48","article-title":"Does qubit connectivity impact quantum circuit complexity?","author":"allcock","year":"2022","journal-title":"arXiv 2211 05413"},{"key":"ref47","article-title":"Optimal QRAM and improved unitary synthesis by quantum circuits with any number of ancillary qubits","author":"yuan","year":"2022","journal-title":"arXiv 2202 11302"},{"key":"ref42","article-title":"A divide-and-conquer algorithm for quantum state preparation","author":"araujo","year":"2020","journal-title":"arXiv 2008 01511"},{"key":"ref41","first-page":"27","article-title":"Asymptotically optimal circuits for arbitrary n-qubit diagonal comutations","volume":"4","author":"bullock","year":"2004","journal-title":"Quantum Inf Comput"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.8.041015"},{"key":"ref43","article-title":"Trading T-gates for dirty qubits in state preparation and unitary synthesis","author":"low","year":"2018","journal-title":"arXiv 1812 00954"},{"key":"ref49","author":"frank","year":"1953","journal-title":"Pulse code communication"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.97.012327"},{"key":"ref7","first-page":"1","article-title":"Quantum recommendation systems","author":"kerenidis","year":"2017","journal-title":"Proc 8th Innov Theor Comput Sci Conf (ITCS)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.103.150502"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.22331\/q-2019-07-12-163"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.118.010501"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1038\/nphys3029"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.54"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.69.062321"},{"key":"ref35","article-title":"Quantum circuit depth lower bounds for homological codes","author":"aharonov","year":"2018","journal-title":"arXiv 1810 03912"},{"key":"ref34","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevA.102.032420","article-title":"Robust data encodings for quantum classifiers","volume":"102","author":"larose","year":"2020","journal-title":"Phys Rev A"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.52.3457"},{"key":"ref36","article-title":"Asymptotically optimal circuit depth for quantum state preparation and general unitary synthesis","author":"sun","year":"2021","journal-title":"arXiv 2108 06150"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.101.062327"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1038\/s41534-021-00456-5"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s42484-021-00045-x"},{"key":"ref32","article-title":"Quantum linear systems algorithms: A primer","author":"dervovic","year":"2018","journal-title":"arXiv 1802 08227"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.114.090502"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1038\/nature23474"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.92.177902"},{"key":"ref38","article-title":"Approximation by quantum circuits","author":"knill","year":"1995","journal-title":"arXiv quant-ph\/9508027"},{"key":"ref24","author":"gidney","year":"2015","journal-title":"Using quantum gates instead of ancilla bits"},{"key":"ref23","author":"nielsen","year":"2002","journal-title":"Quantum Computation and Quantum Information"},{"key":"ref26","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevA.83.032302","article-title":"Quantum-state preparation with universal gate decompositions","volume":"83","author":"plesch","year":"2011","journal-title":"Phys Rev A"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.71.052330"},{"key":"ref20","author":"gambetta","year":"2020","journal-title":"IBM's Roadmap for Scaling Quantum Technology"},{"key":"ref22","article-title":"Creating superpositions that correspond to efficiently integrable probability distributions","author":"grover","year":"2002","journal-title":"ArXiv Quant-ph\/0208139"},{"key":"ref21","author":"erik","year":"2021","journal-title":"Unveiling our new quantum AI campus"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.3.043200"},{"key":"ref27","article-title":"Decompositions of general quantum gates","author":"mottonen","year":"2005","journal-title":"arXiv quant-ph\/0404104"},{"key":"ref29","article-title":"Parallel quantum algorithm for hamiltonian simulation","author":"zhang","year":"2021","journal-title":"arXiv 2105 11889"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/43\/10255327\/10044235.pdf?arnumber=10044235","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,9]],"date-time":"2023-10-09T19:01:22Z","timestamp":1696878082000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10044235\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10]]},"references-count":55,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tcad.2023.3244885","relation":{},"ISSN":["0278-0070","1937-4151"],"issn-type":[{"value":"0278-0070","type":"print"},{"value":"1937-4151","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10]]}}}