{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T00:48:38Z","timestamp":1776818918616,"version":"3.51.2"},"reference-count":52,"publisher":"Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften","license":[{"start":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T00:00:00Z","timestamp":1652227200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Research, Development and Innovation Office of Hungary","award":["FK135220"],"award-info":[{"award-number":["FK135220"]}]}],"content-domain":{"domain":["quantum-journal.org"],"crossmark-restriction":false},"short-container-title":["Quantum"],"abstract":"<jats:p>In this work we propose a novel numerical approach to decompose general quantum programs in terms of single- and two-qubit quantum gates with a<mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>C<\/mml:mi><mml:mi>N<\/mml:mi><mml:mi>O<\/mml:mi><mml:mi>T<\/mml:mi><\/mml:math>gate count very close to the current theoretical lower bounds. In particular, it turns out that<mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mn>15<\/mml:mn><\/mml:math>and<mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mn>63<\/mml:mn><\/mml:math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>C<\/mml:mi><mml:mi>N<\/mml:mi><mml:mi>O<\/mml:mi><mml:mi>T<\/mml:mi><\/mml:math>gates are sufficient to decompose a general<mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mn>3<\/mml:mn><\/mml:math>- and<mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mn>4<\/mml:mn><\/mml:math>-qubit unitary, respectively, with high numerical accuracy. Our approach is based on a sequential optimization of parameters related to the single-qubit rotation gates involved in a pre-designed quantum circuit used for the decomposition. In addition, the algorithm can be adopted to sparse inter-qubit connectivity architectures provided by current mid-scale quantum computers, needing only a few additional<mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>C<\/mml:mi><mml:mi>N<\/mml:mi><mml:mi>O<\/mml:mi><mml:mi>T<\/mml:mi><\/mml:math>gates to be implemented in the resulting quantum circuits.<\/jats:p>","DOI":"10.22331\/q-2022-05-11-710","type":"journal-article","created":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T15:01:43Z","timestamp":1652281303000},"page":"710","update-policy":"https:\/\/doi.org\/10.22331\/q-crossmark-policy-page","source":"Crossref","is-referenced-by-count":36,"title":["Approaching the theoretical limit in quantum gate decomposition"],"prefix":"10.22331","volume":"6","author":[{"given":"P\u00e9ter","family":"Rakyta","sequence":"first","affiliation":[{"name":"Department of Physics of Complex Systems, E\u00f6tv\u00f6s Lor\u00e1nd University, Budapest, Hungary"},{"name":"Wigner Research Center for Physics, 29\u201333 Konkoly\u2013Thege Miklos Str., H- 1121 Budapest, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zolt\u00e1n","family":"Zimbor\u00e1s","sequence":"additional","affiliation":[{"name":"Wigner Research Center for Physics, 29\u201333 Konkoly\u2013Thege Miklos Str., H-1121 Budapest, Hungary"},{"name":"BME-MTA Lend\u00fclet Quantum Information Theory Research Group, Budapest, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"9598","published-online":{"date-parts":[[2022,5,11]]},"reference":[{"key":"0","doi-asserted-by":"publisher","unstructured":"4 P. W. Shor, ``Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,&apos;&apos; SIAM Journal on Computing, vol. 26, no. 5, pp. 1484\u20131509, 1997. [Online]. Available: https:\/\/doi.org\/10.1137\/S0097539795293172 0pt.","DOI":"10.1137\/S0097539795293172"},{"key":"1","doi-asserted-by":"publisher","unstructured":"4 L. K. Grover, ``Quantum mechanics helps in searching for a needle in a haystack,&apos;&apos; Phys. Rev. Lett., vol. 79, pp. 325\u2013328, Jul 1997. [Online]. Available: https:\/\/doi.org\/10.1103\/PhysRevLett.79.325 0pt.","DOI":"10.1103\/PhysRevLett.79.325"},{"key":"2","doi-asserted-by":"publisher","unstructured":"4 L. M. K. Vandersypen, M. Steffen, M. H. Sherwood, C. S. Yannoni, G. Breyta, and I. L. Chuang, ``Implementation of a three-quantum-bit search algorithm,&apos;&apos; Applied Physics Letters, vol. 76, no. 5, pp. 646\u2013648, 2000. [Online]. Available: https:\/\/doi.org\/10.1063\/1.125846 0pt.","DOI":"10.1063\/1.125846"},{"key":"3","doi-asserted-by":"publisher","unstructured":"4 C. Figgatt, D. Maslov, K. A. Landsman, N. M. Linke, S. Debnath, and C. Monroe, ``Complete 3-qubit grover search on a programmable quantum computer,&apos;&apos; Nature Communications, vol. 8, no. 1, p. 1918, Dec 2017. [Online]. Available: https:\/\/doi.org\/10.1038\/s41467-017-01904-7 0pt.","DOI":"10.1038\/s41467-017-01904-7"},{"key":"4","doi-asserted-by":"publisher","unstructured":"4 E. Mart\u00edn-L\u00f3pez, A. Laing, T. Lawson, R. Alvarez, X.-Q. Zhou, and J. L. O&apos;Brien, ``Experimental realization of shor&apos;s quantum factoring algorithm using qubit recycling,&apos;&apos; Nature Photonics, vol. 6, no. 11, pp. 773\u2013776, Nov 2012. [Online]. Available: https:\/\/doi.org\/10.1038\/nphoton.2012.259 0pt.","DOI":"10.1038\/nphoton.2012.259"},{"key":"5","doi-asserted-by":"publisher","unstructured":"4 T. Monz, D. Nigg, E. A. Martinez, M. F. Brandl, P. Schindler, R. Rines, S. X. Wang, I. L. Chuang, and R. Blatt, ``Realization of a scalable shor algorithm,&apos;&apos; Science, vol. 351, no. 6277, pp. 1068\u20131070, 2016. [Online]. Available: https:\/\/science.sciencemag.org\/content\/351\/6277\/1068 https:\/\/doi.org\/10.1126\/science.aad9480 0pt.","DOI":"10.1126\/science.aad9480"},{"key":"6","doi-asserted-by":"publisher","unstructured":"4 M. Amico, Z. H. Saleem, and M. Kumph, ``Experimental study of shor&apos;s factoring algorithm using the ibm q experience,&apos;&apos; Phys. Rev. A, vol. 100, p. 012305, Jul 2019. [Online]. Available: https:\/\/doi.org\/10.1103\/PhysRevA.100.012305 0pt.","DOI":"10.1103\/PhysRevA.100.012305"},{"key":"7","doi-asserted-by":"publisher","unstructured":"M. P. Harrigan et al., ``Quantum approximate optimization of non-planar graph problems on a planar superconducting processor,&apos;&apos; Nature Physics, vol. 17, no. 3, pp. 332\u2013336, 2021. https:\/\/doi.org\/10.1038\/s41567-020-01105-y.","DOI":"10.1038\/s41567-020-01105-y"},{"key":"8","doi-asserted-by":"publisher","unstructured":"F. Arute et al., ``Hartree-fock on a superconducting qubit quantum computer,&apos;&apos; Science, vol. 369, no. 6507, pp. 1084\u20131089, 2020. https:\/\/doi.org\/10.1126\/science.abb9811.","DOI":"10.1126\/science.abb9811"},{"key":"9","doi-asserted-by":"publisher","unstructured":"4 A. Smith, M. S. Kim, F. Pollmann, and J. Knolle, ``Simulating quantum many-body dynamics on a current digital quantum computer,&apos;&apos; npj Quantum Information, vol. 5, no. 1, p. 106, Nov 2019. [Online]. Available: https:\/\/doi.org\/10.1038\/s41534-019-0217-0 0pt.","DOI":"10.1038\/s41534-019-0217-0"},{"key":"10","doi-asserted-by":"publisher","unstructured":"4 S. Leontica, F. Tennie, and T. Farrow, ``Simulating molecules on a cloud-based 5-qubit ibm-q universal quantum computer,&apos;&apos; Communications Physics, vol. 4, no. 1, p. 112, Jun 2021. [Online]. Available: https:\/\/doi.org\/10.1038\/s42005-021-00616-1 0pt.","DOI":"10.1038\/s42005-021-00616-1"},{"key":"11","doi-asserted-by":"publisher","unstructured":"4 D. A. Fedorov, M. J. Otten, S. K. Gray, and Y. Alexeev, ``Ab initio molecular dynamics on quantum computers,&apos;&apos; The Journal of Chemical Physics, vol. 154, no. 16, p. 164103, 2021. [Online]. Available: https:\/\/doi.org\/10.1063\/5.0046930 0pt.","DOI":"10.1063\/5.0046930"},{"key":"12","doi-asserted-by":"publisher","unstructured":"4 T. Bian and S. Kais, ``Quantum computing for atomic and molecular resonances,&apos;&apos; The Journal of Chemical Physics, vol. 154, no. 19, p. 194107, 2021. [Online]. Available: https:\/\/doi.org\/10.1063\/5.0040477 0pt.","DOI":"10.1063\/5.0040477"},{"key":"13","doi-asserted-by":"publisher","unstructured":"K. Satzinger et al., ``Realizing topologically ordered states on a quantum processor,&apos;&apos; arXiv preprint arXiv:2104.01180, 2021. https:\/\/doi.org\/10.1126\/science.abi8378.","DOI":"10.1126\/science.abi8378"},{"key":"14","doi-asserted-by":"publisher","unstructured":"4 A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, and H. Weinfurter, ``Elementary gates for quantum computation,&apos;&apos; Phys. Rev. A, vol. 52, pp. 3457\u20133467, Nov 1995. [Online]. Available: https:\/\/doi.org\/10.1103\/PhysRevA.52.3457 0pt.","DOI":"10.1103\/PhysRevA.52.3457"},{"key":"15","doi-asserted-by":"publisher","unstructured":"4 N. M. Linke, D. Maslov, M. Roetteler, S. Debnath, C. Figgatt, K. A. Landsman, K. Wright, and C. Monroe, ``Experimental comparison of two quantum computing architectures,&apos;&apos; Proceedings of the National Academy of Sciences, vol. 114, no. 13, pp. 3305\u20133310, 2017. [Online]. Available: https:\/\/doi.org\/10.1073\/pnas.1618020114 0pt.","DOI":"10.1073\/pnas.1618020114"},{"key":"16","doi-asserted-by":"publisher","unstructured":"4 S. S. Tannu and M. K. Qureshi, ``Not all qubits are created equal: A case for variability-aware policies for nisq-era quantum computers,&apos;&apos; in Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, ser. ASPLOS &apos;19. New York, NY, USA: Association for Computing Machinery, 2019, p. 987\u2013999. [Online]. Available: https:\/\/doi.org\/10.1145\/3297858.3304007 0pt.","DOI":"10.1145\/3297858.3304007"},{"key":"17","doi-asserted-by":"publisher","unstructured":"4 V. V. Shende, I. L. Markov, and S. S. Bullock, ``Minimal universal two-qubit controlled-not-based circuits,&apos;&apos; Phys. Rev. A, vol. 69, p. 062321, Jun 2004. [Online]. Available: https:\/\/doi.org\/10.1103\/PhysRevA.69.062321 0pt.","DOI":"10.1103\/PhysRevA.69.062321"},{"key":"18","unstructured":"W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery, Numerical recipes in FORTRAN. The art of scientific computing, 1992."},{"key":"19","doi-asserted-by":"publisher","unstructured":"4 J. J. Vartiainen, M. M\u00f6tt\u00f6nen, and M. M. Salomaa, ``Efficient decomposition of quantum gates,&apos;&apos; Phys. Rev. Lett., vol. 92, p. 177902, Apr 2004. [Online]. Available: https:\/\/doi.org\/10.1103\/PhysRevLett.92.177902 0pt.","DOI":"10.1103\/PhysRevLett.92.177902"},{"key":"20","doi-asserted-by":"publisher","unstructured":"V. Shende, S. Bullock, and I. Markov, ``Synthesis of quantum-logic circuits,&apos;&apos; IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 25, no. 6, pp. 1000\u20131010, 2006. https:\/\/doi.org\/10.1109\/TCAD.2005.855930.","DOI":"10.1109\/TCAD.2005.855930"},{"key":"21","unstructured":"R. R. Tucci, ``A rudimentary quantum compiler(2cnd ed.),&apos;&apos; 1999."},{"key":"22","doi-asserted-by":"crossref","unstructured":"M. M\u00f6tt\u00f6nen and J. J. Vartiainen, ``Decompositions of general quantum gates,&apos;&apos; 2005.","DOI":"10.1103\/PhysRevLett.92.177902"},{"key":"23","doi-asserted-by":"publisher","unstructured":"4 C. Paige and M. Wei, ``History and generality of the cs decomposition,&apos;&apos; Linear Algebra and its Applications, vol. 208-209, pp. 303\u2013326, 1994. [Online]. Available: https:\/\/doi.org\/10.1016\/0024-3795(94)90446-4 0pt.","DOI":"10.1016\/0024-3795(94)90446-4"},{"key":"24","unstructured":"4 R. T. H. Dekant, H. Tregillus and T. Yin, ``Qubiter at github,&apos;&apos; 2020. [Online]. Available: https:\/\/github.com\/artiste-qb-net\/qubiter 0pt."},{"key":"25","doi-asserted-by":"crossref","unstructured":"N. Khammassi, I. Ashraf, J. v. Someren, R. Nane, A. M. Krol, M. A. Rol, L. Lao, K. Bertels, and C. G. Almudever, ``Openql : A portable quantum programming framework for quantum accelerators,&apos;&apos; 2020.","DOI":"10.1145\/3474222"},{"key":"26","doi-asserted-by":"crossref","unstructured":"A. M. Krol, A. Sarkar, I. Ashraf, Z. Al-Ars, and K. Bertels, ``Efficient decomposition of unitary matrices in quantum circuit compilers,&apos;&apos; 2021.","DOI":"10.3390\/app12020759"},{"key":"27","doi-asserted-by":"publisher","unstructured":"G. W. Dueck, A. Pathak, M. M. Rahman, A. Shukla, and A. Banerjee, ``Optimization of circuits for ibm&apos;s five-qubit quantum computers,&apos;&apos; in 2018 21st Euromicro Conference on Digital System Design (DSD), 2018, pp. 680\u2013684. https:\/\/doi.org\/10.1109\/DSD.2018.00005.","DOI":"10.1109\/DSD.2018.00005"},{"key":"28","unstructured":"M. Sisodia, A. Shukla, A. A. A. de Almeida, G. Dueck, and A. Pathak, ``Circuit optimization for ibm processors: A way to get higher fidelity and higher values of nonclassicality witnesses,&apos;&apos; arXiv: Quantum Physics, 2018."},{"key":"29","doi-asserted-by":"publisher","unstructured":"4 M. R\u00f6tteler, Quantum Error Correction. Boston, MA: Springer US, 2008, pp. 705\u2013708. [Online]. Available: https:\/\/doi.org\/10.1007\/978-0-387-30162-4_315 0pt.","DOI":"10.1007\/978-0-387-30162-4_315"},{"key":"30","doi-asserted-by":"publisher","unstructured":"4 S. Khatri, R. LaRose, A. Poremba, L. Cincio, A. T. Sornborger, and P. J. Coles, ``Quantum-assisted quantum compiling,&apos;&apos; Quantum, vol. 3, p. 140, May 2019. [Online]. Available: https:\/\/doi.org\/10.22331\/q-2019-05-13-140 0pt.","DOI":"10.22331\/q-2019-05-13-140"},{"key":"31","unstructured":"E. Younis, K. Sen, K. Yelick, and C. Iancu, ``QFAST: Quantum Synthesis Using a Hierarchical Continuous Circuit Space,&apos;&apos; arXiv e-prints, p. arXiv:2003.04462, Mar. 2020."},{"key":"32","doi-asserted-by":"crossref","unstructured":"4 E. Younis, K. Sen, K. Yelick, and C. Iancu, ``Qfast: Conflating search and numerical optimization for scalable quantum circuit synthesis,&apos;&apos; in 2021 IEEE International Conference on Quantum Computing and Engineering (QCE). Los Alamitos, CA, USA: IEEE Computer Society, oct 2021, pp. 232\u2013243. [Online]. Available: https:\/\/doi.ieeecomputersociety.org\/10.1109\/QCE52317.2021.00041 0pt.","DOI":"10.1109\/QCE52317.2021.00041"},{"key":"33","doi-asserted-by":"crossref","unstructured":"L. Madden and A. Simonetto, ``Best approximate quantum compiling problems,&apos;&apos; 2021.","DOI":"10.1145\/3505181"},{"key":"34","doi-asserted-by":"crossref","unstructured":"E. Smith, M. G. Davis, J. Larson, E. Younis, C. Iancu, and W. Lavrijsen, ``Leap: Scaling numerical optimization based synthesis using an incremental approach,&apos;&apos; 2021, arXiv:2106.11246.","DOI":"10.1145\/3548693"},{"key":"35","unstructured":"4 ``Ibm q5 yorktown.&apos;&apos; [Online]. Available: https:\/\/github.com\/Qiskit\/ibmq-device-information\/tree\/master\/backends\/yorktown\/V1 0pt."},{"key":"36","doi-asserted-by":"publisher","unstructured":"4 P. Jurcevic, A. Javadi-Abhari, L. S. Bishop, I. Lauer, D. F. Bogorin, M. Brink, L. Capelluto, O. G\u00fcnl\u00fck, T. Itoko, N. Kanazawa, A. Kandala, G. A. Keefe, K. Krsulich, W. Landers, E. P. Lewandowski, D. T. McClure, G. Nannicini, A. Narasgond, H. M. Nayfeh, E. Pritchett, M. B. Rothwell, S. Srinivasan, N. Sundaresan, C. Wang, K. X. Wei, C. J. Wood, J.-B. Yau, E. J. Zhang, O. E. Dial, J. M. Chow, and J. M. Gambetta, ``Demonstration of quantum volume 64 on a superconducting quantum computing system,&apos;&apos; Quantum Science and Technology, vol. 6, no. 2, p. 025020, mar 2021. [Online]. Available: https:\/\/doi.org\/10.1088\/2058-9565\/abe519 0pt.","DOI":"10.1088\/2058-9565\/abe519"},{"key":"37","unstructured":"4 ``Sequential quantum gate decomposer,&apos;&apos; 2021. [Online]. Available: https:\/\/github.com\/rakytap\/sequential-quantum-gate-decomposer 0pt."},{"key":"38","doi-asserted-by":"publisher","unstructured":"4 M. M\u00f6tt\u00f6nen, J. J. Vartiainen, V. Bergholm, and M. M. Salomaa, ``Quantum circuits for general multiqubit gates,&apos;&apos; Phys. Rev. Lett., vol. 93, p. 130502, Sep 2004. [Online]. Available: https:\/\/doi.org\/10.1103\/PhysRevLett.93.130502 0pt.","DOI":"10.1103\/PhysRevLett.93.130502"},{"key":"39","doi-asserted-by":"publisher","unstructured":"4 R. Iten, R. Colbeck, I. Kukuljan, J. Home, and M. Christandl, ``Quantum circuits for isometries,&apos;&apos; Physical Review A, vol. 93, no. 3, Mar 2016. [Online]. Available: http:\/\/dx.doi.org\/10.1103\/PhysRevA.93.032318 0pt.","DOI":"10.1103\/PhysRevA.93.032318"},{"key":"40","unstructured":"4 C. Kelley, Iterative Methods for Optimization, ser. Frontiers in Applied Mathematics. Society for Industrial and Applied Mathematics, 1999. [Online]. Available: https:\/\/books.google.hu\/books?id=Bq6VcmzOe1IC 0pt."},{"key":"41","doi-asserted-by":"publisher","unstructured":"4 F. Vatan and C. Williams, ``Optimal quantum circuits for general two-qubit gates,&apos;&apos; Phys. Rev. A, vol. 69, p. 032315, Mar 2004. [Online]. Available: https:\/\/doi.org\/10.1103\/PhysRevA.69.032315 0pt.","DOI":"10.1103\/PhysRevA.69.032315"},{"key":"42","doi-asserted-by":"publisher","unstructured":"L. S. Blackford, A. Petitet, R. Pozo, K. Remington, R. C. Whaley, J. Demmel, J. Dongarra, I. Duff, S. Hammarling, G. Henry et al., ``An updated set of basic linear algebra subprograms (blas),&apos;&apos; ACM Transactions on Mathematical Software, vol. 28, no. 2, pp. 135\u2013151, 2002. https:\/\/doi.org\/10.1145\/567806.567807.","DOI":"10.1145\/567806.567807"},{"key":"43","doi-asserted-by":"publisher","unstructured":"4 J. M. Chow, A. D. C\u00f3rcoles, J. M. Gambetta, C. Rigetti, B. R. Johnson, J. A. Smolin, J. R. Rozen, G. A. Keefe, M. B. Rothwell, M. B. Ketchen, and M. Steffen, ``Simple all-microwave entangling gate for fixed-frequency superconducting qubits,&apos;&apos; Phys. Rev. Lett., vol. 107, p. 080502, Aug 2011. [Online]. Available: https:\/\/doi.org\/10.1103\/PhysRevLett.107.080502 0pt.","DOI":"10.1103\/PhysRevLett.107.080502"},{"key":"44","doi-asserted-by":"publisher","unstructured":"4 R. Barends, J. Kelly, A. Megrant, A. Veitia, D. Sank, E. Jeffrey, T. C. White, J. Mutus, A. G. Fowler, B. Campbell, Y. Chen, Z. Chen, B. Chiaro, A. Dunsworth, C. Neill, P. O&apos;Malley, P. Roushan, A. Vainsencher, J. Wenner, A. N. Korotkov, A. N. Cleland, and J. M. Martinis, ``Superconducting quantum circuits at the surface code threshold for fault tolerance,&apos;&apos; Nature, vol. 508, no. 7497, pp. 500\u2013503, Apr 2014. [Online]. Available: https:\/\/doi.org\/10.1038\/nature13171 0pt.","DOI":"10.1038\/nature13171"},{"key":"45","doi-asserted-by":"publisher","unstructured":"4 Z. Zong, Z. Sun, Z. Dong, C. Run, L. Xiang, Z. Zhan, Q. Wang, Y. Fei, Y. Wu, W. Jin, C. Xiao, Z. Jia, P. Duan, J. Wu, Y. Yin, and G. Guo, ``Optimization of a controlled-$z$ gate with data-driven gradient-ascent pulse engineering in a superconducting-qubit system,&apos;&apos; Phys. Rev. Applied, vol. 15, p. 064005, Jun 2021. [Online]. Available: https:\/\/doi.org\/10.1103\/PhysRevApplied.15.064005 0pt.","DOI":"10.1103\/PhysRevApplied.15.064005"},{"key":"46","doi-asserted-by":"publisher","unstructured":"4 Y. Xu, Y. Ma, W. Cai, X. Mu, W. Dai, W. Wang, L. Hu, X. Li, J. Han, H. Wang, Y. P. Song, Z.-B. Yang, S.-B. Zheng, and L. Sun, ``Demonstration of controlled-phase gates between two error-correctable photonic qubits,&apos;&apos; Phys. Rev. Lett., vol. 124, p. 120501, Mar 2020. [Online]. Available: https:\/\/doi.org\/10.1103\/PhysRevLett.124.120501 0pt.","DOI":"10.1103\/PhysRevLett.124.120501"},{"key":"47","doi-asserted-by":"publisher","unstructured":"4 H.-P. Lo, T. Ikuta, N. Matsuda, T. Honjo, W. J. Munro, and H. Takesue, ``Quantum process tomography of a controlled-phase gate for time-bin qubits,&apos;&apos; Phys. Rev. Applied, vol. 13, p. 034013, Mar 2020. [Online]. Available: https:\/\/doi.org\/10.1103\/PhysRevApplied.13.034013 0pt.","DOI":"10.1103\/PhysRevApplied.13.034013"},{"key":"48","unstructured":"4 ``Tutorial materials to use sequential quantum gate decomposer,&apos;&apos; 2021. [Online]. Available: https:\/\/codedocs.xyz\/rakytap\/sequential-quantum-gate-decomposer\/ 0pt."},{"key":"49","unstructured":"4 ``Ibm quantum solutions.&apos;&apos; [Online]. Available: https:\/\/www.ibm.com\/quantum-computing\/ 0pt."},{"key":"50","unstructured":"4 ``Ibm q5 tenerife.&apos;&apos; [Online]. Available: https:\/\/github.com\/Qiskit\/ibmq-device-information\/tree\/master\/backends\/tenerife\/V1 0pt."},{"key":"51","doi-asserted-by":"crossref","unstructured":"4 M. Voss, R. Asenjo, and J. Reinders, Pro TBB: C++ parallel programming with threading building blocks. New York: Apress Open, 2019. [Online]. Available: https:\/\/link.springer.com\/book\/10.1007\/978-1-4842-4398-5 0pt.","DOI":"10.1007\/978-1-4842-4398-5"}],"container-title":["Quantum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/quantum-journal.org\/papers\/q-2022-05-11-710\/pdf\/","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,2,4]],"date-time":"2023-02-04T22:48:20Z","timestamp":1675550900000},"score":1,"resource":{"primary":{"URL":"https:\/\/quantum-journal.org\/papers\/q-2022-05-11-710\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,11]]},"references-count":52,"URL":"https:\/\/doi.org\/10.22331\/q-2022-05-11-710","archive":["CLOCKSS"],"relation":{},"ISSN":["2521-327X"],"issn-type":[{"value":"2521-327X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,11]]},"article-number":"710"}}