{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,17]],"date-time":"2026-10-17T00:14:33Z","timestamp":1792196073329,"version":"4.4.0"},"reference-count":39,"publisher":"Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften","license":[{"start":{"date-parts":[[2023,3,20]],"date-time":"2023-03-20T00:00:00Z","timestamp":1679270400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["quantum-journal.org"],"crossmark-restriction":false},"short-container-title":["Quantum"],"abstract":"<jats:p>\n                    As a cornerstone for many quantum linear algebraic and quantum machine learning algorithms, controlled quantum state preparation (CQSP) aims to provide the transformation of\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                      <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                        <mml:mo stretchy=\"false\">|<\/mml:mo>\n                      <\/mml:mrow>\n                      <mml:mi>i<\/mml:mi>\n                      <mml:mo fence=\"false\" stretchy=\"false\">&amp;#x27E9;<\/mml:mo>\n                      <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                        <mml:mo stretchy=\"false\">|<\/mml:mo>\n                      <\/mml:mrow>\n                      <mml:msup>\n                        <mml:mn>0<\/mml:mn>\n                        <mml:mi>n<\/mml:mi>\n                      <\/mml:msup>\n                      <mml:mo fence=\"false\" stretchy=\"false\">&amp;#x27E9;<\/mml:mo>\n                      <mml:mo stretchy=\"false\">&amp;#x2192;<\/mml:mo>\n                      <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                        <mml:mo stretchy=\"false\">|<\/mml:mo>\n                      <\/mml:mrow>\n                      <mml:mi>i<\/mml:mi>\n                      <mml:mo fence=\"false\" stretchy=\"false\">&amp;#x27E9;<\/mml:mo>\n                      <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                        <mml:mo stretchy=\"false\">|<\/mml:mo>\n                      <\/mml:mrow>\n                      <mml:msub>\n                        <mml:mi>&amp;#x03C8;<\/mml:mi>\n                        <mml:mi>i<\/mml:mi>\n                      <\/mml:msub>\n                      <mml:mo fence=\"false\" stretchy=\"false\">&amp;#x27E9;<\/mml:mo>\n                    <\/mml:math>\n                    for all\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                      <mml:mi>i<\/mml:mi>\n                      <mml:mo>&amp;#x2208;<\/mml:mo>\n                      <mml:mo fence=\"false\" stretchy=\"false\">{<\/mml:mo>\n                      <mml:mn>0<\/mml:mn>\n                      <mml:mo>,<\/mml:mo>\n                      <mml:mn>1<\/mml:mn>\n                      <mml:msup>\n                        <mml:mo fence=\"false\" stretchy=\"false\">}<\/mml:mo>\n                        <mml:mi>k<\/mml:mi>\n                      <\/mml:msup>\n                    <\/mml:math>\n                    for the given\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                      <mml:mi>n<\/mml:mi>\n                    <\/mml:math>\n                    -qubit states\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                      <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                        <mml:mo stretchy=\"false\">|<\/mml:mo>\n                      <\/mml:mrow>\n                      <mml:msub>\n                        <mml:mi>&amp;#x03C8;<\/mml:mi>\n                        <mml:mi>i<\/mml:mi>\n                      <\/mml:msub>\n                      <mml:mo fence=\"false\" stretchy=\"false\">&amp;#x27E9;<\/mml:mo>\n                    <\/mml:math>\n                    . In this paper, we construct a quantum circuit for implementing CQSP, with depth\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                      <mml:mi>O<\/mml:mi>\n                      <mml:mrow>\n                        <mml:mo>(<\/mml:mo>\n                        <mml:mrow>\n                          <mml:mi>n<\/mml:mi>\n                          <mml:mo>+<\/mml:mo>\n                          <mml:mi>k<\/mml:mi>\n                          <mml:mo>+<\/mml:mo>\n                          <mml:mfrac>\n                            <mml:msup>\n                              <mml:mn>2<\/mml:mn>\n                              <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                                <mml:mi>n<\/mml:mi>\n                                <mml:mo>+<\/mml:mo>\n                                <mml:mi>k<\/mml:mi>\n                              <\/mml:mrow>\n                            <\/mml:msup>\n                            <mml:mrow>\n                              <mml:mi>n<\/mml:mi>\n                              <mml:mo>+<\/mml:mo>\n                              <mml:mi>k<\/mml:mi>\n                              <mml:mo>+<\/mml:mo>\n                              <mml:mi>m<\/mml:mi>\n                            <\/mml:mrow>\n                          <\/mml:mfrac>\n                        <\/mml:mrow>\n                        <mml:mo>)<\/mml:mo>\n                      <\/mml:mrow>\n                    <\/mml:math>\n                    and size\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                      <mml:mi>O<\/mml:mi>\n                      <mml:mo stretchy=\"false\">(<\/mml:mo>\n                      <mml:msup>\n                        <mml:mn>2<\/mml:mn>\n                        <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                          <mml:mi>n<\/mml:mi>\n                          <mml:mo>+<\/mml:mo>\n                          <mml:mi>k<\/mml:mi>\n                        <\/mml:mrow>\n                      <\/mml:msup>\n                      <mml:mo stretchy=\"false\">)<\/mml:mo>\n                    <\/mml:math>\n                    for any given number\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                      <mml:mi>m<\/mml:mi>\n                    <\/mml:math>\n                    of ancillary qubits. These bounds, which can also be viewed as a time-space tradeoff for the transformation, are optimal for any integer parameters\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                      <mml:mi>m<\/mml:mi>\n                      <mml:mo>,<\/mml:mo>\n                      <mml:mi>k<\/mml:mi>\n                      <mml:mo>&amp;#x2265;<\/mml:mo>\n                      <mml:mn>0<\/mml:mn>\n                    <\/mml:math>\n                    and\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                      <mml:mi>n<\/mml:mi>\n                      <mml:mo>&amp;#x2265;<\/mml:mo>\n                      <mml:mn>1<\/mml:mn>\n                    <\/mml:math>\n                    . When\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                      <mml:mi>k<\/mml:mi>\n                      <mml:mo>=<\/mml:mo>\n                      <mml:mn>0<\/mml:mn>\n                    <\/mml:math>\n                    , the problem becomes the canonical quantum state preparation (QSP) problem with ancillary qubits, which asks for efficient implementations of the transformation\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                      <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                        <mml:mo stretchy=\"false\">|<\/mml:mo>\n                      <\/mml:mrow>\n                      <mml:msup>\n                        <mml:mn>0<\/mml:mn>\n                        <mml:mi>n<\/mml:mi>\n                      <\/mml:msup>\n                      <mml:mo fence=\"false\" stretchy=\"false\">&amp;#x27E9;<\/mml:mo>\n                      <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                        <mml:mo stretchy=\"false\">|<\/mml:mo>\n                      <\/mml:mrow>\n                      <mml:msup>\n                        <mml:mn>0<\/mml:mn>\n                        <mml:mi>m<\/mml:mi>\n                      <\/mml:msup>\n                      <mml:mo fence=\"false\" stretchy=\"false\">&amp;#x27E9;<\/mml:mo>\n                      <mml:mo stretchy=\"false\">&amp;#x2192;<\/mml:mo>\n                      <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                        <mml:mo stretchy=\"false\">|<\/mml:mo>\n                      <\/mml:mrow>\n                      <mml:mi>&amp;#x03C8;<\/mml:mi>\n                      <mml:mo fence=\"false\" stretchy=\"false\">&amp;#x27E9;<\/mml:mo>\n                      <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                        <mml:mo stretchy=\"false\">|<\/mml:mo>\n                      <\/mml:mrow>\n                      <mml:msup>\n                        <mml:mn>0<\/mml:mn>\n                        <mml:mi>m<\/mml:mi>\n                      <\/mml:msup>\n                      <mml:mo fence=\"false\" stretchy=\"false\">&amp;#x27E9;<\/mml:mo>\n                    <\/mml:math>\n                    . This problem has many applications with many investigations, yet its circuit complexity remains open. Our construction completely solves this problem, pinning down its depth complexity to\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                      <mml:mi mathvariant=\"normal\">&amp;#x0398;<\/mml:mi>\n                      <mml:mo stretchy=\"false\">(<\/mml:mo>\n                      <mml:mi>n<\/mml:mi>\n                      <mml:mo>+<\/mml:mo>\n                      <mml:msup>\n                        <mml:mn>2<\/mml:mn>\n                        <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                          <mml:mi>n<\/mml:mi>\n                        <\/mml:mrow>\n                      <\/mml:msup>\n                      <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                        <mml:mo>\/<\/mml:mo>\n                      <\/mml:mrow>\n                      <mml:mo stretchy=\"false\">(<\/mml:mo>\n                      <mml:mi>n<\/mml:mi>\n                      <mml:mo>+<\/mml:mo>\n                      <mml:mi>m<\/mml:mi>\n                      <mml:mo stretchy=\"false\">)<\/mml:mo>\n                      <mml:mo stretchy=\"false\">)<\/mml:mo>\n                    <\/mml:math>\n                    and its size complexity to\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                      <mml:mi mathvariant=\"normal\">&amp;#x0398;<\/mml:mi>\n                      <mml:mo stretchy=\"false\">(<\/mml:mo>\n                      <mml:msup>\n                        <mml:mn>2<\/mml:mn>\n                        <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                          <mml:mi>n<\/mml:mi>\n                        <\/mml:mrow>\n                      <\/mml:msup>\n                      <mml:mo stretchy=\"false\">)<\/mml:mo>\n                    <\/mml:math>\n                    for any\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                      <mml:mi>m<\/mml:mi>\n                    <\/mml:math>\n                    . Another fundamental problem, unitary synthesis, asks to implement a general\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                      <mml:mi>n<\/mml:mi>\n                    <\/mml:math>\n                    -qubit unitary by a quantum circuit. Previous work shows a lower bound of\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                      <mml:mi mathvariant=\"normal\">&amp;#x03A9;<\/mml:mi>\n                      <mml:mo stretchy=\"false\">(<\/mml:mo>\n                      <mml:mi>n<\/mml:mi>\n                      <mml:mo>+<\/mml:mo>\n                      <mml:msup>\n                        <mml:mn>4<\/mml:mn>\n                        <mml:mi>n<\/mml:mi>\n                      <\/mml:msup>\n                      <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                        <mml:mo>\/<\/mml:mo>\n                      <\/mml:mrow>\n                      <mml:mo stretchy=\"false\">(<\/mml:mo>\n                      <mml:mi>n<\/mml:mi>\n                      <mml:mo>+<\/mml:mo>\n                      <mml:mi>m<\/mml:mi>\n                      <mml:mo stretchy=\"false\">)<\/mml:mo>\n                      <mml:mo stretchy=\"false\">)<\/mml:mo>\n                    <\/mml:math>\n                    and an upper bound of\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                      <mml:mi>O<\/mml:mi>\n                      <mml:mo stretchy=\"false\">(<\/mml:mo>\n                      <mml:mi>n<\/mml:mi>\n                      <mml:msup>\n                        <mml:mn>2<\/mml:mn>\n                        <mml:mi>n<\/mml:mi>\n                      <\/mml:msup>\n                      <mml:mo stretchy=\"false\">)<\/mml:mo>\n                    <\/mml:math>\n                    for\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                      <mml:mi>m<\/mml:mi>\n                      <mml:mo>=<\/mml:mo>\n                      <mml:mi mathvariant=\"normal\">&amp;#x03A9;<\/mml:mi>\n                      <mml:mo stretchy=\"false\">(<\/mml:mo>\n                      <mml:msup>\n                        <mml:mn>2<\/mml:mn>\n                        <mml:mi>n<\/mml:mi>\n                      <\/mml:msup>\n                      <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                        <mml:mo>\/<\/mml:mo>\n                      <\/mml:mrow>\n                      <mml:mi>n<\/mml:mi>\n                      <mml:mo stretchy=\"false\">)<\/mml:mo>\n                    <\/mml:math>\n                    ancillary qubits. In this paper, we quadratically shrink this gap by presenting a quantum circuit of the depth of\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                      <mml:mi>O<\/mml:mi>\n                      <mml:mrow>\n                        <mml:mo>(<\/mml:mo>\n                        <mml:mrow>\n                          <mml:mi>n<\/mml:mi>\n                          <mml:msup>\n                            <mml:mn>2<\/mml:mn>\n                            <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                              <mml:mi>n<\/mml:mi>\n                              <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                                <mml:mo>\/<\/mml:mo>\n                              <\/mml:mrow>\n                              <mml:mn>2<\/mml:mn>\n                            <\/mml:mrow>\n                          <\/mml:msup>\n                          <mml:mo>+<\/mml:mo>\n                          <mml:mfrac>\n                            <mml:mrow>\n                              <mml:msup>\n                                <mml:mi>n<\/mml:mi>\n                                <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                                  <mml:mn>1<\/mml:mn>\n                                  <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                                    <mml:mo>\/<\/mml:mo>\n                                  <\/mml:mrow>\n                                  <mml:mn>2<\/mml:mn>\n                                <\/mml:mrow>\n                              <\/mml:msup>\n                              <mml:msup>\n                                <mml:mn>2<\/mml:mn>\n                                <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                                  <mml:mn>3<\/mml:mn>\n                                  <mml:mi>n<\/mml:mi>\n                                  <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                                    <mml:mo>\/<\/mml:mo>\n                                  <\/mml:mrow>\n                                  <mml:mn>2<\/mml:mn>\n                                <\/mml:mrow>\n                              <\/mml:msup>\n                            <\/mml:mrow>\n                            <mml:msup>\n                              <mml:mi>m<\/mml:mi>\n                              <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                                <mml:mn>1<\/mml:mn>\n                                <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                                  <mml:mo>\/<\/mml:mo>\n                                <\/mml:mrow>\n                                <mml:mn>2<\/mml:mn>\n                              <\/mml:mrow>\n                            <\/mml:msup>\n                          <\/mml:mfrac>\n                          <mml:mtext>&amp;#xA0;<\/mml:mtext>\n                          <mml:mtext>&amp;#xA0;<\/mml:mtext>\n                        <\/mml:mrow>\n                        <mml:mo>)<\/mml:mo>\n                      <\/mml:mrow>\n                    <\/mml:math>\n                    .\n                  <\/jats:p>","DOI":"10.22331\/q-2023-03-20-956","type":"journal-article","created":{"date-parts":[[2023,3,20]],"date-time":"2023-03-20T10:47:56Z","timestamp":1679309276000},"page":"956","update-policy":"https:\/\/doi.org\/10.22331\/q-crossmark-policy-page","source":"Crossref","is-referenced-by-count":39,"title":["Optimal (controlled) quantum state preparation and improved unitary synthesis by quantum circuits with any number of ancillary qubits"],"prefix":"10.22331","volume":"7","author":[{"given":"Pei","family":"Yuan","sequence":"first","affiliation":[{"name":"Tencent Quantum Laboratory, Tencent, Shenzhen, Guangdong 518057, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shengyu","family":"Zhang","sequence":"additional","affiliation":[{"name":"Tencent Quantum Laboratory, Tencent, Shenzhen, Guangdong 518057, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"9598","published-online":{"date-parts":[[2023,3,20]]},"reference":[{"key":"0","doi-asserted-by":"publisher","unstructured":"Jacob Biamonte, Peter Wittek, Nicola Pancotti, Patrick Rebentrost, Nathan Wiebe, and Seth Lloyd. ``Quantum machine learning&apos;&apos;. Nature 549, 195\u2013202 (2017).","DOI":"10.1038\/nature23474"},{"key":"1","doi-asserted-by":"publisher","unstructured":"Seth Lloyd, Masoud Mohseni, and Patrick Rebentrost. ``Quantum principal component analysis&apos;&apos;. Nature Physics 10, 631\u2013633 (2014).","DOI":"10.1038\/nphys3029"},{"key":"2","doi-asserted-by":"publisher","unstructured":"Iordanis Kerenidis and Anupam Prakash. ``Quantum Recommendation Systems&apos;&apos;. In Christos H. Papadimitriou, editor, 8th Innovations in Theoretical Computer Science Conference (ITCS 2017). Volume 67 of Leibniz International Proceedings in Informatics (LIPIcs), pages 49:1\u201349:21. Dagstuhl, Germany (2017). Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik.","DOI":"10.4230\/LIPIcs.ITCS.2017.49"},{"key":"3","doi-asserted-by":"publisher","unstructured":"Patrick Rebentrost, Adrian Steffens, Iman Marvian, and Seth Lloyd. ``Quantum singular-value decomposition of nonsparse low-rank matrices&apos;&apos;. Phys. Rev. A 97, 012327 (2018).","DOI":"10.1103\/PhysRevA.97.012327"},{"key":"4","doi-asserted-by":"publisher","unstructured":"Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd. ``Quantum algorithm for linear systems of equations&apos;&apos;. Phys. Rev. Lett. 103, 150502 (2009).","DOI":"10.1103\/PhysRevLett.103.150502"},{"key":"5","doi-asserted-by":"publisher","unstructured":"Leonard Wossnig, Zhikuan Zhao, and Anupam Prakash. ``Quantum linear system algorithm for dense matrices&apos;&apos;. Phys. Rev. Lett. 120, 050502 (2018).","DOI":"10.1103\/PhysRevLett.120.050502"},{"key":"6","doi-asserted-by":"publisher","unstructured":"Iordanis Kerenidis, Jonas Landman, Alessandro Luongo, and Anupam Prakash. ``q-means: a quantum algorithm for unsupervised machine learning&apos;&apos;. In Advances in Neural Information Processing Systems. Volume 32, pages 4134\u20134144. (2019).","DOI":"10.48550\/arXiv.1812.03584"},{"key":"7","doi-asserted-by":"publisher","unstructured":"Iordanis Kerenidis and Jonas Landman. ``Quantum spectral clustering&apos;&apos;. Phys. Rev. A 103, 042415 (2021).","DOI":"10.1103\/PhysRevA.103.042415"},{"key":"8","doi-asserted-by":"publisher","unstructured":"Patrick Rebentrost, Masoud Mohseni, and Seth Lloyd. ``Quantum support vector machine for big data classification&apos;&apos;. Phys. Rev. Lett. 113, 130503 (2014).","DOI":"10.1103\/PhysRevLett.113.130503"},{"key":"9","doi-asserted-by":"publisher","unstructured":"Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, and Rolando D. Somma. ``Simulating hamiltonian dynamics with a truncated taylor series&apos;&apos;. Phys. Rev. Lett. 114, 090502 (2015).","DOI":"10.1103\/PhysRevLett.114.090502"},{"key":"10","doi-asserted-by":"publisher","unstructured":"Guang Hao Low and Isaac L. Chuang. ``Optimal hamiltonian simulation by quantum signal processing&apos;&apos;. Phys. Rev. Lett. 118, 010501 (2017).","DOI":"10.1103\/PhysRevLett.118.010501"},{"key":"11","doi-asserted-by":"publisher","unstructured":"Guang Hao Low and Isaac L. Chuang. ``Hamiltonian Simulation by Qubitization&apos;&apos;. Quantum 3, 163 (2019).","DOI":"10.22331\/q-2019-07-12-163"},{"key":"12","doi-asserted-by":"publisher","unstructured":"Dominic W. Berry, Andrew M. Childs, and Robin Kothari. ``Hamiltonian simulation with nearly optimal dependence on all parameters&apos;&apos;. In 2015 IEEE 56th Annual Symposium on Foundations of Computer Science. Pages 792\u2013809. (2015).","DOI":"10.1109\/FOCS.2015.54"},{"key":"13","doi-asserted-by":"publisher","unstructured":"Mario Szegedy. ``Quantum speed-up of markov chain based algorithms&apos;&apos;. In 45th Annual IEEE Symposium on Foundations of Computer Science. Pages 32\u201341. (2004).","DOI":"10.1109\/FOCS.2004.53"},{"key":"14","doi-asserted-by":"publisher","unstructured":"Fr\u00e9d\u00e9ric Magniez, Ashwin Nayak, J\u00e9r\u00e9mie Roland, and Miklos Santha. ``Search via quantum walk&apos;&apos;. SIAM Journal on Computing 40, 142\u2013164 (2011).","DOI":"10.1137\/090745854"},{"key":"15","doi-asserted-by":"publisher","unstructured":"Daniel K. Park, Francesco Petruccione, and June-Koo Kevin Rhee. ``Circuit-based quantum random access memory for classical data&apos;&apos;. Scientific Reports 9, 3949 (2019).","DOI":"10.1038\/s41598-019-40439-3"},{"key":"16","doi-asserted-by":"publisher","unstructured":"Tiago M. L. de Veras, Ismael C. S. de Araujo, Daniel K. Park, and Adenilton J. da Silva. ``Circuit-based quantum random access memory for classical data with continuous amplitudes&apos;&apos;. IEEE Transactions on Computers 70, 2125\u20132135 (2021).","DOI":"10.1109\/TC.2020.3037932"},{"key":"17","doi-asserted-by":"publisher","unstructured":"Olivia Di Matteo, Vlad Gheorghiu, and Michele Mosca. ``Fault-tolerant resource estimation of quantum random-access memories&apos;&apos;. IEEE Transactions on Quantum Engineering 1, 1\u201313 (2020).","DOI":"10.1109\/TQE.2020.2965803"},{"key":"18","doi-asserted-by":"publisher","unstructured":"Ville Bergholm, Juha J. Vartiainen, Mikko M\u00f6tt\u00f6nen, and Martti M. Salomaa. ``Quantum circuits with uniformly controlled one-qubit gates&apos;&apos;. Phys. Rev. A 71, 052330 (2005).","DOI":"10.1103\/PhysRevA.71.052330"},{"key":"19","doi-asserted-by":"publisher","unstructured":"Martin Plesch and \u010caslav Brukner. ``Quantum-state preparation with universal gate decompositions&apos;&apos;. Phys. Rev. A 83, 032302 (2011).","DOI":"10.1103\/PhysRevA.83.032302"},{"key":"20","unstructured":"Xiaoming Sun, Guojing Tian, Shuai Yang, Pei Yuan, and Shengyu Zhang. ``Asymptotically optimal circuit depth for quantum state preparation and general unitary synthesis&apos;&apos; (2021) arXiv:2108.06150v3."},{"key":"21","doi-asserted-by":"publisher","unstructured":"Xiao-Ming Zhang, Man-Hong Yung, and Xiao Yuan. ``Low-depth quantum state preparation&apos;&apos;. Phys. Rev. Res. 3, 043200 (2021).","DOI":"10.1103\/PhysRevResearch.3.043200"},{"key":"22","unstructured":"Gregory Rosenthal. ``Query and depth upper bounds for quantum unitaries via grover search&apos;&apos; (2021). arXiv:2111.07992."},{"key":"23","doi-asserted-by":"publisher","unstructured":"Xiao-Ming Zhang, Tongyang Li, and Xiao Yuan. ``Quantum state preparation with optimal circuit depth: Implementations and applications&apos;&apos;. Phys. Rev. Lett. 129, 230504 (2022).","DOI":"10.1103\/PhysRevLett.129.230504"},{"key":"24","doi-asserted-by":"publisher","unstructured":"Sonika Johri, Shantanu Debnath, Avinash Mocherla, Alexandros SINGK, Anupam Prakash, Jungsang Kim, and Iordanis Kerenidis. ``Nearest centroid classification on a trapped ion quantum computer&apos;&apos;. npj Quantum Information 7, 122 (2021).","DOI":"10.1038\/s41534-021-00456-5"},{"key":"25","unstructured":"Zhicheng Zhang, Qisheng Wang, and Mingsheng Ying. ``Parallel quantum algorithm for hamiltonian simulation&apos;&apos; (2021). arXiv:2105.11889."},{"key":"26","doi-asserted-by":"publisher","unstructured":"Vivek V. Shende, Igor L. Markov, and Stephen S. Bullock. ``Minimal universal two-qubit controlled-not-based circuits&apos;&apos;. Phys. Rev. A 69, 062321 (2004).","DOI":"10.1103\/PhysRevA.69.062321"},{"key":"27","doi-asserted-by":"publisher","unstructured":"Adriano Barenco, Charles H. Bennett, Richard Cleve, David P. DiVincenzo, Norman Margolus, Peter Shor, Tycho Sleator, John A. Smolin, and Harald Weinfurter. ``Elementary gates for quantum computation&apos;&apos;. Phys. Rev. A 52, 3457\u20133467 (1995).","DOI":"10.1103\/PhysRevA.52.3457"},{"key":"28","unstructured":"Emanuel Knill. ``Approximation by quantum circuits&apos;&apos; (1995). arXiv:quant-ph\/9508006."},{"key":"29","doi-asserted-by":"publisher","unstructured":"Juha J. Vartiainen, Mikko M\u00f6tt\u00f6nen, and Martti M. Salomaa. ``Efficient decomposition of quantum gates&apos;&apos;. Phys. Rev. Lett. 92, 177902 (2004).","DOI":"10.1103\/PhysRevLett.92.177902"},{"key":"30","unstructured":"M Mottonen and Juha J Vartiainen. ``Decompositions of general quantum gates&apos;&apos; (2005). arXiv:quant-ph\/0504100."},{"key":"31","doi-asserted-by":"publisher","unstructured":"Vittorio Giovannetti, Seth Lloyd, and Lorenzo Maccone. ``Quantum random access memory&apos;&apos;. Phys. Rev. Lett. 100, 160501 (2008).","DOI":"10.1103\/PhysRevLett.100.160501"},{"key":"32","doi-asserted-by":"publisher","unstructured":"Vittorio Giovannetti, Seth Lloyd, and Lorenzo Maccone. ``Architectures for a quantum random access memory&apos;&apos;. Phys. Rev. A 78, 052310 (2008).","DOI":"10.1103\/PhysRevA.78.052310"},{"key":"33","doi-asserted-by":"publisher","unstructured":"Michael A. Nielsen and Isaac L. Chuang. ``Quantum computation and quantum information: 10th anniversary edition&apos;&apos;. Cambridge University Press. (2010).","DOI":"10.1017\/CBO9780511976667"},{"key":"34","unstructured":"Craig Gidney. ``Using quantum gates instead of ancilla bits&apos;&apos;. https:\/\/algassert.com\/circuits\/2015\/06\/22\/Using-Quantum-Gates-instead-of-Ancilla-Bits.html."},{"key":"35","unstructured":"Jonathan M Baker, Casey Duckering, Alexander Hoover, and Frederic T Chong. ``Decomposing quantum generalized toffoli with an arbitrary number of ancilla&apos;&apos; (2019). arXiv:1904.01671."},{"key":"36","unstructured":"Lov Grover and Terry Rudolph. ``Creating superpositions that correspond to efficiently integrable probability distributions&apos;&apos; (2002). arXiv:quant-ph\/0208112."},{"key":"37","doi-asserted-by":"publisher","unstructured":"C.C. Paige and M. Wei. ``History and generality of the cs decomposition&apos;&apos;. Linear Algebra and its Applications 208-209, 303\u2013326 (1994).","DOI":"10.1016\/0024-3795(94)90446-4"},{"key":"38","unstructured":"Guang Hao Low, Vadym Kliuchnikov, and Luke Schaeffer. ``Trading t-gates for dirty qubits in state preparation and unitary synthesis&apos;&apos; (2018). arXiv:1812.00954."}],"container-title":["Quantum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/quantum-journal.org\/papers\/q-2023-03-20-956\/pdf\/","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,3,20]],"date-time":"2023-03-20T10:48:06Z","timestamp":1679309286000},"score":1,"resource":{"primary":{"URL":"https:\/\/quantum-journal.org\/papers\/q-2023-03-20-956\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,20]]},"references-count":39,"URL":"https:\/\/doi.org\/10.22331\/q-2023-03-20-956","archive":["CLOCKSS"],"relation":{},"ISSN":["2521-327X"],"issn-type":[{"value":"2521-327X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,20]]},"article-number":"956"}}