Building a fusion-based quantum computer using teleported gates

Ashot Avanesov; Alexander Shurinov; Ivan Dyakonov; Stanislav Straupe

doi:10.22331/q-2025-06-04-1762

Building a fusion-based quantum computer using teleported gates

Ashot Avanesov¹, Alexander Shurinov², Ivan Dyakonov^2,1, and Stanislav Straupe^2,1

¹Russian Quantum Center, Russia, Moscow, 121205, Bol'shoy bul'var 30 building 1
²Quantum Technologies Centre, Lomonosov Moscow State University, Russia, Moscow, 119991, Leninskie Gory 1 building 35

Published:	2025-06-04, volume 9, page 1762
Editor:	Narayanan Rengaswamy
Eprint:	arXiv:2404.01477v3
Doi:	https://doi.org/10.22331/q-2025-06-04-1762
Citation:	Quantum 9, 1762 (2025).

Find this paper interesting or want to discuss? Scite or leave a comment on SciRate.

Abstract

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.

Featured image: Construction of one of the two types of check operators for the 10-qubit fusion network. The colors show the Pauli operators the products of which are elements of $C=R\cap F$: violet for $X$, green for $Z$, and white for the identity. Yellow edges connect the fusing qubits. Every violet qubit corresponds to a face in the gray-colored lattice that is dual to the syndrome graph of the check operators. The white and green qubits correspond to edges of this lattice.

► BibTeX data

@article{Avanesov2025buildingfusionbased,
  doi = {10.22331/q-2025-06-04-1762},
  url = {https://doi.org/10.22331/q-2025-06-04-1762},
  title = {Building a fusion-based quantum computer using teleported gates},
  author = {Avanesov, Ashot and Shurinov, Alexander and Dyakonov, Ivan and Straupe, Stanislav},
  journal = {{Quantum}},
  issn = {2521-327X},
  publisher = {{Verein zur F{\"{o}}rderung des Open Access Publizierens in den Quantenwissenschaften}},
  volume = {9},
  pages = {1762},
  month = jun,
  year = {2025}
}

► References

[1] 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–3467 (1995).
https://doi.org/10.1103/PhysRevA.52.3457

[2] A. Y. Kitaev. Quantum computations: algorithms and error correction. Russ. Math. Surv. 52, 1191–1249 (1997).
https://doi.org/10.1070/RM1997v052n06ABEH002155

[3] M. A. Nielsen, I. Chuang. Quantum Computation and Quantum Information. Cambridge (2010). Cambridge University Press.

[4] 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–348 (1994).
https://doi.org/10.1016/0009-2614(94)00117-0

[5] E. Farhi, J. Goldstone, S. Gutmann, M. Sipser. Quantum Computation by Adiabatic Evolution. arXiv:quant-ph/0001106 (2000).
https://doi.org/10.48550/arXiv.quant-ph/0001106
arXiv:quant-ph/0001106

[6] A. Y. Kitaev. Fault-tolerant quantum computation by anyons. Annals of Physics 303, 2–30 (2003), arXiv:quant-ph/9707021 (1997).
https://doi.org/10.48550/arXiv.quant-ph/9707021
arXiv:quant-ph/9707021

[7] C. Nayak, S. H. Simon, A. Stern, M. Freedman, S. Das Sarma. Non-Abelian anyons and topological quantum computation. Rev. Mod. Phys. 80, 1083–1159 (2008).
https://doi.org/10.1103/RevModPhys.80.1083

[8] R. Raussendorf, H. J. Briegel. A One-Way Quantum Computer. Phys. Rev. Lett. 86, 5188–5191 (2001).
https://doi.org/10.1103/PhysRevLett.86.5188

[9] R. Raussendorf, D. E. Browne, H. J. Briegel. Measurement-based quantum computation on cluster states. Phys. Rev. A 68, 022312 (2003).
https://doi.org/10.1103/PhysRevA.68.022312

[10] S. Bartolucci, P. Birchall, H. Bombín, 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).
https://doi.org/10.1038/s41467-023-36493-1

[11] 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).
https://doi.org/10.48550/arXiv.2103.08612
arXiv:quant-ph/2103.08612

[12] 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).
https://doi.org/10.48550/arXiv.2112.12160
arXiv:quant-ph/2112.12160

[13] 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).
https://doi.org/10.48550/arXiv.2303.08829
arXiv:quant-ph/2303.08829

[14] H. Bombín, C. Dawson, N. Nickerson, M. Pant, J. Sullivan. Increasing error tolerance in quantum computers with dynamic bias arrangement. arXiv:quant-ph/2303.16122 (2023).
https://doi.org/10.48550/arXiv.2303.16122
arXiv:quant-ph/2303.16122

[15] D. E. Browne, T. Rudolph. Resource-efficient linear optical quantum computation. Phys. Rev. Lett. 95, 010501 (2005).
https://doi.org/10.1103/PhysRevLett.95.010501

[16] J. Joo, P. L. Knight, J. L. O’Brien, T. Rudolph. One-way quantum computation with four-dimensional photonic qudits. Phys. Rev. A 76, 052326 (2007).
https://doi.org/10.1103/PhysRevA.76.052326

[17] K. Kieling, T. Rudolph, J. Eisert. Percolation, renormalization, and quantum computing with non-deterministic gates. Phys. Rev. Lett. 99, 130501 (2007).
https://doi.org/10.1103/PhysRevLett.99.130501

[18] 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).
https://doi.org/10.1103/PhysRevLett.115.020502

[19] 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).
https://doi.org/10.1103/PRXQuantum.3.030309

[20] 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).
https://doi.org/10.1038/s41534-023-00705-9

[21] 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).
https://doi.org/10.1145/3579371.3589047

[22] H. J. Briegel, R. Raussendorf. Persistent Entanglement in Arrays of Interacting Particles. Phys. Rev. Lett. 86, 910–913 (2001).
https://doi.org/10.1103/PhysRevLett.86.910

[23] R. Raussendorf, J. Harrington, K. Goyal. A fault-tolerant one-way quantum computer. Annals of Physics 321, 2242–2270 (2006).
https://doi.org/10.1016/j.aop.2006.01.012

[24] B. J. Brown, S. Roberts. Universal fault-tolerant measurement-based quantum computation. Phys. Rev. Res. 2, 033305 (2020).
https://doi.org/10.1103/PhysRevResearch.2.033305

[25] A. Bolt, G. Duclos-Cianci, D. Poulin, T. M. Stace. Foliated Quantum Error-Correcting Codes. Phys. Rev. Lett. 117, 070501 (2016).
https://doi.org/10.1103/PhysRevLett.117.070501

[26] N. Nickerson, H. Bombín. Measurement based fault tolerance beyond foliation. arXiv:quant-ph/1810.09621 (2018).
https://doi.org/10.48550/arXiv.1810.09621
arXiv:quant-ph/1810.09621

[27] E. Knill, R. Laflamme. A scheme for efficient quantum computation with linear optics. Nature 409, 7 (2001).
https://doi.org/10.1038/35051009

[28] T. B. Pittman, B. C. Jacobs, J. D. Franson. Probabilistic Quantum Logic Operations Using Polarizing Beam Splitters. Phys. Rev. A 64, 062311 (2001).
https://doi.org/10.1103/PhysRevA.64.062311

[29] M. Oszmaniec, D. J. Brod. Classical simulation of photonic linear optics with lost particles. New J. Phys. 20, 092002 (2018).
https://doi.org/10.1088/1367-2630/aadfa8

[30] D. J. Brod, M. Oszmaniec. Classical simulation of linear optics subject to nonuniform losses. Quantum 4, 267 (2020).
https://doi.org/10.22331/q-2020-05-14-267

[31] J. E. Davis, D. Ö. Güney. Effect of loss on linear optical quantum logic gates. J. Opt. Soc. Am. B, JOSAB 38, 153–159 (2021).
https://doi.org/10.1364/JOSAB.430603

[32] T. M. Stace, S. D. Barrett. Error Correction and Degeneracy in Surface Codes Suffering Loss. Phys. Rev. A 81, 022317 (2010).
https://doi.org/10.1103/PhysRevA.81.022317

[33] S. D. Barrett, T. M. Stace. Fault tolerant quantum computation with very high threshold for loss errors. Phys. Rev. Lett. 105, 200502 (2010).
https://doi.org/10.1103/PhysRevLett.105.200502

[34] 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–8 (2018).
https://doi.org/10.1038/s41534-018-0076-0

[35] M. Pant, D. Towsley, D. Englund, S. Guha. Percolation thresholds for photonic quantum computing. Nature Communications 10, 1070 (2019).
https://doi.org/10.1038/s41467-019-08948-x

[36] 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–188. (1997).
https://doi.org/10.1007/978-1-4615-5923-8_19

[37] A. Y. Kitaev. Quantum computations: algorithms and error correction. Russ. Math. Surv. 52, 1191–1249 (1997).
https://doi.org/10.1070/RM1997v052n06ABEH002155

[38] S. Bravyi, A. Kitaev. Quantum codes on a lattice with boundary. arXiv:quant-ph/9811052 (1998).
https://doi.org/10.48550/arXiv.quant-ph/9811052
arXiv:quant-ph/9811052

[39] E. Dennis, A. Kitaev, A. Landahl, J. Preskill. Topological quantum memory. Journal of Mathematical Physics 43, 4452–4505 (2002).
https://doi.org/10.1063/1.1499754

[40] 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).
https://doi.org/10.1103/PhysRevA.86.032324

[41] S. Paesani, B. J. Brown. High-threshold quantum computing by fusing one-dimensional cluster states. Phys. Rev. Lett. 131, 120603 (2022).
https://doi.org/10.1103/PhysRevLett.131.120603

[42] M. Davydova, N. Tantivasadakarn, S. Balasubramanian. Floquet codes without parent subsystem codes. PRX Quantum 4, 020341 (2023).
https://doi.org/10.1103/PRXQuantum.4.020341

[43] 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).
https://doi.org/10.1103/PRXQuantum.5.010342

[44] J. R. Wootton. Measurements of Floquet code plaquette stabilizers. arXiv:quant-ph/2210.13154 (2022).
https://doi.org/10.48550/arXiv.2210.13154
arXiv:quant-ph/2210.13154

[45] B. Coecke, R. Duncan. Interacting Quantum Observables. in: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (Eds.), Automata, Languages and Programming, Lecture Notes in Computer Science. Springer, Berlin, Heidelberg, pp. 298–310 (2008).
https://doi.org/10.1007/978-3-540-70583-3_25

[46] B. Coecke, R. Duncan. Interacting quantum observables: categorical algebra and diagrammatics. New J. Phys. 13, 043016 (2011).
https://doi.org/10.1088/1367-2630/13/4/043016

[47] J. van de Wetering. ZX-calculus for the working quantum computer scientist. arXiv:quant-ph/2012.13966 (2020).
https://doi.org/10.48550/arXiv.2012.13966
arXiv:quant-ph/2012.13966

[48] C. H. Bennett, G. Brassard, C. Crépeau, 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–1899 (1993).
https://doi.org/10.1103/PhysRevLett.70.1895

[49] D. Gottesman, I. Chuang. Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations. Nature 402, 390–393 (1999).
https://doi.org/10.1038/46503

[50] M. A. Nielsen. Universal quantum computation using only projective measurement, quantum memory, and preparation of the 0 state. Physics Letters A 308, 96–100 (2003).
https://doi.org/10.1016/S0375-9601(02)01803-0

[51] D. W. Leung. Quantum computation by measurements. arXiv:quant-ph/0310189 (2004).
https://doi.org/10.48550/arXiv.quant-ph/0310189
arXiv:quant-ph/0310189

[52] D. W. Leung. Two-qubit Projective Measurements are Universal for Quantum Computation. arXiv:quant-ph/0111122 (2002).
https://doi.org/10.48550/arXiv.quant-ph/0111122
arXiv:quant-ph/0111122

[53] M. A. Nielsen, C. M. Dawson. Fault-tolerant quantum computation with cluster states. Phys. Rev. A 71, 042323 (2005).
https://doi.org/10.1103/PhysRevA.71.042323

[54] A. M. Childs, D. W. Leung, M. A. Nielsen. Unified derivations of measurement-based schemes for quantum computation. Phys. Rev. A 71, 032318 (2005).
https://doi.org/10.1103/PhysRevA.71.032318

[55] R. Jozsa. An introduction to measurement based quantum computation. arXiv:quant-ph/0508124 (2005).
https://doi.org/10.48550/arXiv.quant-ph/0508124
arXiv:quant-ph/0508124

[56] D. Aharonov, M. Ben-Or. Fault-Tolerant Quantum Computation with Constant Error Rate. SIAM J. Comput. 38, 1207–1282 (2008).
https://doi.org/10.1137/S0097539799359385

[57] A. G. Fowler, A. M. Stephens, P. Groszkowski. High-threshold universal quantum computation on the surface code. Phys. Rev. A 80, 052312 (2009).
https://doi.org/10.1103/PhysRevA.80.052312

[58] E. T. Campbell, B. M. Terhal, C. Vuillot. Roads towards fault-tolerant universal quantum computation. Nature 549, 172–179 (2017).
https://doi.org/10.1038/nature23460

[59] W.P. Grice. Arbitrarily complete Bell-state measurement using only linear optical elements. Phys. Rev. A 84, 042331 (2011).
https://doi.org/10.1103/PhysRevA.84.042331

[60] 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–56 (1965).
https://doi.org/10.6028/JRES.069B.013

[61] J. Edmonds. Paths, trees and flowers. Canad. J. Math., 17:449 (1965).
https://doi.org/10.4153/CJM-1965-045-4

[62] O. Higgott, C. Gidney. Sparse Blossom: correcting a million errors per core second with minimum-weight matching. Quantum 9, 1600 (2025).
https://doi.org/10.22331/q-2025-01-20-1600

[63] E. Knill, R. Laflamme, and G. J. Milburn. A scheme for efficient quantum computation with linear optics. Nature 409, 46-52 (2001).
https://doi.org/10.1038/35051009

[64] E. Knill. Quantum gates using linear optics and postselection. Phys. Rev. A 66, 052306 (2002).
https://doi.org/10.1103/PhysRevA.66.052306

[65] 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 “event-ready” entangled photon pairs from a single-photon source. Phys. Rev. A 77, 062316 (2008).
https://doi.org/10.1103/PhysRevA.77.062316

[66] S. A. Fldzhyan, M. Yu. Saygin, and S. P. Kulik. Compact linear optical scheme for Bell state generation. Phys. Rev. Research 3, 043031 (2021).
https://doi.org/10.1103/PhysRevResearch.3.043031

[67] 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).
https://doi.org/10.1088/0953-4075/48/4/045502

[68] V. C. Vivoli, J. Ribeiro, and S. Wehner. High-fidelity Greenberger-Horne-Zeilinger state generation within nearby nodes. Phys. Rev. A 100, 032310 (2019).
https://doi.org/10.1103/PhysRevA.100.032310

[69] 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).
https://doi.org/10.1103/PhysRevLett.100.060502

[70] 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).
https://doi.org/10.1103/PhysRevA.79.042326

[71] J. Eisert. Optimizing Linear Optics Quantum Gates . Phys. Rev. Lett. 95, 040502 (2004).
https://doi.org/10.1103/PhysRevLett.95.040502

[72] 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).
https://doi.org/10.1103/PhysRevA.102.012604

Cited by

[1] Suren A. Fldzhyan, Stanislav S. Straupe, and Mikhail Yu. Saygin, "Resource-efficient linear-optical generation of GHZ-like states", Physical Review Applied 26 2, 024006 (2026).

[2] Harashta Tatimma Larasati and Byung-Soo Choi, "Hybrid Circuit and Measurement-Based Quantum Computing Architecture With Encoded-Fusion-Assisted Teleportation", IEEE Access 14, 68662 (2026).

[3] Kornikar Sen, Adithi Ajith, Saronath Halder, and Ujjwal Sen, "To share and not share a singlet: control qubit and nonclassicality in teleportation", arXiv:2211.02921, (2022).

[4] Kornikar Sen, Adithi Ajith, Saronath Halder, and Ujjwal Sen, "To share and not share a singlet: control qubit and nonclassicality in teleportation", Journal of Physics A Mathematical General 58 5, 055302 (2025).

The above citations are from Crossref's cited-by service (last updated successfully 2026-08-10 23:08:23) and SAO/NASA ADS (last updated successfully 2026-08-10 23:08:24). The list may be incomplete as not all publishers provide suitable and complete citation data.

This Paper is published in Quantum under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. Copyright remains with the original copyright holders such as the authors or their institutions.