US 7028275B1
· Chen
· 2006
[cited by examiner]
US 7277872B2
· Raussendorf et al.
· 2007
[cited by applicant]
US 7554080B2
· Munro et al.
· 2009
[cited by applicant]
US 9178154B2
· Bunyk
· 2015
[cited by applicant]
US 9509428B2
· Boertjes
· 2016
[cited by examiner]
US 9735776B1
· Abdo et al.
· 2017
[cited by applicant]
US 9858531B1
· Monroe et al.
· 2018
[cited by applicant]
US 9944520B2
· Ashikhmin
· 2018
[cited by applicant]
US 20090070402A1
· Rose
· 2009
[cited by examiner]
US 20180046933A1
· La Cour et al.
· 2018
[cited by applicant]
US 20230042201A1
· Raussendorf et al.
· 2023
[cited by applicant]
US 20230237359A1
· Rogers et al.
· 2023
[cited by applicant]
US 20240275495A1
· Qiang et al.
· 2024
[cited by applicant]
EP 3109803B1
· 2020
[cited by applicant]
JP 2012531874A
· 2012
[cited by applicant]
JP 2016504002A
· 2016
[cited by applicant]
JP 2018538680A
· 2018
[cited by applicant]
JP 2022537399A
· 2022
[cited by applicant]
WO 2019178009A1
· 2019
[cited by applicant]
WO 2019183602A1
· 2019
[cited by applicant]
WO 2020033588A1
· 2020
[cited by applicant]
WO 2020056324A1
· 2020
[cited by applicant]
WO 2020257772A1
· 2020
[cited by applicant]
WO 2022159847A1
· 2022
[cited by applicant]
WO 2022241336A2
· 2022
[cited by applicant]
Mercedes Gimeno, Relative multiplexing for minimising switching in linear-optical quantum computing, New J. Phys. 19 (2017) 063013, Published Jun. 6, 2017). (Year: 2017).
[cited by examiner]
Delfosse, “Hierarchical Decoding to Reduce Hardware Requirements for Quantum Computingg”, Available Online at: https://arxiv.org/pdf/2001.11427.pdf, Jan. 30, 2020, pp. 1-8.
[cited by applicant]
Fujisaki, et al., “A Practical and Scalable Decoder for Topological Quantum Error Correction with Digital Annealer”, Available Online at: https://arxiv.org/pdf/2203.15304.pdf, Sep. 9, 2022, pp. 1-12.
[cited by applicant]
Preskill, “Quantum Computing in the NISQ Era and Beyond”, Quantum Journal, vol. 2, No. 79, Jul. 2018, pp. 1-20.
[cited by applicant]
Spitz, et al., “Adaptive Weight Estimator for Quantum Error Correction in a Time-dependent Environment”, Advanced Quantum Technologies, vol. 1, No. 1, 180012, Jul. 30, 2018, p. 1-8.
[cited by applicant]
U.S. Appl. No. 18/108,550, Notice of Allowance, Mailed on May 29, 2024, 8 pages.
[cited by applicant]
U.S. Appl. No. 18/108,552, Non-Final Office Action, Mailed on Jul. 18, 2024, 7 pages.
[cited by applicant]
U.S. Appl. No. 18/108,552 , Notice of Allowance, Mailed on Nov. 15, 2024, 8 pages.
[cited by applicant]
U.S. Appl. No. 18/108,556, Non-Final Office Action, Mailed on Sep. 6, 2024, 22 pages.
[cited by applicant]
U.S. Appl. No. 18/108,561, Notice of Allowance, Mailed on Jul. 31, 2024, 9 pages.
[cited by applicant]
Adcock et al., “Programmable Four-Photon Graph States on a Silicon Chip”, Nature Communications, vol. 10, No. 3528, Aug. 6, 2019, 6 pages.
[cited by applicant]
Bartolucci et al., “Creation of Entangled Photonic States Using Linear Optics”, Available online at: https://arxiv.org/abs/ 2106.13825, Jun. 25, 2021, 18 pages.
[cited by applicant]
Bartolucci et al., “Switch Networks for Photonic Fusion-Based Quantum Computing”, Quantum Physics, Available online at: https://arxiv.org/abs/2109.13760, Sep. 28, 2021, 31 pages.
[cited by applicant]
Application No. EP22808495.0 , Extended European Search Report, Mailed on Nov. 15, 2024, 19 pages.
[cited by applicant]
Application No. JP2021-575967, Notice of Allowance, Mailed on Aug. 30, 2024, 3 pages.
[cited by applicant]
Application No. PCT/US2023/012848, International Search Report and Written Opinion, Mailed on Sep. 30, 2024, 15 pages.
[cited by applicant]
PCT/US2023/012848, “Invitation to Pay Additional Fees and, Where Applicable, Protest Fee”, Aug. 5, 2024, 3 pages.
[cited by applicant]
U.S. Appl. No. 17/163,219 , Final Office Action, Mailed On Apr. 20, 2023, 14 pages.
[cited by applicant]
U.S. Appl. No. 17/808,979 , Non-Final Office Action, Mailed On Sep. 23, 2022, 17 pages.
[cited by applicant]
U.S. Appl. No. 17/808,979 , Notice of Allowance, Mailed On Jan. 30, 2024, 8 pages.
[cited by applicant]
U.S. Appl. No. 18/120,328 , Non- Final Office Action, Mailed On Aug. 2, 2023, 7 pages.
[cited by applicant]
U.S. Appl. No. 18/120,328 , Notice of Allowance, Mailed On Sep. 1, 2023, 7 pages.
[cited by applicant]
Ball, “First 100-Qubit Quantum Computer Enters Crowded Race”, Nature, vol. 599, Nov. 19, 2021, p. 542.
[cited by applicant]
Bombin et al., “Interleaving: Modular Architectures for Fault-Tolerant Photonic Quantum Computing”, Available Online at https://arxiv.org/pdf/2103.08612.pdf, Mar. 15, 2021, 22 pages.
[cited by applicant]
Bombin et al., “Logical Blocks for Fault-Tolerant Topological Quantum Computation”, PRX Quantum, vol. 4, No. 2, Dec. 22, 2021, 39 pages.
[cited by applicant]
Coecke et al., “Interacting Quantum Observables: Categorical Algebra and Diagrammatics”, Oxford University, Apr. 21, 2011, 80 pages.
[cited by applicant]
Application No. EP20826691.6 , Extended European Search Report, Mailed On Jun. 9, 2023, 11 pages.
[cited by applicant]
Application No. EP20826691.6 , Office Action, Mailed On Apr. 24, 2024, 5 pages.
[cited by applicant]
Fowler et al., “Surface Codes: Towards Practical Large-Scale Quantum Computation”, Physical Review A, vol. 86, No. 3, Oct. 27, 2012, 54 pages.
[cited by applicant]
Litinski, “Magic State Distillation: Not as Costly as You Think”, Nov. 6, 2019, 22 pages.
[cited by applicant]
Nielsen et al., “Quantum Computation and Quantum Information”, Cambridge University Press, Available online at: www.cambridge.org/9781107002173, 2010, 6 pages.
[cited by applicant]
PsiQuantum, Corp., PsiQuantum, Webpage from 4/20 Disclosing Cornell University Paper, 8 pages.
[cited by applicant]
Aharonov et al., “Fault-Tolerant Quantum Computation with Constant Error Rate”, SIAM Journal on Computing, vol. 38, No. 4, 2008, pp. 1207-1282.
[cited by applicant]
Auger et al., “Fault-Tolerant Quantum Computation with Non-Deterministic Entangling Gates”, Physical Review A, vol. 97, Mar. 16, 2018, pp. 1-5.
[cited by applicant]
Barkeshli et al., “Modular Transformations Through Sequences of Topological Charge Projections”, Physical Review B, vol. 94, Jan. 19, 2017, pp. 1-21.
[cited by applicant]
Barrett et al., “Fault Tolerant Quantum Computation with Very High Threshold for Loss Errors”, Physical Review Letters, vol. 105, No. 20, Nov. 15, 2010, pp. 1-4.
[cited by applicant]
Bartolucci et al., “Fusion-Based Quantum Computation”, Available Online at: https://arxiv.org/pdf/2101.09310.pdf, Jan. 22, 2021, pp. 1-25.
[cited by applicant]
Blais et al., “Circuit Quantum Electrodynamics”, Reviews of Modern Physics, vol. 93, May 19, 2021, pp. 1-82.
[cited by applicant]
Bolt et al., “Foliated Quantum Error-Correcting Codes”, Physical Review Letters, vol. 117, Aug. 12, 2016, pp. 070501-1-070501-6.
[cited by applicant]
Bombin et al., “Quantum Measurements and Gates by Code Deformation”, Journal of Physics A Mathematical and Theoretical, vol. 42, No. 9, May 2007, pp. 1-19.
[cited by applicant]
Bombin, “Single-Shot Fault-Tolerant Quantum Error Correction”, Physical Review X, vol. 5, Sep. 28, 2015, pp. 031043-1-031043-26.
[cited by applicant]
Bombin, “Topological Order with a Twist: Ising Anyons from an Abelian Model”, Physical Review Letters, vol. 105, Jul. 14, 2010, pp. 1-5.
[cited by applicant]
Bourassa et al., “Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer”, Quantum, vol. 5, Feb. 2, 2021, pp. 1-38.
[cited by applicant]
Braunstein, “Quantum Information with Continuous Variables”, Reviews of Modern Physics, vol. 77, No. 2, Apr.-Jun. 2005, pp. 1-65.
[cited by applicant]
Braunstein, “Teleportation of Continuous Quantum Variables”, Physical Review Letters, vol. 80, No. 4, Jan. 26, 1998, pp. 869-872.
[cited by applicant]
Bravyi et al., “Quantum Codes on a Lattice with Boundary”, Available Online at: https://arxiv.org/pdf/quant-ph/9811052.pdf, Nov. 20, 1998, pp. 1-6.
[cited by applicant]
Briegel et al., “Measurement-Based Quantum Computation”, Nature Physics, vol. 5, Oct. 9, 2009, pp. 1-20.
[cited by applicant]
Brown et al., “Universal Fault-Tolerant Measurement-Based Quantum Computation”, Physical Review Research, vol. 2, Aug. 25, 2020, pp. 1-30.
[cited by applicant]
Browne et al., “Resource-Efficient Linear Optical Quantum Computation”, Physical Review Letters, vol. 95, No. 1, Feb. 9, 2005, pp. 1-5.
[cited by applicant]
Bruzewicz et al., “Trapped-lon Quantum Computing: Progress and Challenges”, Applied Physics Reviews, vol. 6, No. 2, Apr. 8, 2019, pp. 1-56.
[cited by applicant]
Castellanos, “PsiQuantum Raises $450 Million to Build Its Quantum Computer”, The Wall Street Journal, Jul. 27, 2021, 4 pages.
[cited by applicant]
Chamberland et al., “Fault-Tolerant Quantum Computing in the Pauli or Clifford Frame with Slow Error Diagnostics”, Quantum, vol. 2, Dec. 25, 2017, pp. 1-11.
[cited by applicant]
Chao et al., “Optimization of the Surface Code Design for Majorana-Based Qubits”, Quantum, vol. 4, Oct. 24, 2020, pp. 1-19.
[cited by applicant]
Cirac et al., “Quantum Computations with Cold Trapped lons”, Physical Review Letters, vol. 74, No. 20, May 15, 1995, pp. 4091-4094.
[cited by applicant]
Das et al., “A Scalable Decoder Micro-Architecture for Fault-Tolerant Quantum Computing”, Available Online at: https://arxiv.org/pdf/2001.06598.pdf, Jan. 18, 2020, pp. 1-19.
[cited by applicant]
Dawson et al., “Noise Thresholds for Optical Quantum Computers”, Physical Review Letters, vol. 96, Jan. 17, 2006, pp. 1-5.
[cited by applicant]
Delfosse et al., “Almost-Linear Time Decoding Algorithm for Topological Codes”, Available Online at: https://arxiv.org/pdf/1709.06218.pdf, Sep. 19, 2017, pp. 1-10.
[cited by applicant]
Dennis et al., “Topological Quantum Memory”, Journal of Mathematical Physics, vol. 43, No. 9, Oct. 24, 2001, pp. 1-39.
[cited by applicant]
Dyakonov , “The Case Against Quantum Computing”, Institute of Electrical and Electronics Engineers Spectrum, Nov. 15, 2018, pp. 1-14.
[cited by applicant]
Edmonds, “Paths, Trees, and Flowers”, National Bureau of Standards and Princeton University, 1965, pp. 449-467.
[cited by applicant]
Ewert et al., “3/4-Efficient Bell Measurement with Passive Linear Optics and Unentangled Ancillae”, Physical Review Letters, vol. 113, No. 14, Sep. 30, 2014, pp. 1-8.
[cited by applicant]
Gimeno-Segovia et al., “From Three-Photon GHZ States to Universal Ballistic Quantum Computation”, Physical Review Letters, vol. 115, Feb. 26, 2015, pp. 1-9.
[cited by applicant]
Glancy et al., “Error Analysis for Encoding a Qubit in an Oscillator”, Physical Review A, vol. 73, No. 1, Jan. 2006, pp. 1-5.
[cited by applicant]
Gottesman, “A Class of Quantum Error-Correcting Codes Saturating the Quantum Hamming Bound”, Physical Review A, vol. 54, Sep. 1, 1996, pp. 1-22.
[cited by applicant]
Gottesman et al., “Encoding a Qubit in an Oscillator”, Physical Review A, vol. 64, No. 1, May 13, 2001, pp. 1-22.
[cited by applicant]
Gottesman, “Fault-Tolerant Quantum Computation with Constant Overhead”, Quantum Information & Computation, vol. 14, Nos. 15-16, Nov. 2014, pp. 1-33.
[cited by applicant]
Gottesman et al., “Quantum Teleportation Is a Universal Computational Primitive”, Nature, vol. 402, Aug. 2, 1999, pp. 1-6.
[cited by applicant]
Grice, “Arbitrarily Complete Bell-State Measurement Using Only Linear Optical Elements”, Physical Review A, vol. 84, No. 4, Oct. 2011, pp. 1-6.
[cited by applicant]
Grumbling et al., “Quantum Computing: Progress and Prospects”, The National Academies of Sciences, Engineering, and Medicine, 2019, pp. 156-192.
[cited by applicant]
Hein et al., “Multiparty Entanglement in Graph States”, Physical Review A, vol. 69, Jun. 9, 2004, pp. 062311-1-062311-20.
[cited by applicant]
Herr et al., “A Local and Scalable Lattice Renormalization Method for Ballistic Quantum Computation”, NPJ Quantum Information, vol. 4, No. 27, Jun. 21, 2018, pp. 1-8.
[cited by applicant]
Herrera-Marti et al., “A Photonic Implementation for the Topological Cluster State Quantum Computer”, Physical Review A, vol. 82, No. 3, May 17, 2010, pp. 1-7.
[cited by applicant]
Horgan, “Will Quantum Computing Ever Live Up to Its Hype?”, Scientific American, Apr. 20, 2021, 10 pages.
[cited by applicant]
Horsman et al., “Surface Code Quantum Computing by Lattice Surgery”, New Journal of Physics, vol. 14, Dec. 7, 2012, pp. 1-27.
[cited by applicant]
Huo et al., “Learning Time-Dependent Noise To Reduce Logical Errors: Real Time Error Rate Estimation In Quantum Error Correction”, New Journal of Physics. vol. 19, No. 12, Dec. 13, 2017, 11 pages.
[cited by applicant]
Kane, “A Silicon-Based Nuclear Spin Quantum Computer”, Nature, vol. 393, 1998, pp. 133-137.
[cited by applicant]
Kastoryano et al., “Dissipative Preparation of Entanglement in Optical Cavities”, Physical Review Letters, vol. 106, Feb. 28, 2011, pp. 1-4.
[cited by applicant]
Kieling et al., “Percolation, Renormalization, and Quantum Computing with Non-Deterministic Gates”, Physical Review Letters, vol. 99, No. 13, Jul. 20, 2007, pp. 1-5.
[cited by applicant]
Naergaard et al., “Superconducting Qubits: Current State of Play”, Annual Reviews of Condensed Matter Physics, vol. 11, Apr. 21, 2020, pp. 1-30.
[cited by applicant]
Knill et al., “Efficient Linear Optics Quantum Computation”, Available Online at https://arxiv.org/pdf/quant-ph/0006088.pdf, Jun. 20, 2000, pp. 1-8.
[cited by applicant]
Knill , “Fault-Tolerant Postselected Quantum Computation: Threshold Analysis”, Available Online at https://arxiv.org/pdf/quant-ph/0404104.pdf, Apr. 19, 2004, pp. 1-21.
[cited by applicant]
Koch et al., “Charge Insensitive Qubit Design Derived From the Cooper Pair Box”, Physical Review A, vol. 76, Oct. 12, 2007, pp. 1-21.
[cited by applicant]
Kolmogorov , “Blossom V: A New Implementation of A Minimum Cost Perfect Matching Algorithm”, Mathematical Programming Computation, vol. 1, No. 1, Apr. 21, 2009, pp. 1-15.
[cited by applicant]
Krauter et al., “Entanglement Generated by Dissipation”, International Conference on Quantum Information, Jun. 22, 2010, pp. 1-9.
[cited by applicant]
Leung , “Quantum Computation by Measurements”, International Journal of Quantum Information, vol. 2, No. 1, Feb. 27, 2004, pp. 1-10.
[cited by applicant]
Li et al., “Resource Costs for Fault-Tolerant Linear Optical Quantum Computing”, Physical Review X, vol. 5, No. 4, Apr. 22, 2015, pp. 1-13.
[cited by applicant]
Litinski , “A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery”, Quantum, vol. 3, Mar. 5, 2019, pp. 1-37.
[cited by applicant]
Loss et al., “Quantum Computation with Quantum Dots”, Physical Review A, vol. 57, Jan. 1, 1998, pp. 1-20.
[cited by applicant]
Molmer et al., “Multi-Particle Entanglement of Hot Trapped lons”, Physical Review Letters, vol. 82, No. 9, Mar. 1, 1999, pp. 1-4.
[cited by applicant]
Nayak et al., “Non-Abelian Anyons and Topological Quantum Computation”, Reviews of Modern Physics, vol. 80, No. 3, Jul.-Sep. 2008, pp. 1-73.
[cited by applicant]
Newman et al., “Generating Fault-Tolerant Cluster States from Crystal Structures”, Quantum, vol. 4, Jul. 13, 2020, pp. 1-37.
[cited by applicant]
Nickerson et al., “Measurement Based Fault Tolerance Beyond Foliation”, PsiQuantum, Oct. 23, 2018, pp. 1-16.
[cited by applicant]
Nielsen, “Optical Quantum Computation Using Cluster States”, Physical Review Letters, vol. 93, No. 4, Jul. 23, 2004, pp. 1-4.
[cited by applicant]
Nielsen, “Universal Quantum Computation Using Only Projective Measurement, Quantum Memory, and Preparation of the |0> State”, Physics Letters A, vol. 308, Nos. 2-3, 2003, pp. 1-4.
[cited by applicant]
Pant et al., “Percolation Thresholds for Photonic Quantum Computing”, Nature Communications, vol. 10, 2019, pp. 1-12.
[cited by applicant]
Politi et al., “Integrated Quantum Photonics”, IEEE Journal of Selected Topics in Quantum Electronics, vol. 15, No. 6, 2009, pp. 1673-1684.
[cited by applicant]
Raussendorf et al., “A Fault-Tolerant One-Way Quantum Computer”, Annals of Physics, vol. 321, No. 9i, Sep. 2006, pp. 1-26.
[cited by applicant]
Raussendorf et al., “Computational Model Underlying the One-Way Quantum Computer”, Quantum Information & Computation, vol. 2, No. 6, Oct. 2002, pp. 1-37.
[cited by applicant]
Riesebos et al., “Pauli Frames for Quantum Computer Architectures”, Proceedings of the 54th Annual Design Automation Conference, 2017, 6 pages.
[cited by applicant]
Shor, “Scheme for Reducing Decoherence in Quantum Computer Memory”, Physical Review A, Third Series, vol. 52, No. 4, Oct. 1995, pp. R2493-R2496.
[cited by applicant]
Tillich et al., “Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to n 1/2”, ISIT'09: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory, vol. 60, No. 2, Jun.…
[cited by applicant]
Vasmer et al., “Cellular Automaton Decoders for Topological Quantum Codes with Noisy Measurements and Beyond”, Scientific Reports, Nature Research, Available Online At: https://www.nature.com/articles/s41598-021-81138-2…
[cited by applicant]
Verstraete et al., “Quantum Computation, Quantum State Engineering, and Quantum Phase Transitions Driven by Dissipation”, Nature Physics, vol. 5, Mar. 12, 2008, pp. 1-7.
[cited by applicant]
Verstraete et al., “Renormalization Algorithms for Quantum-Many Body Systems in Two and Higher Dimensions”, Available Online at https://arxiv.org/pdf/cond-mat/0407066.pdf, Jul. 2, 2004, pp. 1-5.
[cited by applicant]
Webster et al., “Fault-Tolerant Quantum Gates with Defects in Topological Stabilizer Codes”, Physical Review A, vol. 102, Aug. 6, 2020, pp. 1-28.
[cited by applicant]
Gimeno-Segovia, et al., “Relative Multiplexing for Minimising Switching in Linear-Optical Quantum Computing”, New Journal of Physics, vol. 19, Available Online at: https://iopscience.iop.org/article/10.1088/1367-2630/aa…
[cited by applicant]
PCT/US2020/038962, “International Preliminary Report on Patentability”, Dec. 30, 2021, 9 pages.
[cited by applicant]
PCT/US2020/038962, “International Search Report and Written Opinion”, Oct. 13, 2020, 12 pages.
[cited by applicant]
PCT/US2020/038962, “Invitation to Pay Additional Fees and, Where Applicable, Protest Fee”, Aug. 3, 2020, 2 pages.
[cited by applicant]
U.S. Appl. No. 17/808,979 , Notice of Allowance, Mailed On May 9, 2024, 10 pages.
[cited by applicant]
Gimeno-Segovia, et al., “Relative Multiplexing for Minimizing Switching in Linear-optical Quantum Computing”, Available on arxiv.org, Cornell University, vol. 19, Jun. 9, 2017, pp. 1-13.
[cited by applicant]
PCT/US2022/070447, “International Search Report and Written Opinion”, Nov. 25, 2022, 7 pages.
[cited by applicant]
EP20826691.6, “Intention to Grant”, Apr. 7, 2025, 8 pages.
[cited by applicant]
U.S. Appl. No. 18/108,556, Notice of Allowance, Mailed on Jan. 13, 2025, 16 pages.
[cited by applicant]
U.S. Appl. No. 18/504,059, Non-Final Office Action, Mailed on Jan. 30, 2025, 10 pages.
[cited by applicant]
U.S. Appl. No. 18/504,059 , Notice of Allowance, Mailed On Jul. 15, 2025, 8 pages.
[cited by applicant]
AU2023414161 , “First Examination Report”, Jul. 25, 2025, 3 pages.
[cited by applicant]
Application No. CA3, 143,227 , Office Action, Mailed On Jul. 3, 2025, 6 pages.
[cited by applicant]
Application No. JP2023-545900 , Notice of Allowance, Mailed On Sep. 9, 2025, 3 pages.
[cited by applicant]
Application No. JP2024-170088 , Office Action, Mailed On Aug. 26, 2025, 5 pages.
[cited by applicant]