{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T17:40:46Z","timestamp":1778694046042,"version":"3.51.4"},"reference-count":72,"publisher":"Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften","license":[{"start":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T00:00:00Z","timestamp":1748995200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100008687","name":"Rosatom","doi-asserted-by":"crossref","award":["868-1.3-15\/15-2021"],"award-info":[{"award-number":["868-1.3-15\/15-2021"]}],"id":[{"id":"10.13039\/501100008687","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100008687","name":"Rosatom","doi-asserted-by":"crossref","award":["P2154"],"award-info":[{"award-number":["P2154"]}],"id":[{"id":"10.13039\/501100008687","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"crossref","award":["22-12-00353-P"],"award-info":[{"award-number":["22-12-00353-P"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["quantum-journal.org"],"crossmark-restriction":false},"short-container-title":["Quantum"],"abstract":"<jats:p>We adopt a method of the quantum gate teleportation for converting circuit-based quantum computation primitives into fusion networks. By using the presented scheme for the CNOT gate we construct translation of the circuit for the foliated surface code into a fault tolerant fusion network. Finally, we construct two new fusion based quantum computation models and study their fault tolerance properties.<\/jats:p>","DOI":"10.22331\/q-2025-06-04-1762","type":"journal-article","created":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T14:04:47Z","timestamp":1749045887000},"page":"1762","update-policy":"https:\/\/doi.org\/10.22331\/q-crossmark-policy-page","source":"Crossref","is-referenced-by-count":1,"title":["Building a fusion-based quantum computer using teleported gates"],"prefix":"10.22331","volume":"9","author":[{"given":"Ashot","family":"Avanesov","sequence":"first","affiliation":[{"name":"Russian Quantum Center, Russia, Moscow, 121205, Bol&apos;shoy bul&apos;var 30 building 1"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Shurinov","sequence":"additional","affiliation":[{"name":"Quantum Technologies Centre, Lomonosov Moscow State University, Russia, Moscow, 119991, Leninskie Gory 1 building 35"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Dyakonov","sequence":"additional","affiliation":[{"name":"Quantum Technologies Centre, Lomonosov Moscow State University, Russia, Moscow, 119991, Leninskie Gory 1 building 35"},{"name":"Russian Quantum Center, Russia, Moscow, 121205, Bol&apos;shoy bul&apos;var 30 building 1"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stanislav","family":"Straupe","sequence":"additional","affiliation":[{"name":"Quantum Technologies Centre, Lomonosov Moscow State University, Russia, Moscow, 119991, Leninskie Gory 1 building 35"},{"name":"Russian Quantum Center, Russia, Moscow, 121205, Bol&apos;shoy bul&apos;var 30 building 1"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"9598","published-online":{"date-parts":[[2025,6,4]]},"reference":[{"key":"0","doi-asserted-by":"publisher","unstructured":"A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, H. Weinfurter. Elementary gates for quantum computation. Phys. Rev. A 52, 3457\u20133467 (1995).","DOI":"10.1103\/PhysRevA.52.3457"},{"key":"1","doi-asserted-by":"publisher","unstructured":"A. Y. Kitaev. Quantum computations: algorithms and error correction. Russ. Math. Surv. 52, 1191\u20131249 (1997).","DOI":"10.1070\/RM1997v052n06ABEH002155"},{"key":"2","unstructured":"M. A. Nielsen, I. Chuang. Quantum Computation and Quantum Information. Cambridge (2010). Cambridge University Press."},{"key":"3","doi-asserted-by":"publisher","unstructured":"A. B. Finnila, M. A. Gomez, C. Sebenik, C. Stenson, J. D. Doll. Quantum annealing: A new method for minimizing multidimensional functions. Chemical Physics Letters 219, 343\u2013348 (1994).","DOI":"10.1016\/0009-2614(94)00117-0"},{"key":"4","doi-asserted-by":"publisher","unstructured":"E. Farhi, J. Goldstone, S. Gutmann, M. Sipser. Quantum Computation by Adiabatic Evolution. arXiv:quant-ph\/0001106 (2000).","DOI":"10.48550\/arXiv.quant-ph\/0001106"},{"key":"5","doi-asserted-by":"publisher","unstructured":"A. Y. Kitaev. Fault-tolerant quantum computation by anyons. Annals of Physics 303, 2\u201330 (2003), arXiv:quant-ph\/9707021 (1997).","DOI":"10.48550\/arXiv.quant-ph\/9707021"},{"key":"6","doi-asserted-by":"publisher","unstructured":"C. Nayak, S. H. Simon, A. Stern, M. Freedman, S. Das Sarma. Non-Abelian anyons and topological quantum computation. Rev. Mod. Phys. 80, 1083\u20131159 (2008).","DOI":"10.1103\/RevModPhys.80.1083"},{"key":"7","doi-asserted-by":"publisher","unstructured":"R. Raussendorf, H. J. Briegel. A One-Way Quantum Computer. Phys. Rev. Lett. 86, 5188\u20135191 (2001).","DOI":"10.1103\/PhysRevLett.86.5188"},{"key":"8","doi-asserted-by":"publisher","unstructured":"R. Raussendorf, D. E. Browne, H. J. Briegel. Measurement-based quantum computation on cluster states. Phys. Rev. A 68, 022312 (2003).","DOI":"10.1103\/PhysRevA.68.022312"},{"key":"9","doi-asserted-by":"publisher","unstructured":"S. Bartolucci, P. Birchall, H. Bomb\u00edn, H. Cable, C. Dawson, M. Gimeno-Segovia, E. Johnston, K. Kieling, N. Nickerson, M. Pant, F. Pastawski, T. Rudolph, C. Sparrow. Fusion-based quantum computation. Nat Commun 14, 912 (2023).","DOI":"10.1038\/s41467-023-36493-1"},{"key":"10","doi-asserted-by":"publisher","unstructured":"H. Bombin, I. H. Kim, D. Litinski, N. Nickerson, M. Pant, F. Pastawski, S. Roberts, T. Rudolph. Interleaving: Modular architectures for fault-tolerant photonic quantum computing. arXiv:quant-ph\/2103.08612 (2021).","DOI":"10.48550\/arXiv.2103.08612"},{"key":"11","doi-asserted-by":"publisher","unstructured":"H. Bombin, C. Dawson, R. V. Mishmash, N. Nickerson, F. Pastawski, S. Roberts. Logical blocks for fault-tolerant topological quantum computation. arXiv:quant-ph\/2112.12160 (2021).","DOI":"10.48550\/arXiv.2112.12160"},{"key":"12","doi-asserted-by":"publisher","unstructured":"H. Bombin, D. Litinski, N. Nickerson, F. Pastawski, S. Roberts. Unifying flavors of fault tolerance with the ZX calculus. arXiv:quant-ph\/2303.08829 (2023).","DOI":"10.48550\/arXiv.2303.08829"},{"key":"13","doi-asserted-by":"publisher","unstructured":"H. Bomb\u00edn, C. Dawson, N. Nickerson, M. Pant, J. Sullivan. Increasing error tolerance in quantum computers with dynamic bias arrangement. arXiv:quant-ph\/2303.16122 (2023).","DOI":"10.48550\/arXiv.2303.16122"},{"key":"14","doi-asserted-by":"publisher","unstructured":"D. E. Browne, T. Rudolph. Resource-efficient linear optical quantum computation. Phys. Rev. Lett. 95, 010501 (2005).","DOI":"10.1103\/PhysRevLett.95.010501"},{"key":"15","doi-asserted-by":"publisher","unstructured":"J. Joo, P. L. Knight, J. L. O\u2019Brien, T. Rudolph. One-way quantum computation with four-dimensional photonic qudits. Phys. Rev. A 76, 052326 (2007).","DOI":"10.1103\/PhysRevA.76.052326"},{"key":"16","doi-asserted-by":"publisher","unstructured":"K. Kieling, T. Rudolph, J. Eisert. Percolation, renormalization, and quantum computing with non-deterministic gates. Phys. Rev. Lett. 99, 130501 (2007).","DOI":"10.1103\/PhysRevLett.99.130501"},{"key":"17","doi-asserted-by":"publisher","unstructured":"M. Gimeno-Segovia, P. Shadbolt, D. E. Browne, T. Rudolph. From three-photon GHZ states to ballistic universal quantum computation. Phys. Rev. Lett. 115, 020502 (2015).","DOI":"10.1103\/PhysRevLett.115.020502"},{"key":"18","doi-asserted-by":"publisher","unstructured":"S. Omkar, S.-H. Lee, Y. S. Teo, S.-W.Lee, S.-W., H. Jeong. All-photonic architectural roadmap for scalable quantum computing using Greenberger-Horne-Zeilinger states. PRX Quantum 3, 030309 (2022).","DOI":"10.1103\/PRXQuantum.3.030309"},{"key":"19","doi-asserted-by":"publisher","unstructured":"S.-H. Lee, S. Omkar, Y. S. Teo, H. Jeong. Parity-encoding-based quantum computing with Bayesian error tracking. npj Quantum Inf 9, 39 (2023).","DOI":"10.1038\/s41534-023-00705-9"},{"key":"20","doi-asserted-by":"publisher","unstructured":"H. Zhang, A. Wu, Y. Wang, G. Li, H. Shapourian, A. Shabani, Y. Ding. A Compilation Framework for Photonic One-Way Quantum Computation. Proceedings of the 50th Annual International Symposium on Computer Architecture (2023).","DOI":"10.1145\/3579371.3589047"},{"key":"21","doi-asserted-by":"publisher","unstructured":"H. J. Briegel, R. Raussendorf. Persistent Entanglement in Arrays of Interacting Particles. Phys. Rev. Lett. 86, 910\u2013913 (2001).","DOI":"10.1103\/PhysRevLett.86.910"},{"key":"22","doi-asserted-by":"publisher","unstructured":"R. Raussendorf, J. Harrington, K. Goyal. A fault-tolerant one-way quantum computer. Annals of Physics 321, 2242\u20132270 (2006).","DOI":"10.1016\/j.aop.2006.01.012"},{"key":"23","doi-asserted-by":"publisher","unstructured":"B. J. Brown, S. Roberts. Universal fault-tolerant measurement-based quantum computation. Phys. Rev. Res. 2, 033305 (2020).","DOI":"10.1103\/PhysRevResearch.2.033305"},{"key":"24","doi-asserted-by":"publisher","unstructured":"A. Bolt, G. Duclos-Cianci, D. Poulin, T. M. Stace. Foliated Quantum Error-Correcting Codes. Phys. Rev. Lett. 117, 070501 (2016).","DOI":"10.1103\/PhysRevLett.117.070501"},{"key":"25","doi-asserted-by":"publisher","unstructured":"N. Nickerson, H. Bomb\u00edn. Measurement based fault tolerance beyond foliation. arXiv:quant-ph\/1810.09621 (2018).","DOI":"10.48550\/arXiv.1810.09621"},{"key":"26","doi-asserted-by":"publisher","unstructured":"E. Knill, R. Laflamme. A scheme for efficient quantum computation with linear optics. Nature 409, 7 (2001).","DOI":"10.1038\/35051009"},{"key":"27","doi-asserted-by":"publisher","unstructured":"T. B. Pittman, B. C. Jacobs, J. D. Franson. Probabilistic Quantum Logic Operations Using Polarizing Beam Splitters. Phys. Rev. A 64, 062311 (2001).","DOI":"10.1103\/PhysRevA.64.062311"},{"key":"28","doi-asserted-by":"publisher","unstructured":"M. Oszmaniec, D. J. Brod. Classical simulation of photonic linear optics with lost particles. New J. Phys. 20, 092002 (2018).","DOI":"10.1088\/1367-2630\/aadfa8"},{"key":"29","doi-asserted-by":"publisher","unstructured":"D. J. Brod, M. Oszmaniec. Classical simulation of linear optics subject to nonuniform losses. Quantum 4, 267 (2020).","DOI":"10.22331\/q-2020-05-14-267"},{"key":"30","doi-asserted-by":"publisher","unstructured":"J. E. Davis, D. \u00d6. G\u00fcney. Effect of loss on linear optical quantum logic gates. J. Opt. Soc. Am. B, JOSAB 38, 153\u2013159 (2021).","DOI":"10.1364\/JOSAB.430603"},{"key":"31","doi-asserted-by":"publisher","unstructured":"T. M. Stace, S. D. Barrett. Error Correction and Degeneracy in Surface Codes Suffering Loss. Phys. Rev. A 81, 022317 (2010).","DOI":"10.1103\/PhysRevA.81.022317"},{"key":"32","doi-asserted-by":"publisher","unstructured":"S. D. Barrett, T. M. Stace. Fault tolerant quantum computation with very high threshold for loss errors. Phys. Rev. Lett. 105, 200502 (2010).","DOI":"10.1103\/PhysRevLett.105.200502"},{"key":"33","doi-asserted-by":"publisher","unstructured":"D. Herr, A. Paler, S. J. Devitt, F. Nori. A local and scalable lattice renormalization method for ballistic quantum computation. npj Quantum Information 4, 1\u20138 (2018).","DOI":"10.1038\/s41534-018-0076-0"},{"key":"34","doi-asserted-by":"publisher","unstructured":"M. Pant, D. Towsley, D. Englund, S. Guha. Percolation thresholds for photonic quantum computing. Nature Communications 10, 1070 (2019).","DOI":"10.1038\/s41467-019-08948-x"},{"key":"35","doi-asserted-by":"publisher","unstructured":"A. Yu. Kitaev. Quantum Error Correction with Imperfect Gates. in: Hirota, O., Holevo, A.S., Caves, C.M. (Eds.), Quantum Communication, Computing, and Measurement. Springer US, Boston, MA, pp. 181\u2013188. (1997).","DOI":"10.1007\/978-1-4615-5923-8_19"},{"key":"36","doi-asserted-by":"publisher","unstructured":"A. Y. Kitaev. Quantum computations: algorithms and error correction. Russ. Math. Surv. 52, 1191\u20131249 (1997).","DOI":"10.1070\/RM1997v052n06ABEH002155"},{"key":"37","doi-asserted-by":"publisher","unstructured":"S. Bravyi, A. Kitaev. Quantum codes on a lattice with boundary. arXiv:quant-ph\/9811052 (1998).","DOI":"10.48550\/arXiv.quant-ph\/9811052"},{"key":"38","doi-asserted-by":"publisher","unstructured":"E. Dennis, A. Kitaev, A. Landahl, J. Preskill. Topological quantum memory. Journal of Mathematical Physics 43, 4452\u20134505 (2002).","DOI":"10.1063\/1.1499754"},{"key":"39","doi-asserted-by":"publisher","unstructured":"A. G. Fowler, M. Mariantoni, J. M. Martinis, A. N. Cleland. Surface codes: Towards practical large-scale quantum computation. Phys. Rev. A 86, 032324 (2012).","DOI":"10.1103\/PhysRevA.86.032324"},{"key":"40","doi-asserted-by":"publisher","unstructured":"S. Paesani, B. J. Brown. High-threshold quantum computing by fusing one-dimensional cluster states. Phys. Rev. Lett. 131, 120603 (2022).","DOI":"10.1103\/PhysRevLett.131.120603"},{"key":"41","doi-asserted-by":"publisher","unstructured":"M. Davydova, N. Tantivasadakarn, S. Balasubramanian. Floquet codes without parent subsystem codes. PRX Quantum 4, 020341 (2023).","DOI":"10.1103\/PRXQuantum.4.020341"},{"key":"42","doi-asserted-by":"publisher","unstructured":"M. S. Kesselring, J. C. M. de la Fuente, F. Thomsen, J. Eisert, S. D. Bartlett, B. J. Brown. Anyon condensation and the color code. PRX Quantum 5, 010342 (2024).","DOI":"10.1103\/PRXQuantum.5.010342"},{"key":"43","doi-asserted-by":"publisher","unstructured":"J. R. Wootton. Measurements of Floquet code plaquette stabilizers. arXiv:quant-ph\/2210.13154 (2022).","DOI":"10.48550\/arXiv.2210.13154"},{"key":"44","doi-asserted-by":"publisher","unstructured":"B. Coecke, R. Duncan. Interacting Quantum Observables. in: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (Eds.), Automata, Languages and Programming, Lecture Notes in Computer Science. Springer, Berlin, Heidelberg, pp. 298\u2013310 (2008).","DOI":"10.1007\/978-3-540-70583-3_25"},{"key":"45","doi-asserted-by":"publisher","unstructured":"B. Coecke, R. Duncan. Interacting quantum observables: categorical algebra and diagrammatics. New J. Phys. 13, 043016 (2011).","DOI":"10.1088\/1367-2630\/13\/4\/043016"},{"key":"46","doi-asserted-by":"publisher","unstructured":"J. van de Wetering. ZX-calculus for the working quantum computer scientist. arXiv:quant-ph\/2012.13966 (2020).","DOI":"10.48550\/arXiv.2012.13966"},{"key":"47","doi-asserted-by":"publisher","unstructured":"C. H. Bennett, G. Brassard, C. Cr\u00e9peau, R. Jozsa, A. Peres, W. K. Wootters. Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. Phys. Rev. Lett. 70, 1895\u20131899 (1993).","DOI":"10.1103\/PhysRevLett.70.1895"},{"key":"48","doi-asserted-by":"publisher","unstructured":"D. Gottesman, I. Chuang. Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations. Nature 402, 390\u2013393 (1999).","DOI":"10.1038\/46503"},{"key":"49","doi-asserted-by":"publisher","unstructured":"M. A. Nielsen. Universal quantum computation using only projective measurement, quantum memory, and preparation of the 0 state. Physics Letters A 308, 96\u2013100 (2003).","DOI":"10.1016\/S0375-9601(02)01803-0"},{"key":"50","doi-asserted-by":"publisher","unstructured":"D. W. Leung. Quantum computation by measurements. arXiv:quant-ph\/0310189 (2004).","DOI":"10.48550\/arXiv.quant-ph\/0310189"},{"key":"51","doi-asserted-by":"publisher","unstructured":"D. W. Leung. Two-qubit Projective Measurements are Universal for Quantum Computation. arXiv:quant-ph\/0111122 (2002).","DOI":"10.48550\/arXiv.quant-ph\/0111122"},{"key":"52","doi-asserted-by":"publisher","unstructured":"M. A. Nielsen, C. M. Dawson. Fault-tolerant quantum computation with cluster states. Phys. Rev. A 71, 042323 (2005).","DOI":"10.1103\/PhysRevA.71.042323"},{"key":"53","doi-asserted-by":"publisher","unstructured":"A. M. Childs, D. W. Leung, M. A. Nielsen. Unified derivations of measurement-based schemes for quantum computation. Phys. Rev. A 71, 032318 (2005).","DOI":"10.1103\/PhysRevA.71.032318"},{"key":"54","doi-asserted-by":"publisher","unstructured":"R. Jozsa. An introduction to measurement based quantum computation. arXiv:quant-ph\/0508124 (2005).","DOI":"10.48550\/arXiv.quant-ph\/0508124"},{"key":"55","doi-asserted-by":"publisher","unstructured":"D. Aharonov, M. Ben-Or. Fault-Tolerant Quantum Computation with Constant Error Rate. SIAM J. Comput. 38, 1207\u20131282 (2008).","DOI":"10.1137\/S0097539799359385"},{"key":"56","doi-asserted-by":"publisher","unstructured":"A. G. Fowler, A. M. Stephens, P. Groszkowski. High-threshold universal quantum computation on the surface code. Phys. Rev. A 80, 052312 (2009).","DOI":"10.1103\/PhysRevA.80.052312"},{"key":"57","doi-asserted-by":"publisher","unstructured":"E. T. Campbell, B. M. Terhal, C. Vuillot. Roads towards fault-tolerant universal quantum computation. Nature 549, 172\u2013179 (2017).","DOI":"10.1038\/nature23460"},{"key":"58","doi-asserted-by":"publisher","unstructured":"W.P. Grice. Arbitrarily complete Bell-state measurement using only linear optical elements. Phys. Rev. A 84, 042331 (2011).","DOI":"10.1103\/PhysRevA.84.042331"},{"key":"59","doi-asserted-by":"publisher","unstructured":"J. Edmonds. Maximum matching and a polyhedron with 0, 1-vertices. Journal of research of the National Bureau of Standards B, 69(125-130):55\u201356 (1965).","DOI":"10.6028\/JRES.069B.013"},{"key":"60","doi-asserted-by":"publisher","unstructured":"J. Edmonds. Paths, trees and flowers. Canad. J. Math., 17:449 (1965).","DOI":"10.4153\/CJM-1965-045-4"},{"key":"61","doi-asserted-by":"publisher","unstructured":"O. Higgott, C. Gidney. Sparse Blossom: correcting a million errors per core second with minimum-weight matching. Quantum 9, 1600 (2025).","DOI":"10.22331\/q-2025-01-20-1600"},{"key":"62","doi-asserted-by":"publisher","unstructured":"E. Knill, R. Laflamme, and G. J. Milburn. A scheme for efficient quantum computation with linear optics. Nature 409, 46-52 (2001).","DOI":"10.1038\/35051009"},{"key":"63","doi-asserted-by":"publisher","unstructured":"E. Knill. Quantum gates using linear optics and postselection. Phys. Rev. A 66, 052306 (2002).","DOI":"10.1103\/PhysRevA.66.052306"},{"key":"64","doi-asserted-by":"publisher","unstructured":"Q. Zhang, X.-H. Bao, C.-Y. Lu, X.-Q. Zhou, T. Yang, T. Rudolph, and J.-W. Pan. Demonstration of a scheme for the generation of \u201cevent-ready\u201d entangled photon pairs from a single-photon source. Phys. Rev. A 77, 062316 (2008).","DOI":"10.1103\/PhysRevA.77.062316"},{"key":"65","doi-asserted-by":"publisher","unstructured":"S. A. Fldzhyan, M. Yu. Saygin, and S. P. Kulik. Compact linear optical scheme for Bell state generation. Phys. Rev. Research 3, 043031 (2021).","DOI":"10.1103\/PhysRevResearch.3.043031"},{"key":"66","doi-asserted-by":"publisher","unstructured":"D. B. Uskov, P. M. Alsing, M. L. Fanto, L. Kaplan, R. Kim, A. Szep, and A. M. Smith. Resource-efficient generation of linear cluster states by linear optics with postselection. J. Phys. B: At. Mol. Opt. Phys. 48 045502 (2015).","DOI":"10.1088\/0953-4075\/48\/4\/045502"},{"key":"67","doi-asserted-by":"publisher","unstructured":"V. C. Vivoli, J. Ribeiro, and S. Wehner. High-fidelity Greenberger-Horne-Zeilinger state generation within nearby nodes. Phys. Rev. A 100, 032310 (2019).","DOI":"10.1103\/PhysRevA.100.032310"},{"key":"68","doi-asserted-by":"publisher","unstructured":"M. Varnava, D. E. Browne, and T. Rudolph. How Good Must Single Photon Sources and Detectors Be for Efficient Linear Optical Quantum Computation? Phys. Rev. Lett. 100, 060502 (2008).","DOI":"10.1103\/PhysRevLett.100.060502"},{"key":"69","doi-asserted-by":"publisher","unstructured":"D. B. Uskov, L. Kaplan, A. M. Smith, S. D. Huver, and J. P. Dowling. Maximal success probabilities of linear-optical quantum gates. Phys. Rev. A 79, 042326 (2009).","DOI":"10.1103\/PhysRevA.79.042326"},{"key":"70","doi-asserted-by":"publisher","unstructured":"J. Eisert. Optimizing Linear Optics Quantum Gates . Phys. Rev. Lett. 95, 040502 (2004).","DOI":"10.1103\/PhysRevLett.95.040502"},{"key":"71","doi-asserted-by":"publisher","unstructured":"F. V. Gubarev, I. V. Dyakonov, M. Yu. Saygin, G. I. Struchalin, S. S. Straupe, and S. P. Kulik. Improved heralded schemes to generate entangled states from single photons. Phys. Rev. A 102, 012604 (2020).","DOI":"10.1103\/PhysRevA.102.012604"}],"container-title":["Quantum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/quantum-journal.org\/papers\/q-2025-06-04-1762\/pdf\/","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T14:05:31Z","timestamp":1749045931000},"score":1,"resource":{"primary":{"URL":"https:\/\/quantum-journal.org\/papers\/q-2025-06-04-1762\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,4]]},"references-count":72,"URL":"https:\/\/doi.org\/10.22331\/q-2025-06-04-1762","archive":["CLOCKSS"],"relation":{},"ISSN":["2521-327X"],"issn-type":[{"value":"2521-327X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,4]]},"article-number":"1762"}}