IP Library › Granted Patent US 12,373,726
Granted Patent B1
US 12,373,726 · App. 17/545,921 · Granted Jul 29, 2025

Quantum computer designs with core computing and cache regions that utilize lattice surgery

Inventors: Christopher Chamberland (Pasadena, CA); Earl Terence Campbell (Sheffield, GB)
Assignee: Amazon Technologies, Inc.
G06N10/80G06N10/40
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,373,726
App. No.
17/545,921
Granted
Jul 29, 2025
Kind
B1
Abstract

A technique for performing lattice surgery without using twists is disclosed. Also, an error correcting code and decoder is provided that allows for error decoding of Pauli measurements performed in association with a lattice surgery operation. This allows for overall run-times of lattice surgery to be reduced. For example, some level of errors are tolerable, because they can be corrected, thus fewer measurement rounds (d m ) may be performed for a given round of Pauli measurements. Additionally, a temporal encoding of lattice surgery technique is provided, which may additionally or alternatively be used to shorten run times. Also, a quantum computer layout is provided, wherein the layout includes a core computing region and a cache region. Also, protocols for swapping logical qubits between the core and cache are provided.

Claims (61)

1. A system, comprising:

quantum hardware comprising an array of qubits arranged in two-dimensional tiles;

a memory storing program instructions; and

one or more processors, wherein the program instructions, when executed on or across, the one or more processors, cause the one or more processors to:

implement surface code patches using the qubits of the tiles of the quantum hardware, wherein the surface code patches are implemented in:

a computing core region of the two-dimensional array of qubits; and

a cache region of the two-dimensional array of qubits,

wherein the surface code patches in the computing core region are arranged such that the surface code patches are spaced out with a greater number of routing qubits between respective ones of the surface code patches than a number of routing qubits that are included between respective ones of the surface code patches in the cache region; and

perform arbitrary lattice surgery operations to:

perform quantum computations between surface code patches in the computing core region; and

move respective ones of the surface code patches, via the routing qubits, between the cache region and the computing core region.

2. The system of claim 1 , wherein the core region comprises:

a plurality of unit cells, wherein each unit cell comprises a set of surface code patches and a routing space.

3. The system of claim 2 , wherein:

each unit cell comprises four surface code patches, and

the core region comprises four or more unit cells.

4. The system of claim 3 , wherein respective ones of the surface code patches have a Z dimension d z and an X dimension d x ,

wherein respective ones of the unit cells have an X dimension equal to or less than two times the d z dimension of the surface code patches plus the d x dimension of the surface code patches plus one tile, and

wherein the respective ones of the unit cells have a Z dimension equal to or less than three times the d z dimension of the surface code patches plus one tile.

5. The system of claim 4 , further comprising:

an edge padding comprising additional routing qubits between the unit cells and the cache region.

6. The system of claim 1 , wherein the program instructions, when executed on or across, the one or more processors, cause the one or more processors to:

clean a Clifford frame after moving a surface code patch into, or out of, the cache region, such that the Clifford frame acts on the core computing region and not the cache region.

7. The system of claim 1 , wherein the program instructions, when executed on or across the one or more process, cause the one or more processors to:

perform lattice surgery operations to move surface code patches into, or out of, the cache region without using twists to perform Pauli measurements associated with performing the lattice surgery.

8. The system of claim 1 , wherein a total computing region comprising the core computing region and the cache region has a routing overhead of 2 or less, wherein the routing overhead is a ratio of routing qubits to data qubits.

9. The system of claim 8 , wherein the cache has a lower routing overhead than the core computing region.

10. A method of implementing a core computing region and a cache region using qubits of a quantum hardware device, the method comprising:

implementing surface code patches using the qubits of the quantum hardware device, wherein the surface code patches are implemented in:

a computing core region of the quantum hardware device; and

a cache region of the quantum hardware device,

wherein the surface code patches in the computing core region are arranged such that the surface code patches are spaced out with a greater number of routing qubits between respective ones of the surface code patches than a number of routing qubits that are included between respective ones of the surface code patches in the cache region; and

performing lattice surgery operations to:

perform quantum computations between surface code patches in the computing core region; or

move respective ones of the surface code patches, via the routing qubits, between the cache region and the computing core region.

11. The method of claim 10 , wherein the core region comprises:

a plurality of unit cells, wherein each unit cell comprises a set of surface code patches and a routing space.

12. The method of claim 11 , wherein:

each unit cell comprises four or more surface code patches, and

the core region comprises four or more unit cells.

13. The method of claim 12 , wherein:

respective ones of the surface code patches have a Z dimension d Z and an X dimension d X ,

respective ones of the unit cells have an X dimension equal to or less than two times the d Z dimension of the surface code patches plus the d X dimension of the surface code patches plus one tile, and

the respective ones of the unit cells have a Z dimension equal to or less than three times the d Z dimension of the surface code patches plus one tile.

14. The method of claim 10 , further comprising:

performing lattice surgery operations to move surface code patches into and out of the cache region.

15. The method of claim 14 , further comprising:

clean a Clifford frame after moving a surface code patch into or out of the cache region, such that the Clifford frame acts on the core computing region and not the cache region.

16. The method of claim 14 , wherein the lattice surgery operations are performed without using twists to perform Pauli measurements associated with performing the lattice surgery.

17. A non-transitory, computer-readable, medium storing program instructions that, when executed on or across one or more processors, cause the one or more processors to:

implement surface code patches using qubits of a quantum hardware device, wherein the surface code patches are implemented in:

a computing core region; and

a cache region,

wherein the surface code patches in the computing core region are arranged such that the surface code patches are spaced out with a greater number of routing qubits between respective ones of the surface code patches than a number of routing qubits that are included between respective ones of the surface code patches in the cache region; and

perform lattice surgery operations to:

perform quantum computations between surface code patches in the computing core region; or

move respective ones of the surface code patches, via the routing qubits, between the cache region and the computing core region.

18. The non-transitory, computer-readable, medium of claim 17 , wherein the program instructions, when executed on or across the one or more processors, further cause the one or more processors to:

clean a Clifford frame after moving a surface code patch into or out of the cache region, such that the Clifford frame acts on the core computing region and not the cache region.

19. The non-transitory, computer-readable, medium of claim 17 , wherein a unit cell has a routing overhead of 1.5 or less, wherein the routing overhead is a ratio of routing qubits to data qubits.

20. The non-transitory, computer-readable, medium of claim 17 , wherein the cache has a lower routing overhead than the core computing region.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 9, 2021
From: CHAMBERLAND, CHRISTOPHER; CAMPBELL, EARL TERENCE
To: AMAZON TECHNOLOGIES, INC.
Reel/Frame 058348/0785 →
Continuity (1)
Provisional Application 63238727 · Aug 30, 2021
References Cited (90)
US 8569042B2 · Chowdhury · 2013 [cited by examiner]
US 10510943B1 · Topaloglu · 2019 [cited by examiner]
US 11568298B2 · Gidney · 2023 [cited by examiner]
US 20180165787A1 · Bolz · 2018 [cited by examiner]
US 20190080254A1 · Haah et al. · 2019 [cited by applicant]
US 20200075834A1 · Topaloglu · 2020 [cited by examiner]
US 20200311593A1 · Gidney · 2020 [cited by examiner]
US 20200401478A1 · Reilly et al. · 2020 [cited by applicant]
US 20210126652A1 · Delfosse et al. · 2021 [cited by applicant]
US 20220028927A1 · Lauer · 2022 [cited by examiner]
US 20220101172A1 · Lee et al. · 2022 [cited by applicant]
US 20220414509A1 · Haah · 2022 [cited by applicant]
J. Preskill, “Reliable quantum computers”, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 454, pp. 385-410 (1998). [cited by applicant]
B. M. Terhal, “Quantum error correction for quantum memories”, Rev. Mod. Phys. 87, 307, arXiv:1302.3428 (2015), pp. 1-47. [cited by applicant]
E. T. Campbell, B. M. Terhal, and C. Vuillot, “Roads towards fault-tolerant universal quantum computation,” Nature 549, pp. 172-179 (2017) arXiv:1612.07330v1 [quant-ph]. [cited by applicant]
A. Y. Kitaev, “Fault-tolerant quantum computation by anyons”, Annals of Physics 303, pp. 2-30 (2003), 2002 Elsevier Science. [cited by applicant]
A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, “Surface codes: Towards practical large-scale quantum computation”, Phys. Rev. A 86, 032324 (2012), © 2012 American Physical Society, pp. 1-48. [cited by applicant]
P. W. Shor, “Fault-tolerant quantum computation”, in Proceedings of the 37th Annual Symposium on Foundations of Computer Science (IEEE, 1996) pp. 56-65. [cited by applicant]
R. Raussendorf, J. Harrington, and K. Goyal, “Topological fault-tolerance in cluster state quantum computation”, New Journal of Physics 9, 199, © IOP Publishing Ltd and Deutsche Physikalische Gesellschaft (2007), pp. 1-… [cited by applicant]
C. Horsman, A. G. Fowler, S. Devitt, and R. Van Meter, “Surface code quantum computing by lattice surgery”, New Journal of Phys. 14, 123011,© IOP Publishing Ltd and Deutsche Physikalische Gesellschaft (2012), pp. 1-28. [cited by applicant]
A. G. Fowler and C. Gidney, Low overhead quantum computation using lattice surgery, arXiv preprint arXiv:1808.06709, 2018, pp. 1-15. [cited by applicant]
D. Litinski and F. v. Oppen, “Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes”, Quantum vol. 2, arXiv:1709.02318v2 (2018), pp. 1-16. [cited by applicant]
D. Litinski, “A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery”, Quantum vol. 3, arXiv:1808.02892v3 [quant-ph] (2019), pp. 1-37. [cited by applicant]
D. Gottesman and I. L. Chuang, “Quantum teleportation is a universal computational primitive”, Nature 402, (1999), arXiv:quant-ph/9908010v1, pp. 1-6. [cited by applicant]
K. Zhou, D. W. Leung, and I. L. Chuang, “Methodology for quantum logic gate constructions”, Phys. Rev. A 62, 052316 (2000), arXiv:quant-ph/0002039, pp. 1-17. [cited by applicant]
S. Bravyi and A. Kitaev, “Universal quantum computation with ideal clifford gates and noisy ancillas”, Phys. Rev. A 71, 022316, CORE, (2005), 2005 The American Physical Society, pp. 1-14. [cited by applicant]
S. Bravyi and J. Haah, “Magic-state distillation with low overhead”, Phys. Rev. A 86, 052329 (2012) © 2012 American Physical Society, pp.-10. [cited by applicant]
A. M. Meier, B. Eastin, and E. Knill, “Magic-state distillation with the four-qubit code”, Quant. Inf. and Comp. 13, 195 (2013), arXiv:1204.4221 [quant-ph], pp. 1-10. [cited by applicant]
C. Jones, “Multilevel distillation of magic states for quantum computing”, Phys. Rev. A 87, 042305 (2013), arXiv:1210.3388 [quant-ph], pp. 1-10. [cited by applicant]
E. T. Campbell and M. Howard, “Magic state parity-checker with pre-distilled components”, Quantum 2, 56 (2018), arXiv:1709.02214v3 [quant-ph] , pp. 1-18. [cited by applicant]
C. Chamberland and A. W. Cross, “Fault-tolerant magic state preparation with flag qubits”, Quantum vv. 3, 143 (2019), arXiv:1811.00566v2 [quant-ph], pp. 1-26. [cited by applicant]
C. Chamberland and K. Noh, “Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits”, npj Quantum Information 6, 91 (2020), Published in partnership with The University … [cited by applicant]
H. Bombin and M. A. Martin-Delgado, “Topological quantum distillation”, Phys. Rev. Lett. V. 97, 180501 (2006), arXiv: quant-ph/0605138, pp. 1-4. [cited by applicant]
T. Jochym-O'Connor and R. Laflamme, “Using concatenated quantum codes for universal fault-tolerant quantum gates”, Phys. Rev. Lett. 112, 010505 (2014), arXiv:1309.3310 [quant-ph], pp. 1-5. [cited by applicant]
H. Bombin, “Dimensional jump in quantum error correction”, New Journal of Physics v. 18, 043038 (2016), IOP Institute of Physics, pp. 1-13. [cited by applicant]
T. J. Yoder, R. Takagi, and I. L. Chuang, “Universal fault-tolerant gates on concatenated stabilizer codes”, Phys. Rev. K 6, 031039, Published by the American Physical Society (2016), pp. 1-23. [cited by applicant]
C. Chamberland, T. Jochym-O'Connor, and R. Laflamme, “Thresholds for universal concatenated quantum codes”, Phys. Rev. Lett. 117, 010501 (2016), arXiv:1603.02704 [quant-ph], pp. 1-10. [cited by applicant]
C. Chamberland, T. Jochym-O'Connor, and R. Laflamme, Overhead analysis of universal concatenated quantum codes, Phys. Rev. A 95, 022313 (2017), arXiv:1609.07497v3 [quant-ph] , pp. 1-25. [cited by applicant]
M. E. Beverland, A. Kubica, and K. M. Svore, Cost of universality: A comparative study of the overhead of state distillation and code switching with color codes, PRX Quantum 2, 020341, (2021), Published by the American … [cited by applicant]
S. Bravyi, G. Smith, and J. A. Smolin, “Trading classical and quantum computational resources”, Phys. Rev. X 6, 021043, (2016), Published by the American Physical Society, pp. 1-14. [cited by applicant]
C. Jones, “Low-overhead constructions for the fault-tolerant Toffoli gate”, Phys. Rev. A 87, 022328 (2013), arXiv:1212.5069 [quant-ph], pp. 1-5. [cited by applicant]
B. Eastin, “Distilling one-qubit magic states into Toffoli states”, Phys. Rev. A 87, 032321 (2013), arXiv:1212.4872 [quant-ph] pp. 1-8. [cited by applicant]
C. Gidney and A. G. Fowler, “Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation”, Quantum 3, 135 (2019), arXiv:1812.01238v3 [quant-ph], pp. 1-24. [cited by applicant]
C. Chamberland, et al., Building a fault-tolerant quantum computer using concatenated cat codes, arXiv preprint arXiv:2012.04108 (2020), pp. 1-118. [cited by applicant]
E. T. Campbell and M. Howard, “Unified framework for magic state distillation and multiqubit gate synthesis with reduced resource cost”, Phys. Rev. A 95, 022316 (2017), arXiv:1606.01904 [quant-ph], pp. 1-23. [cited by applicant]
E. T. Campbell and M. Howard, “Unifying gate synthesis and magic state distillation”, Phys. Rev. Lett. 118, 060501 (2017), arXiv:1606.01906v2, pp. 1-5. [cited by applicant]
J. Haah and M. B. Hastings, “Codes and Protocols for Distilling T, controlled-S, and Toffoli Gates”, Quantum 2, 71 (2018), arXiv:1709.02832v3 pp. 1-29. [cited by applicant]
C. Gidney, “Halving the cost of quantum addition”, Quantum 2, 74 (2018), arXiv:1709.06648v3, pp. 1-6. [cited by applicant]
J. O'Gorman and E. T. Campbell, “Quantum computation with realistic magic-state factories”, Phys. Rev. A 95, 032338 (2017), Published by the American Physical Society, pp. 1-19. [cited by applicant]
E. Campbell, A. Khurana, and A. Montanaro, Applying quantum algorithms to constraint satisfaction problems, Quantum 3, 167 (2019), arXiv:1810.05582v2, pp. 1-30. [cited by applicant]
D. W. Berry, C. Gidney, M. Motta, J. R. McClean, and R. Babbush, “Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization”, Quantum 3, 208 (2019), arXiv:1902.02134v4, pp. 1-44. [cited by applicant]
D. Kivlichan, et al., “Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization”, Quantum 4, 296 (2020), arXiv:1902.10673v4, pp. 1-45. [cited by applicant]
J. Lee, D. W. Berry, C. Gidney, W. J. Huggins, J. R. McClean, N. Wiebe, and R. Babbush, “Even more efficient quantum computations of chemistry through tensor hypercontraction”, PRX Quantum 2, 030305 (2021), Published by… [cited by applicant]
Y. Tomita and K. M. Svore, “Low-distance surface codes under realistic quantum noise”, Phys. Rev. A 90, 062320 (2014), arXiv:1404.3747 [quant-ph], pp. 1-15. [cited by applicant]
C. Vuillot, L. Lao, B. Criger, C. G. Almud'ever, K. Bertels, and B. M. Terhal, “Code deformation and lattice surgery are gauge fixing”, New Journal of Phys. 21, 033028 (2019), pp. 1-21. [cited by applicant]
J. Edmonds, “Paths, trees, and flowers”, Canadian Journal of mathematics 17, 449 (1965), pp. 449-467. [cited by applicant]
C. Chamberland, G. Zhu, T. J. Yoder, J. B. Hertzberg, and A. W. Cross, “Topological and subsystem codes on low-degree graphs with flag qubits”, Phys. Rev. X 10, 011022 (2020), Published by the American Physical Society … [cited by applicant]
C. Chamberland, A. Kubica, T. J. Yoder, and G. Zhu, “Triangular color codes on trivalent graphs with flag qubits”, New Journal of Physics 22, 023019 (2020), IOP Publishing, pp. 1-24. [cited by applicant]
C. Chamberland, A. Kubica, T. J. Yoder, and G. Zhu, Triangular color codes on trivalent graphs with flag qubits, New Journal of Physics 22, 023019 (2020), arXiv:1004.1838 [cond-mat.str-el], pp. 1-5. [cited by applicant]
T. J. Yoder and I. H. Kim, The surface code with a twist:, Quantum vol. 1, p. 2 (2017), arXiv:1612.04795v2, pp. 1-19. [cited by applicant]
R. Chao and B. W. Reichardt, “Quantum error correction with only two extra qubits”, Phys. Rev. Lett. 121, 050502 (2018), arXiv:1705.02329 [quant-ph] pp. 1-9. [cited by applicant]
R. Chao and B.W. Reichardt, “Fault-tolerant quantum computation with few qubits”, npj Quantum Information 4, 2056 (2018), nature.com, pp. 1-8. [cited by applicant]
C. Chamberland and M. E. Beverland, “Flag fault-tolerant error correction with arbitrary distance codes”, Quantum 2, 53 (2018), arXiv:1708.02246v3 [quant-ph] pp. 1-29. [cited by applicant]
Y. Shi, C. Chamberland, and A. Cross, “Fault-tolerant preparation of approximate GKP states”, New J. Phys. 21, 093007, (2019), pp. 1-26. [cited by applicant]
T. Tansuwannont, C. Chamberland, and D. Leung, “Flag faulttolerant error correction, measurement, and quantum computation for cyclic calderbank-shor-steane codes”, Phys. Rev. A 101, 012342 (2020),arXiv:1803.09758 [quant… [cited by applicant]
R. Chao and B.W. Reichardt, “Flag fault-tolerant error correction for any stabilizer code”, PRX Quantum 1, 010302 (2020), Published by the American Physical Society, pp. 1-6. [cited by applicant]
B. W. Reichardt, “Fault-tolerant quantum error correction for Steane's seven-qubit color code with few or no extra qubits,” mQuantum Sci. Technol. 6, 015007 (2020), arXiv:1804.06995 [quant-ph], pp. 1-11. [cited by applicant]
T. Tansuwannont and D. Leung, “Achieving fault tolerance on capped color codes with few ancillas”, arXiv e-prints, arXiv:2106.02649 (2021), arXiv:2106.02649, pp. 1-39. [cited by applicant]
A. G. Fowler, “Time-optimal quantum computation”, arXiv preprint arXiv:1509.03239 (2012), pp. 1-5. [cited by applicant]
I. H. Kim, E. Lee, Y.-H. Liu, S. Pallister, W. Pol, and S. Roberts, “Fault-tolerant resource estimate for quantum chemical simulations: Case study on li-ion battery electrolyte molecules”, arXiv preprint arXiv:2104.1065… [cited by applicant]
S. Puri, L. St-Jean, J. A. Gross, A. Grimm, N. E. Frattini, P. S. Iyer, A. Krishna, S. Touzard, L. Jiang, A. Blais, et al., “Biaspreserving gates with stabilized cat qubits”, Science advances vol. 6, issued 34, DOI: 10.… [cited by applicant]
E. T. Campbell, A theory of single-shot error correction for adversarial noise, Quantum Science and Technology 4, 025006, © 2019 IOP Publishing Ltd., arXiv:1805.09271 [quant-ph], pp. 1-30. [cited by applicant]
A. O. Quintavalle, M. Vasmer, J. Roffe, and E. T. Campbell, “Single-shot error correction of three-dimensional homological product codes”, PRX Quantum 2, 020340 (2021), Published by the American Physical Society, pp. 1-… [cited by applicant]
D. K. Tuckett, S. D. Bartlett, S. T. Flammia, and B. J. Brown, “Fault-tolerant thresholds for the surface code in excess of 5% under biased noise”, Phys. Rev. Lett. 124, 130501 (2020), arXiv:1907.02554 [quant-ph], pp. 1… [cited by applicant]
A. Ashikhmin, C.-Y. Lai, and T. A. Brun, “Quantum Data-Syndrome Codes”, IEEE Journal on Selected Areas in Communications 38, 449 (2020), arXiv:1907.01393, pp. 1-18. [cited by applicant]
D. K. Tuckett, A. S. Darmawan, C. T. Chubb, S. Bravyi, S. D. Bartlett, and S. T. Flammia, “Tailoring surface codes for highly biased noise”, Phys. Rev. X 9, 041031 (2019), Published by the American Physical Society, pp.… [cited by applicant]
J. P. Bonilla Ataides, D. K. Tuckett, S. D. Bartlett, S. T. Flammia, and B. J. Brown, “The XZZX surface code”, Nature Communications 12, Article 2172 (2021), pp. 1-12. [cited by applicant]
A. S. Darmawan, B. J. Brown, A. L. Grimsmo, D. K. Tuckett, and S. Puri, “Practical quantum error correction with the XZZX code and Kerr-cat qubits”, arXiv e-prints (2021), 2104.09539 [quant-ph], pp. 1-21. [cited by applicant]
D. Higgott and N. P. Breuckmann, “Subsystem codes with high thresholds by gauge fixing and reduced qubit overhead”, Phys. Rev. X 11, 031039 (2021), Published by the American Physical Society, pp. 1-30. [cited by applicant]
N. P. Breuckmann, C. Vuillot, E. Campbell, A. Krishna, and B. M. Terhal, “Hyperbolic and semi-hyperbolic surface codes for quantum storage”, Quantum Science and Technology vol. 2, No. 3, 035007 (2017), arXiv:1703.00590 … [cited by applicant]
J. Conrad, C. Chamberland, N. P. Breuckmann, and B. M. Terhal, “The small stellated dodecahedron code and friends”, Philiosophical Transaction A. Soc. A. 376, Mar. 23, 2017 (2018), https://doi.org/10.1098/rsta.2017.0323… [cited by applicant]
E. T. Campbell, Early fault-tolerant simulations of the Hubbard model, arXiv , 2012.09238 (2020), arXiv:2012.09238 [quant-ph], pp. 1-15. [cited by applicant]
D. Litinski, Magic State Distillation: “Not as Costly as You Think”, Quantum, vol. 3, p. 205 (2019), arXiv:1905.06903v3 [quant-ph], pp. 1-22. [cited by applicant]
U.S. Appl. No. 17/545,895, filed Dec. 8, 2021, Christopher Chamberland, et al. [cited by applicant]
U.S. Appl. No. 17/545,906, filed Dec. 8, 2021, Christopher Chamberland, et al. [cited by applicant]
U.S. Appl. No. 17/545,914, filed Dec. 8, 2021, Christopher Chamberland, et al. [cited by applicant]
Hendrik Poulsen Natrup et al., “Fault-tolerant interface between quantum memories and quantum processors,” Nature Communications, 8(1), 2017, pp. 1 to 9. [cited by applicant]
Alexandru Paler, et al., “OpenSurgery for Topological Assemblies,” 2020 IEEE Globecom Workshops, IEEE, Dec. 7, 2020, pp. 1 to 4. [cited by applicant]
Daryus Chandra, et al., “Quantum topological error correction codes are capable of improving the performance of Clifford gates,” IEEE Access 7, 2019, pp. 121501 to 121529. [cited by applicant]
Casey Duckering, et al., “Virtualized logical qubits: A 2.5D architecture for error-corrected quantum computing,” 53rd Annual IEEE/ACM International Symposium on Microarchitecture (MICRO), Oct. 2020, pp. 173 to 185. [cited by applicant]