Interleaving module for fault-tolerant quantum computer

Abstract

To provide a quantum system, device and method for realizing reliable formation and entanglement of quantum bits.SOLUTION: In fusion-based quantum computing methods, each interleave module 2200 includes a set of reconfigurable fusion circuits that receive or generate resource states consisting of entangled physical qubits and perform fusion operations or single qubit measurements on pairs of qubits from different resource states, routing paths connected to the reconfigurable fusion circuits, and delay lines 2214 and routing switches 2216 that select routing paths in the qubits of the resource states to implement a desired combination of fusion operations and single qubit measurements. The routing paths include local routing paths that couple to the reconfigurable coalescing circuitry 2212 and network routing paths that couple the routing switches to reconfigurable coalescing circuitry in different interleaving modules in the network.SELECTED DRAWING: Figure 22

Description

[Background technology]

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS This application claims the benefit of U.S. Provisional Application No. 63 / 143,727, filed January 29, 2021, the disclosure of which is incorporated herein by reference.

[0002] Quantum computing is distinguished from "classical" computing by its reliance on structures called "qubits." At the most general level, a qubit can exist in two orthogonal states (in traditional bra / ket notation)

number

number

[0003]

[0003] However, the practical realization of quantum computers remains a difficult challenge, one being the reliable formation and entanglement of qubits. Summary of the Invention

[0004] According to some embodiments, fusion-based quantum computing can be implemented using a network (also called a network array) of interleave modules. Each interleave module can receive or generate resource states consisting of entangled physical qubits and can include a set of reconfigurable fusion circuits that can be controlled to perform either a fusion operation or a single-qubit measurement on pairs of qubits from different resource states, routing paths connected to the reconfigurable fusion circuits, and delay lines and routing switches operative to select routing paths for qubits in the resource states to thereby implement a desired combination of fusion operations and single-qubit measurements. The routing paths can include local routing paths that couple to reconfigurable fusion circuits in the same interleave module and network routing paths that couple routing switches in one interleave module to reconfigurable fusion circuits in different interleave modules in the network.

[0005] The following detailed description, taken in conjunction with the accompanying drawings, provides a better understanding of the nature and advantages of the invention as set forth in the claims. [Brief explanation of the drawings]

[0006] [Figure 1] 1 shows two representations of a portion of a pair of waveguides corresponding to a dual-rail encoded photonic qubit. [Figure 2A] 1 shows a schematic diagram for coupling two modes. [Figure 2B] 1 illustrates a schematic representation of a physical implementation of mode coupling in a photonic system that may be used in some embodiments. [Figure 3A] 1 illustrates a schematic example of a physical implementation of a Mach-Zehnder Interferometer (MZI) configuration that may be used in some embodiments. [Figure 3B] 1 illustrates a schematic example of a physical implementation of a Mach-Zehnder Interferometer (MZI) configuration that may be used in some embodiments. [Figure 4A]1 shows another schematic diagram for coupling two modes. [Figure 4B] 4B illustrates a schematic diagram of a physical implementation of the mode coupling of FIG. 4A in a photonic system that may be used in some embodiments. [Figure 5] 1 illustrates a four-mode coupling scheme that implements a "spreader" or "mode information erasure" transformation for the four modes according to some embodiments. [Figure 6] 6 illustrates an example of an optical device capable of implementing the four-mode diffusive conversion shown schematically in FIG. 5 according to some embodiments. [Figure 7] FIG. 1 shows a circuit diagram for a dual-rail coded Bell state generator that may be used in some embodiments. [Figure 8A] 1 illustrates a circuit diagram for a dual-rail encoded Type I fused gate that may be used in some embodiments. [Figure 8B] 8B shows an example of the results of a Type I fusion operation using the gates of FIG. 8A. [Figure 9A] 1 illustrates a circuit diagram for a dual-rail encoded type-II fused gate that may be used in some embodiments. [Figure 9B] 9B shows an example of the result of a Type II fusion operation using the gates of FIG. 9A. [Figure 10] 1 illustrates an example of a quantum entanglement system according to some embodiments. [Figure 11] 1 illustrates an example of a resource state that may be used in some embodiments. [Figure 12A] 1 illustrates an example of a fusion graph that may be used in some embodiments. [Figure 12B] We show examples of how a fused graph (shown in FIG. 12D) can be generated from the surface code space-time diagram (shown in FIG. 12B) and the time slice diagram (shown in FIG. 12C) for various logical operations on logical qubits. [Figure 12C]We show examples of how a fused graph (shown in FIG. 12D) can be generated from the surface code space-time diagram (shown in FIG. 12B) and the time slice diagram (shown in FIG. 12C) for various logical operations on logical qubits. [Figure 12D] We show examples of how a fused graph (shown in FIG. 12D) can be generated from the surface code space-time diagram (shown in FIG. 12B) and the time slice diagram (shown in FIG. 12C) for various logical operations on logical qubits. [Figure 12E] A legend for the fusion graph notation used in Figure 12D is shown. [Figure 13A] FIG. 1 shows a diagram of a fused graph representing a computation on four logical qubits according to some embodiments. [Figure 13B] FIG. 1 shows a diagram of a fused graph representing a computation on four logical qubits according to some embodiments. [Figure 13C] FIG. 1 shows a diagram of a fused graph representing a computation on four logical qubits according to some embodiments. [Figure 14A] 1 illustrates a simplified schematic diagram of circuit components in an interleaving module including a reconfigurable fused circuit according to some embodiments. [Figure 14B] 1 illustrates a simplified schematic diagram of circuit components in an interleaving module including a reconfigurable fused circuit according to some embodiments. [Figure 14C] 1 illustrates a simplified schematic diagram of circuit components in an interleaving module including a reconfigurable fused circuit according to some embodiments. [Figure 14D] 1 illustrates a simplified schematic diagram of circuit components in an interleaving module including a reconfigurable fused circuit according to some embodiments. [Figure 15] FIG. 1 shows a simplified schematic diagram of a network of unit cells according to some embodiments. [Figure 16] 10A-10C show simplified fusion graphs illustrating patch-based generation of layers using a network of unit cells according to some embodiments. [Figure 17]1 shows a simplified schematic diagram of a network of interleaving modules according to some embodiments. [Figure 18A] FIG. 10 illustrates an example of assignment of interleaved coordinates to vertices within layers of a fused graph according to some embodiments. [Figure 18B] FIG. 10 illustrates an example of assignment of interleaved coordinates to vertices within layers of a fused graph according to some embodiments. [Figure 19A] 1 illustrates a diagram of a representative layer of a fused graph with overlaid interleaved coordinates, according to some embodiments. [Figure 19B] FIG. 19B shows a detailed view of one patch of the layer shown in FIG. 19A. [Figure 20] 10 shows a table illustrating configuration settings in an interleaving module that may be determined from patches of a fused graph according to some embodiments. [Figure 21A] 1 shows an example of a fusion graph of actions that change the lattice structure. [Figure 21B] 1 shows an example of a fusion graph of actions that change the lattice structure. [Figure 22] 1 shows a simplified schematic diagram of an interleaving module according to some embodiments. [Figure 23A] 1 shows an example of a fusion graph for moving logical qubits. [Figure 23B] 10 shows a fused graph for a more efficient implementation of moving logical qubits. [Figure 24] 1 shows a simplified schematic diagram of an interleaving module according to some embodiments. [Figure 25] 1 shows a simplified schematic diagram of network path connectivity between interleaving modules in a network array according to some embodiments. [Figure 26A] 1 is a conceptual diagram of a toric surface code with periodic boundary conditions. [Figure 26B] 1 is a conceptual diagram of a toric surface code with periodic boundary conditions. [Figure 26C] 1 is a conceptual diagram of a toric surface code with periodic boundary conditions. [Figure 26D]1 is a conceptual diagram of a toric surface code with periodic boundary conditions. [Figure 27] 1 shows a simplified schematic diagram of a networked array of interleaving modules according to some embodiments. [Figure 28] 1 shows a simplified schematic diagram of an interleaving module according to some embodiments. [Figure 29A] 1 shows a fusion graph of a star surface code. [Figure 29B] 1 shows a fusion graph of a star surface code. [Figure 30A] 1 illustrates an example of a connectivity structure of a star surface code patch that can be implemented using a network of interleaving modules according to some embodiments. [Figure 30B] 1 illustrates an example of a connectivity structure of a star surface code patch that can be implemented using a network of interleaving modules according to some embodiments. [Figure 31] FIG. 1 shows a simplified schematic diagram of a networked array of interleaving modules that may be used to generate star surface codes according to some embodiments. [Figure 32] 1 illustrates an example system architecture for a quantum computer system in which FBQC can be implemented according to some embodiments. [Figure 33] FIG. 1 illustrates a flow diagram of a process for operating an array of interleaving modules using classical control logic according to some embodiments. DETAILED DESCRIPTION OF THE INVENTION

[0007]

[0045] Disclosed herein are example systems and methods (also referred to as "embodiments") for performing operations on ensembles of qubits based on various physical quantum systems, including photonic systems. Such embodiments may be used, for example, in quantum computing and other contexts that utilize quantum entanglement (e.g., quantum communication). To facilitate understanding of this disclosure, an overview of relevant concepts and terminology is provided in Section 1, and an overview of fusion-based quantum computing (FBQC) is provided in Section 2. In this regard, Section 3 describes example interleaving modules according to various embodiments, and Section 4 describes examples of using a network of interleaving modules to implement FBQC. Sections 5-7 describe further example embodiments of interleaving modules and networks of interleaving modules, and Section 8 describes example embodiments of computing systems that can implement FBQC using a network of interleaving modules. While embodiments are described in specific detail for ease of understanding, those skilled in the art with access to this disclosure will recognize that the claimed invention can be practiced without these details.

[0008]

[0046] Furthermore, embodiments are described herein that form and function in systems of qubits, where the quantum state space of the qubits can be modeled as a two-dimensional vector space. As will be appreciated by those skilled in the art with access to this disclosure, the techniques described herein can be applied to systems of "qubits," where a qubit can be any quantum system having a quantum state space that can be modeled as a (complex) n-dimensional vector space (for any integer n) that can be used to encode n bits of information. For clarity, the term "qubit" is used herein, although in some embodiments, systems can also use quantum information carriers that encode information in a manner not necessarily associated with binary bits, such as qubits.

[0009]

[0047] 1. Overview of Quantum Computing Quantum computing relies on the dynamics of quantum objects, such as photons, electrons, atoms, ions, molecules, nanostructures, etc., that follow the rules of quantum theory. In quantum theory, the quantum state of a quantum object is described by a set of physical properties, the entire set of which is referred to as a mode. In some embodiments, a mode is defined by specifying the value (or distribution of values) of one or more properties of the quantum object. For example, if the quantum object is a photon, the mode may be defined by the frequency of the photon, the position in space of the photon (e.g., which waveguide or superposition of waveguides the photon is propagating through), the associated propagation direction (e.g., the photon's k-vector in free space), the polarization state of the photon (e.g., the direction (horizontal or vertical) of the photon's electric and / or magnetic fields), the time window through which the photon is propagating, the orbital angular momentum state of the photon, etc.

[0010]

[0048] For a photon propagating in a waveguide, it is convenient to view the state of the photon as one of a set of discrete spatiotemporal modes. For example, the photon's spatial mode k i is determined according to which of a finite set of discrete waveguides the photon is propagating through, and the time mode t jis determined by which of the discrete time periods (referred to herein as "bins") the photon resides in. In some photonic implementations, the degree of time discretization can be provided by a pulsed laser responsible for generating the photons. In the following examples, spatial modes are used primarily to avoid complexity. However, as will be appreciated by those skilled in the art, the systems and methods may be applied to any type of mode, e.g., time modes, polarization modes, and any other mode or set of modes useful for defining a quantum state. Furthermore, the following description describes an embodiment that uses a photonic waveguide to define the spatial mode of the photons. However, as will be appreciated by those skilled in the art with access to this disclosure, other types of modes, e.g., time modes, energy states, etc., may be used without departing from the scope of the present disclosure. Furthermore, one skilled in the art may implement examples using other types of quantum systems, including, but not limited to, other types of photonic systems.

[0011]

[0049] For quantum systems of indistinguishable particles, it is useful to describe the quantum state of the entire many-body system using a formalism of Fock states (sometimes called occupation number representation) rather than describing the quantum state of each particle in the system. In the Fock state description, the many-body quantum state is determined by how many particles are in each mode of the system. For example, a multi-mode two-particle Fock state

number

number

number

number

number

number

number

[0012]

[0050] 1.1. Qubit As used herein, a "qubit" (or quantum bit) is a quantum system with an associated quantum state that can be used to encode information. A quantum state can be used to encode one bit of information if the quantum state space can be modeled as a (complex) two-dimensional vector space, where one dimension in the vector space is mapped to a logical value of 0 and the other dimension is mapped to a logical value of 1. In contrast to classical bits, quantum bits can have states that are superpositions of the logical values ​​0 and 1. More generally, a "qubit" can be any quantum system with a quantum state space that can be modeled as a (complex) n-dimensional vector space (for any integer n) that can be used to encode n bits of information. For clarity, the term "qubit" is used herein, although in some embodiments, systems can also use quantum information carriers that encode information in a manner not necessarily associated with binary bits, such as quantum bits. Qubits (or qudits) can be implemented in a variety of quantum systems. Examples of qubits include the polarization state of a photon, the presence of a photon in a waveguide, or the energy state of a molecule, atom, ion, nucleus, or photon. Other examples include flux qubits, phase qubits, or other artificial quantum systems such as charge qubits (e.g., formed from superconducting Josephson junctions), topological qubits (e.g., Majorana fermions), or spin qubits formed from vacancy centers (e.g., nitrogen vacancies in diamond).

[0013]

[0051] A qubit can be "dual-rail encoded" such that the logical value of the qubit is encoded by occupying one of two modes of the quantum system. For example, logical 0 and 1 values ​​can be encoded as follows:

number

number

number

number

[0014]

[0052] 1.2. Entangled state Many of the advantages of quantum computing over "classical" computing (e.g., conventional digital computers using binary logic) stem from its ability to create entangled states of multi-qubit systems. Mathematically speaking, the states of n quantum objects

number

number

number

[0015]

[0053] More generally, an n-qubit Greenberger-Horne-Zeilinger (GHZ) state (or "n-GHZ state") is an entangled quantum state of n qubits. For a given orthonormal logical basis, an n-GHZ state is a quantum superposition in which all qubits in a first basis state are superposed with all qubits in a second basis state,

number

number

[0016]

[0054] Physical Implementation Qubits (and operations on qubits) can be implemented using a variety of physical systems. In some examples described herein, qubits are provided in integrated photonic systems using waveguides, beam splitters, photonic switches, and single-photon detectors, and the modes that can be occupied by photons are spatiotemporal modes corresponding to the presence of photons in the waveguides. Mode couplers, e.g., optical beam splitters, can be used to couple modes to perform conversion operations, and measurement operations can be performed by coupling single-photon detectors to specific waveguides. As will be appreciated by those skilled in the art with access to this disclosure, modes defined by any appropriate set of degrees of freedom, e.g., polarization modes, time modes, etc., can be used without departing from the scope of this disclosure. For example, in the case of modes that differ only in polarization (e.g., horizontal (H) and vertical (V)), the mode coupler can be any optical element that coherently rotates polarization, e.g., a birefringent material such as a wave plate. For other systems, such as ion trap systems or neutral atom systems, the mode coupler can be any physical mechanism capable of coupling two modes, for example, a pulsed electromagnetic field tuned to couple two internal states of the atoms / ions.

[0017]

[0055] In some embodiments of a photonic quantum computing system using dual-rail encoding, a pair of waveguides can be used to implement a qubit. Figure 1 shows two views (100, 100') of a portion of a pair of waveguides 102, 104 that can be used to provide a dual-rail encoded photonic qubit. In 100, a photon 106 is in waveguide 102 and no photons are in waveguide 104 (also referred to as the vacuum mode), which in some embodiments is the mode of the photonic qubit.

number

number

[0018]

[0056] The occupied modes can be formed by using a photon source to generate photons that propagate within the desired waveguide. The photon source can be, for example, a cavity-based photon source that emits photon pairs, also known as a herald single-photon source. In one example of such a photon source, the photon source is driven by a pump, e.g., optical pulses, coupled to a system of optical resonators that can generate photon pairs through a nonlinear optical process (e.g., spontaneous four-wave mixing (SFWM), spontaneous parametric down-conversion (SPDC), second-harmonic generation, etc.). Many different types of photon sources can be used. An example of a photon pair source is a microring-based spontaneous four-wave mixing (SPFW) herald photon source (HPS). However, the exact type of photon source used is not critical, and any type of nonlinear source using any process, such as SPFW, SPDC, or any other process, can be used. Other classes of photon sources that do not necessarily require nonlinear materials, such as quantum dot sources, those using atoms and / or artificial atomic systems such as color centers in crystals, can also be used. In some cases, the photon source may or may not be coupled to a photonic cavity, as is the case for artificial atomic systems such as quantum dots coupled to a cavity. Other types of photon sources, such as optomechanical systems, also exist in SPWM and SPDC.

[0019]

[0057] In such cases, the operation of the photon source may be nondeterministic (sometimes referred to as "stochastic"), such that a given pump pulse may or may not generate a photon pair. In some embodiments, coherent spatial and / or temporal multiplexing (referred to herein as "active" multiplexing) of several nondeterministic photon sources may be used to enable the probability that a mode will be occupied during a given cycle to approach unity. As will be appreciated by those skilled in the art, many different active multiplexing architectures incorporating spatial and / or temporal multiplexing are possible. For example, active multiplexing schemes using logarithmic trees, generalized Mach-Zehnder interferometers, multimode interferometers, chained sources, dump-to-pump chained sources, asymmetric polycrystalline single-photon sources, or any other type of active multiplexing architecture may be used. In some embodiments, the photon source may use active multiplexing schemes, such as those using quantum feedback control.

[0020]

[0058] The measurement operation can be performed by coupling the waveguide to a single-photon detector that generates a classical signal (e.g., a digital logic signal) indicating that a photon has been detected by the detector. Any type of photodetector that is sensitive to single photons can be used. In some embodiments, the detection of a photon (e.g., at the output end of the waveguide) can indicate an occupied mode, while the absence of a detected photon can indicate an unoccupied mode.

[0021]

[0059] Some embodiments described below relate to the physical implementation of a unitary transformation operation that couples modes of a quantum system, which can be understood as transforming the quantum state of the system. For example, if the initial state of the quantum system (before mode coupling) is one in which one mode is occupied with probability 1 and another mode is unoccupied with probability 1 (e.g., the state

number

number

number

[0022]

[0060] Figure 2A shows a schematic diagram 210 (also called a circuit diagram or circuit representation) for coupling two modes. The modes are depicted as horizontal lines 212, 214, and the mode coupler 216 is indicated by a vertical line terminating in a node (solid dot) to identify the modes being coupled. In the more specific language of linear quantum optics, the mode coupler 216 shown in Figure 2A represents a 50 / 50 beam splitter that implements a transfer matrix.

number

number

number

number

number

number

[0023]

[0061] FIG. 2B illustrates a physical implementation of mode coupling that implements the transfer matrix T of Equation (9) for two photonic modes according to some embodiments. In this example, the mode coupling is performed using a waveguide beam splitter 200, sometimes referred to as a directional coupler or mode coupler. The waveguide beam splitter 200 can be realized by placing two waveguides 202, 204 close enough together so that the evanescent field of one waveguide can couple into the other. By adjusting the spacing d between the waveguides 202, 204 and / or the length l of the coupling region, different couplings between the modes can be obtained. In this manner, the waveguide beam splitter 200 can be configured to have a desired transmittance. For example, the beam splitter can be designed to have a transmittance equal to 0.5 (i.e., a 50 / 50 beam splitter to implement the particular form of the transfer matrix T introduced above). If other transfer matrices are desired, the reflectance (or transmittance) can be designed to be greater than 0.6, greater than 0.7, greater than 0.8, or greater than 0.9 without departing from the scope of this disclosure.

[0024]

[0062] In addition to mode coupling, some unitary transformations may include a phase shift applied to one or more modes. In some photonic implementations, variable phase shifters can be implemented in integrated circuits to control the relative phases of photon states spread across multiple modes. An example of a transfer matrix defining such a phase shift is given by the following (to apply +i and −i phase shifts to the second mode, respectively):

number

[0025]

[0063] A beam splitter with variable transmission and arbitrary phase relationships between output modes can also be achieved by combining a directional coupler and a variable phase shifter in a Mach-Zehnder interferometer (MZI) configuration 300, as shown, for example, in FIG. 3A. Full control over the relative phase and amplitude of the two modes 302a, 302b in dual-rail encoding can be achieved by varying the phase imparted by phase shifters 306a, 306b, and 306c, as well as the length and proximity of coupling regions 304a and 304b. FIG. 3B shows a slightly simpler example of an MZI 310 that allows variable transmission between modes 302a, 302b by varying the phase imparted by phase shifter 306. While FIGS. 3A and 3B are examples of how a mode coupler can be implemented in a physical device, any type of mode coupler / beam splitter can be used without departing from the scope of this disclosure.

[0026]

[0064] In some embodiments, beam splitters and phase shifters can be used in combination to implement various transfer matrices. For example, Figure 4A shows a mode coupler 400, in a schematic form similar to that of Figure 2A, that implements the following transfer matrix:

number

number

[0027]

[0065] Similarly, a network of mode couplers and phase shifters can be used to implement coupling between more than two modes. For example, FIG. 5 shows a four-mode coupling scheme that implements a "spreader" or "mode information elimination" transformation on four modes. That is, the scheme captures a photon in any one of the input modes and delocalizes it among each of the four output modes so that the photon has an equal probability of being detected in any one of the four output modes. (The well-known Hadamard transform is an example of a spreader transform.) As in FIG. 2A, horizontal lines 512-515 correspond to modes, and mode coupling is indicated by vertical line 516 with nodes (dots) to identify the coupled modes. In this case, four modes are coupled. Circuit representation 502 is an equivalent representation to circuit diagram 504, which is a first-order mode-coupling network. More generally, if higher-order mode coupling can be implemented as a first-order mode-coupling network, a circuit representation similar to representation 502 (with the appropriate number of modes) can be used.

[0028]

[0066] FIG. 6 illustrates an example of an optical device 600 capable of implementing the four-mode diffusive conversion shown schematically in FIG. 5 , according to some embodiments. The optical device 600 includes a first set of optical waveguides 601, 603 formed in a first material layer (represented by solid lines in FIG. 6 ) and a second set of optical waveguides 605, 607 formed in a separate second material layer different from the first material layer (represented by dashed lines in FIG. 6 ). The second material layer and the first material layer are located at different heights above a substrate. Those skilled in the art will appreciate that an interferometer such as that shown in FIG. 6 can be implemented in a single layer if appropriate low-loss waveguide intersections are used.

[0029]

[0067] At least one optical waveguide 601, 603 of the first set of optical waveguides is coupled to an optical waveguide 605, 607 of the second set of optical waveguides with any type of suitable optical coupler, such as a directional coupler described herein (e.g., the optical couplers shown in Figures 2B, 3A, and 3B). For example, the optical device shown in Figure 6 includes four optical couplers 618, 620, 622, and 624. Each optical coupler can have a coupling region in which the two waveguides propagate in parallel. Although the two waveguides are shown in Figure 6 as being offset from each other within the coupling region, the two waveguides may also be positioned directly above and below each other within the coupling region without any offset. In some embodiments, one or more of the optical couplers 618, 620, 622, 624 are configured to have approximately a 50% coupling efficiency between the two waveguides (e.g., a coupling efficiency of 49%-51%, a coupling efficiency of 49.9%-50.1%, a coupling efficiency of 49.99%-50.01%, a coupling efficiency of 50%, etc.). For example, the lengths of the two waveguides, the refractive indices of the two waveguides, the widths and heights of the two waveguides, the refractive index of the material located between the two waveguides, and the distance between the two waveguides are selected to provide a 50% coupling efficiency between the two waveguides. This allows the optical coupler to operate like a 50 / 50 beam splitter.

[0030]

[0068] 6 can include two interlayer optical couplers 614 and 616. Optical coupler 614 enables transmission of light propagating in a waveguide on a first material layer to a waveguide on a second material layer, and optical coupler 616 enables transmission of light propagating in a waveguide on the second material layer to a waveguide on the first material layer. Optical couplers 614 and 616 enable optical waveguides located on at least two different layers to be used in a multi-channel optical coupler, thereby enabling a compact multi-channel optical coupler.

[0031]

[0069] 6 further includes an uncoupled waveguide intersection region 626. In some implementations, two waveguides (603 and 605 in this example) cross each other without a parallel coupling region at the intersection in the uncoupled waveguide intersection region 626 (e.g., the waveguides can be two straight waveguides that cross each other at approximately a 90-degree angle).

[0032]

[0070] Those skilled in the art will appreciate that the foregoing examples are illustrative, and photonic circuits employing beam splitters and / or phase shifters can be used to implement many different transform matrices, including transform matrices for real and imaginary Hadamard transforms of any order, discrete Fourier transforms, etc. One class of photonic circuits, referred to herein as "spreader" or "mode information elimination (MIE)" circuits, has the property that if the input is a single photon localized in one input mode, the circuit delocalizes photons among each of several output modes so that the photon has an equal probability of being detected in any one of the output modes. Examples of spreader or MIE circuits include circuits that implement Hadamard transfer matrices. (It should be understood that a spreader or MIE circuit can receive inputs that are not single photons localized in one input mode, and the behavior of the circuit in such cases depends on the particular transfer matrix implemented.) In other examples, a photonic circuit can implement other transfer matrices, including transfer matrices that result in unequal probabilities of detecting a photon in different output modes for a single photon in one input mode.

[0033]

[0071] In some embodiments, entangled states of multiple photonic qubits can be formed by coupling the modes of two (or more) qubits and performing measurements in other modes. By way of example, FIG. 7 shows a circuit diagram of a Bell state generator 700 that can be used in some dual-rail coded photonic embodiments. In this example, modes 732(1)-732(4) are initially occupied by photons (shown as dashed lines), respectively, and modes 732(5)-732(8) are initially vacuum modes. (Those skilled in the art will recognize that other combinations of occupied and unoccupied modes can be used.)

[0034]

[0072] First-order mode coupling (e.g., implementing the transfer matrix T in Equation (9)) is performed on pairs of occupied and unoccupied modes, as indicated by mode couplers 731(1)-731(4). Then, mode information cancellation coupling (e.g., performing a four-mode mode-spreading transformation as shown in FIG. 5) is performed on four of the modes (modes 732(5)-732(8)), as indicated by mode coupler 737. Modes 732(5)-732(8) act as "herald" modes that are measured and used to determine whether Bell states are successfully generated in the other four modes 732(1)-732(4). For example, detectors 738(1)-738(4) can be coupled to modes 732(5)-732(8) after second-order mode coupler 737. Each detector 738(1)-738(4) can output a classical data signal (e.g., a voltage level on a conductor) indicating whether it detected a photon (or the number of photons detected). These outputs can be coupled to classical decision logic 740, which determines whether a Bell state exists in the other four modes 732(1)-732(4). For example, decision logic 740 can be configured so that a Bell state is confirmed (also referred to as a "success" of the Bell state generator) if and only if a single photon is detected by each of exactly two detectors 738(1)-738(4). The modes 732(1)-732(4) can be mapped to the logical states of two qubits (Qubit 1 and Qubit 2), as shown in FIG. 7. Specifically, in this example, the logic state of Qubit 1 is based on the occupancy of modes 732(1) and 732(2), and the logic state of Qubit 2 is based on the occupancy of modes 732(3) and 732(4). Note that the operation of Bell state generator 700 can be non-deterministic. That is, inputting four photons as shown does not guarantee that Bell states in modes 732(1)-732(4) will be generated. In one implementation, the probability of success is 4 / 32.

[0035]

[0073] In some embodiments, it is desirable to form quantum systems of multiple entangled qubits (two or more qubits). One technique for forming multi-qubit quantum systems is through the use of entangled measurements, which are projective measurements that can be used to create entanglement between systems of qubits. As used herein, "fusion" (or "fusion operation" or "fusing") refers to projective entangled measurements. A "fusion gate" is a structure that accepts two (or more) input qubits, each of which is generally part of a different quantum system. The different quantum systems do not need to be entangled with each other before applying the fusion gate. For two input qubits, the fusion gate performs a projective measurement operation on the input qubits that produces an output qubit of either 1 ("Type I fusion") or 0 ("Type II fusion"), such that the initial two quantum systems are fused into a single quantum system of entangled qubits. Fusion gates are a specific example of a general class of projective entangled measurements and are particularly suited to photonic architectures. Examples of Type I and Type II fusion gates are described below.

[0036]

[0074] FIG. 8A shows a circuit diagram illustrating a Type I fused gate 800 according to some embodiments. The diagram shown in FIG. 8A is a schematic diagram in which each horizontal line represents a mode of a quantum system, e.g., photons. In dual-rail encoding, each pair of modes corresponds to a qubit. In a photonic implementation of the gate, the modes of the diagram shown in FIG. 8A may be physically realized using a single photon in a photonic waveguide. Most generally, a Type I fused gate such as that shown in FIG. 8A takes as inputs qubit A (e.g., physically realized by photon modes 843 and 845) and qubit B (e.g., physically realized by photon modes 847 and 849) and outputs a single “fused” qubit that inherits the entanglement of either input qubit A or input qubit B (or both) with other qubits already entangled.

[0037]

[0075] For example, Figure 8B shows the result of a Type I fusion of two qubits A and B, each of which is a qubit located at the end (i.e., leaf) of some longer entangled cluster state (only a portion of which is shown). The qubit 857 remaining after the fusion operation inherits the entanglement coupling from the original qubits A and B, thereby producing a larger linear cluster state. Figure 8B also shows the result of a Type I fusion of two qubits A and B, each of which is an internal qubit belonging to some longer entangled cluster of qubits (only a portion of which is shown). As previously mentioned, the qubit 859 remaining after the fusion inherits the entanglement coupling from the original qubits A and B, thereby producing a fused quantum system. In this case, the qubit remaining after the fusion operation is entangled with the larger quantum system by its four other nearest neighbor qubits, as shown.

[0038]

[0076] Returning to the schematic diagram of Type I fused gate 800 shown in FIG. 8A, qubit A is dual-rail encoded by modes 843 and 845, and qubit B is dual-rail encoded by modes 847 and 849. For example, in the case of a path-encoded photonic qubit, the logic zero state (

number

[0039]

[0077] 8A shows only an example arrangement of a Type I fused gate; one skilled in the art will recognize that the location of the mode coupler and the presence of mode swap region 851 can be changed without departing from the scope of this disclosure. For example, beam splitter 853 can be applied between mode 845 and mode 847. Mode swapping is optional and is not necessary if qubits with non-adjacent modes can be handled by tracking which mode belongs to which qubit, for example, by storing this information in classical memory.

[0040]

[0078] Type I fusion gate 800 is a nondeterministic gate; i.e., the fusion operation succeeds with a certain probability less than 1; otherwise, the resulting quantum state is not a larger quantum system that includes the original quantum systems that were fused together to form the larger quantum system. More specifically, gate 800 "succeeds" with a 50% probability if only one photon is detected by detector 855 and "fails" if zero or two photons are detected by detector 855. If the gate succeeds, the two quantum systems of which qubit A and qubit B were part are fused into a single, larger quantum system, and the fused qubit remains as the qubit linking two previously unlinked quantum systems (see, e.g., FIG. 8B). However, if the fusion gate fails, it has the effect of removing both qubits from the original quantum system without creating a larger quantum system.

[0041]

[0079] FIG. 9A shows a circuit diagram illustrating a type II fused gate 900 according to some embodiments. As with other figures herein, the diagram shown in FIG. 9A is a schematic diagram, with each horizontal line corresponding to a mode of a quantum system, e.g., a photon. In dual-rail encoding, each pair of modes corresponds to a qubit. In a photonic implementation of the gate, the modes of a diagram such as that shown in FIG. 9A can be physically realized using a single photon in a photonic waveguide. Most generally, a type II fused gate such as gate 900 takes as inputs qubit A (e.g., physically realized by photon modes 943 and 945) and qubit B (e.g., physically realized by photon modes 947 and 949) and outputs a quantum state that inherits the entanglement of either input qubit A or input qubit B (or both) with other qubits already entangled. (For Type II fusion, if the input quantum states have a total of N qubits between them, the output quantum state has N-2 qubits. This differs from Type I fusion, in which input quantum states with a total of N qubits between them result in an output quantum state with N-1 qubits.)

[0042]

[0080] For example, Figure 9B shows the result of a Type II fusion of two qubits A and B, each of which is a qubit located at the end (i.e., leaf) of several longer entangled cluster states (only some of which are shown). The resulting quantum system 971 inherits entanglement coupling from qubit A and qubit B, thereby creating a larger linear quantum system.

[0043]

[0081] Returning to the schematic diagram of Type II fused gate 900 shown in FIG. 9A, qubit A is dual-rail encoded by modes 943 and 945, and qubit B is dual-rail encoded by modes 947 and 949. For example, in the case of a path-encoded photonic qubit, the logic zero state (

number

[0044]

[0082] FIG. 9A shows only an example arrangement of a Type II fused gate; one skilled in the art will appreciate that the location of the mode coupler and the presence or absence of the mode swap region can be varied without departing from the scope of this disclosure.

[0045]

[0083] The Type II fusion gate shown in Figure 9A is a nondeterministic gate; i.e., the fusion operation succeeds with a certain probability less than one; otherwise, the resulting quantum state is not a larger quantum system that includes the original quantum systems fused together into a larger quantum system. More specifically, the gate "succeeds" if one photon is detected at either detector 957(1) or 957(4) and one photon is detected at either detector 957(2) or 957(3); in all other cases, the gate "fails." If the gate succeeds, the two quantum systems of which qubit A and qubit B were part are fused into a single, larger quantum system; unlike Type I fusion, no fused qubits remain (compare Figures 8B and 9B). If the fusion gate fails, it has the effect of removing both qubits from the original quantum system without creating a larger quantum system.

[0046]

[0084] 10 illustrates an example of a qubit entanglement system 1001 according to some embodiments. Such a system can be used to generate qubits (e.g., photons) in entangled states (e.g., GHZ states, Bell pairs, etc.), according to some embodiments. In some embodiments, qubit entanglement system 1001 can operate as a resource state generator, as described below.

[0047]

[0085] In an exemplary photonic architecture, qubit entanglement system 1001 may include a photon source module 1005 optically connected to entangled state generator 1000. Both photon source module 1005 and entangled state generator 1000 may be coupled to classical processing system 1003 such that classical processing system 1003 can communicate with and / or control photon source module 1005 and / or entangled state generator 1000 (e.g., via classical information channels 1030a-b). Photon source module 1005 may include a collection of single-photon sources that can provide output photons to entangled state generator 1000 by interconnecting waveguides 1032. Entangled state generator 1000 can receive the output photons, convert them into one or more entangled photonic states, and then output these entangled photonic states to output waveguide 1040. In some embodiments, output waveguide 1040 may be coupled to some downstream quantum photonic circuitry that can use the entangled states, for example, to perform quantum computations. For example, the entangled states generated by entangled state generator 1000 may be used as resource states for one or more interleaving modules, as described below.

[0048]

[0086] In some embodiments, system 1001 can include classical channels 1030 (e.g., classical channels 1030a-1030d) for interconnecting and providing classical information between components. It should be noted that classical channels 1030a-1030d need not all be the same. For example, classical channels 1030a-1030c can comprise a bidirectional communication bus carrying one or more reference signals, e.g., one or more clock signals, one or more control signals, or any other signals that carry classical information, e.g., herald signals, photon detector readout signals, etc.

[0049]

[0087] In some embodiments, the qubit entanglement system 1001 includes a classical computer system 1003 that communicates with and / or controls the photon source module 1005 and / or the entangled state generator 1000. For example, in some embodiments, the classical computer system 1003 can be used to configure one or more circuits, such as a system clock that can be provided to the photon source module 1005 and the entangled state generator 1000, as well as any downstream quantum photonic circuitry used to perform quantum computations. In some embodiments, the quantum photonic circuitry can include optical circuits, electrical circuits, or any other type of circuitry. In some embodiments, the classical computer system 1003 includes a memory 1004, one or more processors 1002, a power supply, an input / output (I / O) subsystem, and a communication bus or buses interconnecting these components. The processor 1002 can execute modules, programs, and / or instructions stored in the memory 1004, thereby performing processing operations.

[0050]

[0088] In some embodiments, memory 1004 stores one or more programs (e.g., sets of instructions) and / or data structures. For example, in some embodiments, entangled state generator 1000 can attempt to generate an entangled state over successive stages, any one of which may be successful in generating an entangled state. In some embodiments, memory 1004 stores one or more programs for determining whether each stage is successful and configuring entangled state generator 1000 accordingly (e.g., by configuring entangled state generator 1000 to switch the photon to an output if the stage is successful, or to pass the photon to the next stage of entangled state generator 1000 if the stage has not yet been successful). To that end, in some embodiments, memory 1004 stores detection patterns (described below) that enable classical computing system 1003 to determine whether a stage is successful. Additionally, memory 1004 can store settings provided to various configurable components (e.g., switches) described herein, for example, by setting one or more phase shifts of the components.

[0051]

[0089] In some embodiments, some or all of the aforementioned functionality may be implemented in hardware circuitry on the photon source module 1005 and / or entangled state generator 1000. For example, in some embodiments, the photon source module 1005 includes one or more controllers 1007a (e.g., logic controllers) (which may include, for example, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICS), "systems on chips" including classical processors and memory, etc.). In some embodiments, the controller 1007a determines whether the photon source module 1005 was successful (e.g., for a given attempt for a given clock cycle, as described below) and outputs a reference signal indicating whether the photon source module 1005 was successful. For example, in some embodiments, controller 1007a outputs a logic high value to classical channel 1030a and / or classical channel 1030c if photon source module 1005 is successful, and outputs a logic low value to classical channel 1030a and / or classical channel 1030c if photon source module 1005 is unsuccessful. In some embodiments, the output of controller 1007a may be used to configure hardware in controller 1007b.

[0052]

[0090] Similarly, in some embodiments, the entangled state generator 1000 includes one or more controllers 1007b (e.g., logic controllers) (which may include, for example, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICS), etc.) that determine whether each stage of the entangled state generator 1000 was successful, implement the switching logic described above, and output reference signals to classical channels 1030b and / or 1030d to notify other components as to whether the entangled state generator 400 was successful.

[0053]

[0091] In some embodiments, a system clock signal may be provided to photon source module 1005 and entangled state generator 1000 via an external source (not shown) or by classical computing system 1003 via classical channels 1030a and / or 1030b. In some embodiments, the system clock signal provided to photon source module 1005 triggers photon source module 1005 to attempt to output one photon per waveguide. In some embodiments, the system clock signal provided to entangled state generator 1000 triggers or gates a set of detectors in entangled state generator 1000 to attempt to detect a photon. For example, in some embodiments, triggering a set of detectors in entangled state generator 1000 to attempt to detect a photon includes gating the set of detectors.

[0054]

[0092] It should be noted that in some embodiments, photon source module 1005 and entangled state generator 1000 can have internal clocks. For example, photon source module 1005 can have an internal clock generated and / or used by controller 1007a, and entangled state generator 1000 has an internal clock generated and / or used by controller 1007b. In some embodiments, the internal clock of photon source module 1005 and / or entangled state generator 1000 are synchronized (e.g., via a phase-locked loop) to an external clock (e.g., a system clock provided by classical computer system 1003). In some embodiments, any of the internal clocks may itself be used as a system clock; for example, the internal clock of the photon source may be distributed to other components in the system and used as a master / system clock.

[0055]

[0093] In some embodiments, the photon source module 1005 includes multiple stochastic photon sources, i.e., so-called multiplexed single-photon sources, that can be spatially and / or temporally multiplexed. In one example of such a source, the source is driven by a pump, e.g., optical pulse, coupled to an optical resonator that can generate zero, one, or multiple photons by some nonlinear process (e.g., spontaneous four-wave mixing, second-harmonic generation, etc.). As used herein, the term "attempt" refers to the act of driving the photon source with some kind of drive signal, e.g., pump pulse, that can generate output photons non-deterministically (i.e., the probability that the photon source will generate one or more photons in response to the drive signal can be less than 1). In some embodiments, each photon source may have a highest probability of generating zero photons in each attempt (e.g., the probability of generating zero photons per attempt to generate a single photon can be 90%). The second most likely outcome of the attempt can be the generation of a single photon (e.g., the probability of generating a single photon per attempt to generate a single photon can be 9%). The third most likely outcome of the attempt may be the production of two photons (e.g., the probability of producing two photons per attempt to produce a single photon may be about 1%). In some circumstances, the probability of producing three or more photons may be less than 1%.

[0056]

[0094] In some embodiments, the apparent efficiency of a photon source can be increased by using multiple single photon sources and multiplexing the output of the multiple photon sources.

[0057]

[0095] The exact type of photon source used is not important, and any type of photon source can be used using any photon generation process, such as spontaneous four-wave mixing (SPFW), spontaneous parametric down-conversion (SPDC), or any other process. Other classes of photon sources that do not necessarily require nonlinear materials can also be used, such as quantum dot sources, those using atoms and / or artificial atomic systems such as color centers in crystals. In some cases, the photon source may or may not be coupled to a photonic cavity, as in the case of artificial atomic systems such as quantum dots coupled to a cavity. Other types of photon sources, such as optomechanical systems, also exist in SPWM and SPDC. In some examples, the photon source can emit multiple photons that are already in an entangled state, in which case the entangled state generator 400 may not be needed, or may take an entangled state as an input and generate an even larger entangled state.

[0058]

[0096] For illustrative purposes, an example using spatial multiplexing of several non-deterministic photon sources will be described as an example of a MUX photon source. However, many different spatial MUX architectures are possible without departing from the scope of this disclosure. Temporal MUXing can also be implemented instead of or in combination with spatial multiplexing. MUXing schemes using logarithmic trees, generalized Mach-Zehnder interferometers, multimode interferometers, chain sources, dump-to-pump chain sources, asymmetric polycrystalline single-photon sources, or any other type of MUX architecture can be used. In some embodiments, the photon source can use a MUXing scheme involving quantum feedback control, etc.

[0059]

[0097] The above descriptions provide examples of how photonic circuits can be used to implement physical qubits and operations on physical qubits using mode coupling between waveguides. In these examples, a pair of modes can be used to represent each physical qubit. The examples described below can be implemented using similar photonic circuit elements.

[0060]

[0098] In some embodiments, an entangled system of multiple physical qubits can be mapped to one or more "logical qubits," and operations associated with quantum computing can be defined as logical operations on logical qubits, which can be mapped to physical operations on physical qubits. In general, the term "qubit," when used herein without specifying a physical or logical qubit, should be understood to refer to a physical qubit.

[0061]

[0099] 2. Overview of Fusion-Based Quantum Computing (FBQC) As used herein, "quantum computing" generally refers to performing a sequence of operations ("computations") on a collection of qubits. Quantum computing is often considered in the framework of "circuit-based quantum computing" (CBQC), where operations are specified as a sequence of logical "gates" performed on qubits. The gates can be either single operations on a single qubit (rotations), two-qubit entangled operations such as CNOT gates, or other multi-qubit gates such as Toffoli gates.

[0062]

[0100] One challenge of CBQC, and quantum computing in general, is that qubits and the physical systems that perform operations on them are often nondeterministic and noisy. For example, while the photonic Bell state generators and fusion circuits mentioned above can create entanglement between photonic qubits, they do so nondeterministically, with a probability of success significantly less than one. Furthermore, physical systems can be "noisy." For example, waveguides that propagate photons may not be perfectly efficient, resulting in the occasional loss of photons. For these reasons, fault-tolerant quantum computing is a desirable goal.

[0063]

[0101] "Measurement-based quantum computing" (MBQC) is a technique for implementing quantum computation that enables fault tolerance. In MBQC, computation proceeds by first preparing a specific entangled state of many physical qubits, commonly referred to as a "cluster state," and then performing a series of single-qubit measurements to execute (or perform) a quantum computation. For example, rather than implementing a series of gates operating on one or two physical qubits, a subset of the physical qubits in the cluster state can be mapped to a "logical" qubit, and gate operations on the logical qubits can be mapped to a specific set of measurements on the physical qubits associated with one or more logical qubits. Entanglement between the physical qubits results in expected correlations between measurements on different physical qubits, which enables error correction. The cluster state can be prepared in a manner that is not specific to a particular computation (other than, in some cases, the size of the cluster state), and the selection of single-qubit measurements is determined by the particular computation. In the MBQC approach, fault tolerance can be achieved through careful design of the cluster state and by using the topology of the cluster state to encode the logical qubits in a manner that protects against any logical errors that may be caused by errors in any of the physical qubits that make up the cluster state. The values ​​(or states) of the logical qubits can be determined, i.e., read out, based on the results of single-particle measurements (also referred to herein as measurement results) made on the physical qubits of the cluster state as the computation progresses.

[0064]

[0102] For example, a suitable cluster state for MBQC is a specific state (

number

[0065]

[0103] However, creating and maintaining long-range entanglement across cluster states and subsequently storing the large cluster states can be challenging. For example, in any physical implementation of the MBQC approach, cluster states containing thousands or more mutually entangled qubits must be prepared and then stored for some period of time before single-qubit measurements can be performed.

[0066]

[0104] "Fusion-based quantum computing" (FBQC) is a technique related to MBQC in that a computation on a set of logical qubits can be specified as a set of measurements on a (generally much larger) number of physical qubits, and correlations between the measurements on the physical qubits enable error correction. However, FBQC avoids the need to first create a large cluster state and then manipulate it. In a photonic implementation of FBQC, an entangled state consisting of several physical qubits (called a "resource state") is periodically generated and transported (via a waveguide) to a circuit capable of performing a measurement operation (e.g., the aforementioned Type II fusion operation, which can provide two-qubit and / or single-qubit measurements). Measurements destroy the measured qubit, but quantum information is preserved as it is transferred (teleported) to another qubit in another resource state. Thus, quantum information is periodically teleported to newly generated physical qubits rather than stored in a static array of physical qubits.

[0067]

[0105] Somewhat similar to MBQC, FBQC allows computations to be mapped onto an undirected graph called a fusion graph, which may have a lattice-like structure. The fusion graph may specify operations to be performed on physical qubits in resource states, including fusion operations on selected qubits in different resource states (e.g., in the "bulk" region of the lattice) and individual qubit measurements (e.g., at the boundaries of the lattice). Examples of FBQC techniques are described in International Publication No. WO 2021 / 155289, "Fusion Based Quantum Computing," published August 5, 2021. This section provides a conceptual description of FBQC to provide context for the interleaving module and other hardware components described below.

[0068]

[0106] 2.1.Resource State As previously mentioned, FBQC can use "resource states" as fundamental physical elements for performing quantum computation. As used herein, "resource state" refers to an entangled system of a number (n) of physical qubits in a non-separable entangled state (an entangled state that cannot be decomposed into smaller separate entangled states). In various embodiments, the number n can be a small number (e.g., between 3 and 30), although larger numbers are not excluded.

[0069]

[0107] FIG. 11 shows a graphical representation of a resource state 1100 that may be used in accordance with some embodiments. In the graphical representation of FIG. 11, each physical qubit 1101-1106 in the resource state 1100 is represented as a circle, and entanglement between pairs of physical qubits is represented by lines 1111-1116 connecting pairs of qubits. The resource state 1100 may also be referred to as a "six-ring" resource state. In the example used herein, the entanglement shape defines a three-dimensional space. For convenience, the cardinal directions in the entanglement space are referred to as north-south (NS), east-west (EW), and up-down (UD). The resource state 1100 has one qubit associated with each cardinal direction (N, S, U, D, E, W) in the entanglement space. It should be understood that the direction labels refer to the entanglement space and need not correspond to physical dimensions or directions in physical space. Furthermore, in some cases, the qubits may be separated in time rather than in a spatial dimension. For example, each physical qubit may be implemented using photons propagating in a waveguide, with particular portions of the waveguide hosting photons associated with different qubits at different times.

[0070]

[0108] In some embodiments, resource state 1100 can be generated using photon sources and entanglement circuits of the types described above. For example, Bell pairs can be generated using one or more photon sources (which can be MUX photon sources, as described above) and a circuit such as circuit 700 of FIG. 7. A 3-GHz state can be generated from two Bell pairs using a circuit such as type I fusion 800 of FIG. 8A. From a set of six 3-GHz states, a six-ring resource state 1100 can be formed using a circuit such as type II fusion circuit 900 of FIG. 9A. As described above, entanglement generation circuits such as Bell state generation circuit 700 and fusion circuits 800 and 900 can operate non-deterministically. In some implementations, the outputs of several such circuits can be multiplexed using temporal and / or spatial multiplexing techniques to increase the probability of generating a resource state.

[0071]

[0109] Resource state 1100 is illustrative and not limiting. In some embodiments, the entanglement shape of the resource state can be selected based on the particular computation being performed, and different resource states used in the same computation can have different entanglement shapes. Additionally, while resource state 1100 includes six qubits, the number of qubits in a resource state can also vary. Thus, resource states can be larger or smaller than the example shown. The circuitry used to generate resource states can also be modified depending on the particular entanglement shape and / or the probability of success of various entanglement generation operations. Error-correcting codes can also be constructed to account for the non-zero probability that a resource state will not be generated.

[0072]

[0110] Logical Operations Operations performed on qubits in resource states in the context of FBQC can be conceptually represented using a fusion graph. Figure 12A shows an example of a fusion graph 1200 according to some embodiments. The same three-dimensional entanglement space defined in Figure 11 is used, using the same NS, EW, and UD naming conventions (which need not correspond to any physical dimensions or orientation). However, unlike Figure 11, each vertex 1201 represents a resource state (e.g., the six-ring resource state 1100) rather than an individual qubit. Each vertex 1201 represents a physically distinct instance of a resource state. Each edge 1210 connecting two vertices 1201 corresponds to a fusion operation between qubits in different resource states. Each fusion operation can be, for example, the Type II fusion operation described above, producing a two-qubit measurement. The specific qubits involved can be identified from the direction of the edge in the entanglement space. Thus, for example, edge 1210a corresponds to a fusion operation between an N qubit in the resource state represented by vertex 1201a and an S qubit in a (different) resource state represented by vertex 1201b, and edge 1210b corresponds to a fusion operation between a U qubit in the resource state represented by vertex 1201b and a D qubit in a (third) resource state represented by vertex 1201c. Each half-edge 1220 (a "half-edge" is connected to exactly one vertex 1201) represents a single-qubit measurement for the corresponding qubit in the resource state represented by that vertex 1201. Thus, for example, half-edge 1220a corresponds to a single-qubit measurement for an E qubit in the resource state represented by vertex 1201a.

[0073]

[0111] In some embodiments, a fusion graph such as fusion graph 1200 can be viewed as a series of “layers” 1230, with each layer corresponding to a coordinate on the U-D axis. Implementing FBQC in a physical system can include successively generating resource states for each layer (e.g., in the D to U direction) and performing fusion and single-qubit measurement operations within each layer as specified by the edges and half-edges of that layer's graph. As resource states for successive layers are generated, fusion operations can be performed between U qubits in the resource state of one layer and D qubits in the resource state of a corresponding location in the next layer. In the following description, fusion operations are sometimes referred to as “spatial” or “temporal.” This term evokes particular implementations in which different qubits or resource states are generated or received at different times; spatial fusion can be performed between qubits generated or received simultaneously using different hardware instances, and temporal fusion can be performed between qubits generated or received at different times using the same hardware instance (or different hardware instances). In the case of photonic qubits, temporal fusion can be implemented by delaying an earlier generated qubit (e.g., using an additional length of waveguide material to create a longer propagation path for the photons), thereby enabling mode coupling with a later generated qubit. By leveraging temporal fusion, the same hardware can be used to generate and / or process multiple instances of a resource state within a layer and / or to generate multiple layers of resource states. Examples are provided below.

[0074]

[0112] In some encoding schemes for a sequence of operations on logical qubits, logical qubits that are "at rest" (i.e., not interacting with or otherwise acting on other logical qubits) can be mapped onto a fusion graph having a regular lattice pattern such as that shown in FIG. 12A. For the six-ring resource state of FIG. 11, each resource state in the majority of the lattice has each of its six qubits fused with a qubit from an adjacent resource state. (Two qubits input to a Type II fusion circuit are sometimes colloquially described as being "fused" together.) For example, an E qubit 1101 of a first instance of resource state 1100 and a W qubit 1102 of a second instance of resource state 1100 can be input into a fusion circuit (e.g., the Type II fusion circuit of FIG. 9A) to obtain a two-qubit measurement. At the boundaries of the lattice, qubits that do not undergo a fusion operation can undergo a single-qubit measurement.

[0075]

[0113] Logical operations for logical qubits can be specified by modifying the regular lattice pattern of the fused graph at selected positions, for example, by replacing single qubit measurements with fused operations, or vice versa. The choice of modification depends on the particular computation being performed. Some examples are described below.

[0076]

[0114] In some embodiments, a fusion graph, such as fusion graph 1200, can be used to specify logical operations to be performed on a set of logical qubits. For example, a fusion graph specifying the logical operations implemented in an FBQC can be generated from a surface code space-time or time slice diagram of the kind used to specify computations in fault-tolerant CBQC. Figures 12B-12D illustrate three different logical operations: (a) measurement of an idle logical qubit (i.e., a logical qubit that is not interacting with any other logical qubit); (b) measurement of a two-qubit logical qubit;

number

[0077]

[0115] 12B shows example surface code space-time diagrams 1242a-1242c that can be constructed using techniques known in the art. As shown in legend 1252, the surface code space-time diagrams can represent logical operations (e.g., twists, transpositions) on surfaces (e.g., primal and dual boundaries) that define logical qubits. Space-time diagram 1242a corresponds to a stopped logical qubit. Space-time diagram 1242b corresponds to a two-qubit

number

number

number

[0078]

[0116] A quantum computation can be represented as a sequence of time slices, such as the time slices in Figure 12C. However, it is often more convenient to represent a sequence of 2D time slices in a 3D diagram, such as space-time diagrams 1242a-1242c in Figure 12B. Solid black lines in the space-time diagram trace the trajectories of the corners of the patch through space-time. Shade-coded (or color-coded) surfaces track primal and dual boundaries through space-time, with the meaning of various shading patterns indicated in legend 1252. A two-dimensional spatial cross-section through space-time diagram 1242 corresponds to time slice diagram 1244. The bulk has a regular pattern of primal and dual measurements (as seen in the various time slice diagrams in Figure 12C), and measurements in the bulk can be inferred from the boundaries. Also shown in Figure 12B are corner lines indicating the twisting action (applied to time slice 1244c-1) and the associated displacement of the boundaries. Space-time diagrams need not directly indicate the number of time slices (or code distance) they correspond to. Typically, though not necessarily, each change to the spatial configuration lasts for a number of time slices equal to the code distance.

[0079]

[0117] For illustrative purposes, space-time diagram 1242a shows a logical qubit idling for a while until it is measured in the Z basis, as indicated by the diagonal lines and dual boundary capping off from space-time diagram 1242a. Space-time diagram 1242b shows a logical two-qubit measurement via "lattice surgery."

number

[0080]

[0118] In some embodiments of FBQC, a space-time diagram can be converted into a fused graph in a straightforward manner. For example, FIG. 12D shows fused graphs 1240a-1240c corresponding to space-time diagrams 1242a-1242c. Fusion graphs 1240a-1240c may be generally similar to fused graph 1200 in that both describe a cubic lattice of resource states. However, fused graph 1240 adds additional information about the measurement operations being performed by assigning colors or shading to specific cubic or rectangular volumes within the lattice. FIG. 12E shows legend 1250 illustrating how the shading (or color) of the cubic or rectangular volumes in fused graphs 1240a-1240c maps to corresponding sets of measurements on qubits with different resource states. In FIG. 12E, top row 1261 defines line types representing specific two-qubit (fused) measurements and single-qubit measurements. The following rows 1262-1266 show how each cubic or rectangular volume is mapped to a combination of fused measurements and single-qubit measurements. In some embodiments, each two-qubit fused measurement (e.g., a Type II fused measurement) is

number

number

number

number

number

[0081]

[0119] The transformation from a space-time diagram to a fused graph can be straightforward, as can be seen by comparing Figures 12C and 12D. Most of the fused graph is filled with 3D checkerboard primal cubes and dual bulk cubes, with primal and dual boundaries decorated with primal cubes or dual half cubes. If twists or lattice dislocations are present, they are added using rectangular parallelepipeds as shown in legend 1250. Slices of the fused graph can mimic the pattern of the corresponding CBQC time slices, but the interpretation is different, as can be seen by comparing legend 1250 (Figure 12E) with legend 1254 (Figure 12C). The number of cubes in the fused graph depends on the signature distance, and a time slice of a square patch with signature distance d is d. 2 Contains resource states.

[0082]

[0120] Further discussion of generating fusion graphs such as fusion graph 1240 can be found in the above-referenced International Publication No. WO 2021 / 155289 and in H. Bombin et al., “Interleaving: A Modular Architecture for Fault-Tolerant Photonic Quantum Computing,” arXiv:2013.08612v1 [quant-ph], March 15, 2021, available at https: / / arxiv.org / abs / 2103.08612.

[0083]

[0121] In some embodiments, a fusion graph may be "compiled" into "instructions" for performing a particular combination of fusion operations on a set of resource states. By way of example, FIGS. 13A-13C show diagrams of fusion graphs implementing logical operations on four logical qubits (q1, q2, q3, q4), according to some embodiments. FIG. 13A shows a perspective view of fusion graph 1300, including a first set 1302 of nine layers and a second set 1304 of nine layers. (For simplicity of illustration, FIG. 13A does not show fusion operations between resource states in different layers; however, it should be understood that fusion operations can be performed between resource states in corresponding positions in adjacent layers, as shown in FIG. 12A. Also, for simplicity of illustration, the shading of FIG. 12B does not apply to FIGS. 13A-13C. Appropriate patterns of primal cubes and dual bulk cubes and bounding half-cubes can be inferred.) FIG. 13B shows a representative layer 1302, and FIG. 13C shows a representative layer 1304. In this example, the computation involves performing a first Pauli product measurement Z2Z3 between logical qubits q2 and q3, followed by a second Pauli product measurement Z1Z4 between logical qubits q1 and q4. In this example, a “code distance” (or “code size”) of 9 is assigned. The code distance is a selectable parameter related to the size of the bulk lattice used to provide the desired error-correcting code; the selection of the code distance may depend on the particular hardware implementation (e.g., the expected photon loss and success rate of the particular entanglement generation circuit used to provide the resource state) and the desired degree of fault tolerance. In this example, the number of layers associated with each logical operation corresponds to the code distance, and the number of physical qubits between lattice modifications within a layer (as best seen in FIGS. 13B and 13C ) also corresponds to the code distance. The selection of the code distance is not relevant to an understanding of this disclosure; the embodiments described herein can support a range of code distances. Furthermore, although this example uses cubic codes (same code distances in all three dimensions), cubic codes are not required and code distances along different dimensions (e.g., UD, SN, EW) can differ from each other.

[0084]

[0122] FIG. 13B illustrates a representative set of layers 1302 corresponding to a Z2Z3 measurement. It should be understood that all layers 1302 can have the same lattice pattern. Lattice section 1321 represents logical qubit q1 at rest (i.e., not interacting with other qubits), and lattice section 1324 represents logical qubit q4 at rest. In this example, each logical qubit has a code distance of 9 and is represented as a 9×9 lattice in each layer. U-shaped lattice section 1322 represents the Z2Z3 measurement of logical qubits q2 and q3. As suggested by FIG. 13B, logical operations on logical qubits can include introducing additional resource states and fusion operations, the number of additional resource states and fusion operations depending, at least in part, on the code distance.

[0085]

[0123] 13C shows a representative set of layers 1304 corresponding to Z1Z4 measurements. It should be understood that all layers 1304 can have the same lattice pattern. Lattice sections 1342 and 1343 represent logical qubits q2 and q3 at rest. U-shaped lattice section 1341 represents the Z1Z4 measurements of logical qubits q1 and q4.

[0086]

[0124] 12A-12E and 13A-13C illustrate the principle of using a predetermined combination of single-qubit measurements (on physical qubits) and fusion between (physical) qubits in different resource states to perform a logical operation on a logical qubit. It should be understood that a fusion graph can specify operations in a manner that is independent of the particular implementation of the physical qubits. Some embodiments described below provide a reconfigurable hardware module that can perform operations on physical qubits in resource states. In some embodiments, such operations can correspond to operations specified in a fusion graph, and measurement data provided by the reconfigurable hardware module can be decoded to determine the result of the logical operation. However, the operation of the reconfigurable hardware module does not depend on any particular aspect of selecting or specifying the operation to be performed or on any particular downstream use of the measurement data generated by the reconfigurable hardware module.

[0087]

[0125] 3. Interleaving Module According to some embodiments, a general-purpose "interleaving" hardware module (or circuit) may include a resource state interconnect (RSI) that provides resource states at its output at regular time intervals, a set of reconfigurable fusion circuits (as described below), and a combination of switches and / or delay lines for delivering qubits from the resource state interconnect to the appropriate reconfigurable fusion circuit. Classical control logic may be used to control the switch settings of each qubit in each resource state generated and the configuration of each reconfigurable fusion circuit that receives the qubit, thereby operating the interleaving module or network of interleaving modules to provide a programmable quantum computer that executes a program, which may be specified using a fusion graph or other technique that specifies a set of operations for each resource state. More generally, interleaving modules may be used to perform various operations associated with creating and measuring entangled systems of qubits.

[0088]

[0126] 3.1. Circuit Components for Interleaving Module 3.1.1. Resource State Interconnect (RSI) In some embodiments, the interleaving module includes a resource state interconnect, also referred to herein as an “RSI circuit” or “RSI.” FIG. 14A shows a circuit symbol representing an RSI circuit 1490 in the drawings herein. The RSI circuit 1490 can be implemented using any circuit or component whose output is a resource state qubit (which, as previously described, is a quantum system of entangled qubits), with different output paths 1491 used to output different qubits of the resource state. In some embodiments, the RSI circuit 1490 can be implemented as a circuit or other hardware device that generates one resource state per cycle of an “RSI clock.” In other embodiments, the RSI circuit 1490 can be implemented as an input port that receives and distributes resource states generated by other hardware. For example, the RSI circuit 1490 can include a set of waveguides coupled at one end to an external circuit or component (not shown) that generates the resource state and at the other end to the output path 1491 of the RSI circuit 1490. Any combination of photonic waveguides, optical fibers, other waveguides, and / or other optical interconnects formed within an integrated circuit can be used. RSI circuit 1490 can receive resource states from an external resource state generating circuit and route qubits to respective output paths 1491 at a rate of one resource state per RSI clock cycle. In this manner, RSI circuit 1490 can serve as an input port of an interleaving module. For example, one or more photonic circuits that generate resource states can be implemented at locations separate from the interleaving modules, and the number of such circuits can be equal to or greater than the number of interleaving modules. Switching circuitry can be provided to selectively route a given resource state from the circuit in which it is generated to a particular RSI circuit 1490 within a particular interleaving module. Various circuits and combinations can be used, provided that during a given RSI clock cycle, each output path 1491 of RSI circuit 1490 provides a different qubit with the same resource state.

[0089]

[0127] The duration of an RSI clock cycle (also referred to herein as an "operational cycle" or simply a "clock cycle") can be selected as needed, provided that it is long enough to allow the circuitry that generates the resource state to complete the physical process that generates the resource state. In various embodiments, the operational cycle time may be about 1 ns or about 10 ns, although longer or shorter operational cycle times are not precluded.

[0090]

[0128] The particular size and entanglement shape of the resource state can be selected as a design parameter. In some cases, the optimal size may depend on the particular physical implementation of the qubit. For example, as previously described, a qubit can be implemented using photons propagating in a waveguide. The process used to generate the photons and create entanglement may be stochastic (i.e., the probability of successfully generating a photon in any given instance is significantly less than one). When qubit generation or entanglement is stochastic, multiplexing or other techniques can be used to increase the probability of generating (with each attempt) a resource state with a defined entanglement structure. Additionally, the size of the resource state can be selected for a particular implementation based in part on an acceptable error rate for resource state generation and the particular probability of generating a resource state with a specified entanglement structure. The examples described herein refer to resource states having six qubits associated with different directions in entanglement space (e.g., six-ring resource state 1100), and output paths 1491 of RSI circuit 1490 may be labeled with directions (U, D, E, W, S, N) to aid in visualization of the entanglement pattern. Such labels are not intended to specify a physical arrangement. It should be understood that other resource states may be used, and that resource states may have more or fewer qubits than six qubits and any desired entanglement structure. Each resource state provided to or by RSI circuit 1490 may be a distinct quantum system that is disentangled with other quantum systems. Entanglement between qubits from different resource states may be generated by operation of an interleaving module, as in the examples described below.

[0091]

[0129] For purposes of understanding this disclosure, it is sufficient to understand that the generation of resource states can occur within RSI circuit 1490 or within a separate circuit or system in which output qubits are provided to RSI circuit 1490, so long as RSI circuit 1490 is capable of outputting resource states at a rate of one resource state per RSI clock cycle. However, to provide further context, example techniques for generating resource states are now described.

[0092]

[0130] In some embodiments, resource states such as resource state 1100 can be generated using photonic and electronic circuits and components (e.g., of the type described in Section 1.3 above) to generate and manipulate individual photons. In some implementations, a resource state generator (which can be external or internal to RSI circuit 1490) can include one or more integrated circuits fabricated, for example, using conventional silicon-based technologies. The resource state generator can include a photon source or can receive photons from an external source. The resource state generator can also include photonic circuits implementing Bell state generators and fusion operations, as described above. To provide robustness, an external resource state generator can include multiple parallel instances of various photonic circuits with detectors and electronic control logic for selecting successful instances of resource states that propagate through RSI circuit 1490. Those skilled in the art will recognize various methods for constructing photonic resource state generators capable of generating resource states with desired entanglement shapes.

[0093]

[0131] In some embodiments, resource states can be generated using techniques other than linear optical systems. Various devices are known for generating and creating entanglement between systems of “matter-based” qubits, such as qubits implemented in ion traps, other qubits encoded in the energy levels of atoms or ions, spin-encoded qubits, superconducting qubits, or other physical systems. It is also understood in the art that quantum information is fungible, meaning that many different physical systems can be used to encode the same information (in this case, quantum states). Thus, in principle, it is possible to swap the quantum state of one system for another by inducing an interaction between the systems. For example, the state of a qubit (or collection of entangled qubits) encoded in the energy levels of atoms or ions can be swapped with electromagnetic fields (i.e., photons). It is also possible to use transducer technology to swap the state of a superconducting qubit with a photonic state. In some cases, the initial swap can be with photons at microwave frequencies. After the swap, the frequency of the photons can be increased to the operating frequency of the optical fiber or other optical waveguide. As another example, quantum teleportation can be applied between a matter-based qubit and a Bell pair, where one qubit of the Bell pair is a photon with a frequency appropriate for an optical fiber (or other optical waveguide), thereby transferring the quantum state of the matter-based qubit to a system of photonic qubits. Thus, in some embodiments, matter-based qubits can be used to generate resource states composed of photonic qubits.

[0094]

[0132] Switching Circuit FIG. 14B shows a symbol representing a switching circuit (or “switch”) 1480. The inputs and outputs to the switching circuit 1480 can include any number of qubits, and the number of inputs need not equal the number of outputs. The switching circuit 1400 can incorporate any combination of one or more active optical switches, mode couplers, phase shifters, etc. The switching circuit can be configured to perform active operations to reconfigure input modes (e.g., to effect a basis change of a qubit by coupling the modes of the qubit), change the input modes, and / or apply a phase to one or more of the input modes (which may affect subsequent coupling between the modes). In some cases, the switching circuit 1480 implements a routing switch that can couple an input qubit to one of two or more alternative output paths. In some embodiments, the operation of the switching circuitry 1480 (e.g., selection of routing paths) can be dynamically controlled in response to classical control signals 1481, and its state can be determined based on the results of previous operations, specific calculations to be performed, configuration settings, timing counters (e.g., for periodic switching), or any other parameters or information.

[0095]

[0133] Delay Circuit 14C shows a symbol for a delay circuit (also called a "delay line") 1470. The delay circuit delays the qubit for a fixed amount of time and can act as a memory for the quantum information stored in the qubit. The length of time (in clock cycles) is indicated by a number, L in this example, meaning a delay of L clock cycles. In the case of photonic qubits, the delay circuit can be implemented, for example, by providing one or more appropriate lengths of optical fiber or other waveguiding material so that the photons of the delayed qubit travel a longer path than the photons of the non-delayed qubit.

[0096]

[0134] 3.1.4. Reconfigurable fusion circuit FIG. 14D shows a simplified schematic diagram of a reconfigurable fused circuit 1400 according to some embodiments. The reconfigurable fused circuit 1400 receives two qubits on input paths 1402 and 1404. It should be understood that the qubits may be photonic qubits using dual-rail encoding (e.g., as described in Section 1.3 above), and each path shown in FIGS. 14A-14D may be implemented using a pair of waveguides. More generally, the number of waveguides corresponding to each path may be selected according to the particular photonic encoding of the qubits. Each qubit enters an active optical switch, with input path 1402 entering switch 1412 and input path 1404 entering switch 1414. Each of switches 1412 and 1414 may be a 1×5 routing switch that selectively routes the input to one of five possible output paths. Switch 1412 has output paths coupled to each of five “destinations”: fusion circuit 1420, Pauli-X measurement circuit 1431, Pauli-Y measurement circuit 1432, Pauli-Z measurement circuit 1433, and phase rotation circuit 1435, and provides its output to Pauli-Z measurement circuit 1436. Similarly, switch 1412 also has output paths coupled to each of five “destinations”: fusion circuit 1420, Pauli-X measurement circuit 1441, Pauli-Y measurement circuit 1442, Pauli-Z measurement circuit 1443, and phase rotation circuit 1445, and provides its output to Pauli-Z measurement circuit 1446. Pauli X, Y, and Z measurements are defined for a qubit, and each Pauli measurement circuit 1431-1433, 1436, 1441-1443, 1446 can include a basis rotation (for the X, Y, or Z basis, as needed), which can be implemented using mode couplers and phase shifters as described above, followed by a detector coupled to each mode. For example, if the qubit is represented by dual-rail encoding, a detector can be coupled to each end of the two waveguides representing the qubit. Measurement results can include the number of photons detected by each detector, or a binary signal from each detector indicating whether a photon was detected.

[0097]

[0135] Fusion circuit 1420 may be, for example, a Type II fusion circuit such as that described above with reference to Figures 9A and 9B. Fusion circuit 1420 may provide Pauli XX and ZZ joint measurements for pairs of input qubits, for example, using detectors 957 as shown in Figure 9A. As described above, each detector 957 may provide a classical output signal, which may be, for example, a binary logic signal indicating whether a photon is detected or a count of the number of photons detected.

[0098]

[0136] Each of the phase shift circuits 1435, 1445 is connected to a Pauli Z measurement circuit 1436, 1446 before iπ / 8 In some embodiments, this phase rotation path can be used to generate so-called "magic" states to support various implementations of FBQC. (Magic states and their applications in FBQC are further described in WO 2021 / 155289, referenced above.)

[0099]

[0137] The switches 1412, 1414 are controlled by classical control logic 1450. The classical control logic 1450 can be implemented as a digital logic circuit having an arrangement of classical logic gates (AND, OR, NOR, XOR, NAND, NOT, etc.), such as a field programmable gate array (FPGA) or system on a chip (SOC) with a programmable processor and memory, or on-chip hardwired circuitry, such as an application specific integrated circuit (ASIC). In some embodiments, the switches 1412, 1414 are coupled to an off-chip classical computer having a processor and memory, and the off-chip classical computer is programmed to perform some or all of the operations of the classical control logic 1450. In some embodiments, classical control logic 1450 (which may include an off-chip classical computer) may be provided with program code (which may be determined from the fusion graph as described above) indicating the type of measurement desired for each pair of qubits input to the reconfigurable fused circuit 1400, and the classical control logic 1450 may send control signals to switches 1412, 1414 to configure the reconfigurable fused circuit 1400 to perform the desired measurement at the desired time.

[0100]

[0138] The classical control logic 1450 can also receive classical output signals (measurement result data) from all of the measurement circuits 1431-1433, 1441-1443, 1436, 1446, and the fusion circuit 1420. In some embodiments, the classical control logic 1450 can execute decoding logic to interpret the results of the quantum computations based on the measurement result data, and in some cases the results of the decoding logic can be used as input to determine subsequent settings of the switches 1412, 1414. Additionally or alternatively, the classical control logic 1450 can provide the measurement result data to other systems or devices that can decode the measurement result data and / or perform other operations using the measurement result data.

[0101]

[0139] On the left side of FIG. 14D is shown a circuit symbol 1460 that will be used in subsequent figures to represent an example of a reconfigurable fused circuit 1400 .

[0102]

[0140] 3.2. Fully networked unit cell FIG. 15 shows a simplified schematic diagram of a "fully networked" implementation of unit cells for implementing fusion graphs according to some embodiments. x ×n y ) unit cells 1500 are connected to form a network array (or network) 1502, with connections between adjacent unit cells 1500 as shown. x ×n y can correspond to the layer dimensions in the fused graph. For example, for the fused graph of FIG. 13A, the layer dimensions are 36×18. In some applications, the layer dimensions may be much larger (e.g., 10 2 x10 2 or 10 3 x10 3 As with all schematic diagrams herein, it should be understood that the arrangement of components within the schematic diagram does not necessarily imply a particular physical arrangement of hardware components.

[0103]

[0141] Each unit cell 1500 may include an RSI circuit 1510, which may be an example of the RSI circuit 1490 in Figure 14A, and three reconfigurable fused circuits 1512a, 1512b, and 1512c, each of which may be an example of the reconfigurable fused circuit 1400 in Figure 14D. Each unit cell 1500 may also include a delay line 1514 that introduces a delay of one RSI cycle. The delay line 1514 may be implemented using a waveguide (e.g., an optical fiber) of an appropriate length, as previously described.

[0104]

[0142] As shown by the fusion graph 1520, the network array 1502 has dimensions n x ×n yA fusion graph can be implemented in which one layer 1520 having a qubit count is generated in each RSI cycle. In each unit cell 1500, a resource state having six qubits (labeled N, S, E, W, U, and D as in the diagram above) is provided by each RSI 1510 during each RSI cycle. Each qubit is provided on a separate output path to one of the reconfigurable fusion circuits 1512a-1512c or to an adjacent unit cell 1500. In the illustrated example, N qubits are provided to the unit cell 1500 adjacent in the N direction. The S qubit is provided to the reconfigurable fusion circuit 1512a, which also receives the N qubit from the unit cell 1500 adjacent in the S direction. Similarly, the W qubit is provided to the adjacent instance of the unit cell 1500 in the W direction. The E qubit is provided to the reconfigurable fusion circuit 1512b, which also receives the W qubit from the unit cell 1500 adjacent in the E direction. The U qubit is delayed by one RSI cycle using delay line 1514 and then provided to reconfigurable fused circuit 1512c during the next RSI cycle in synchronization with the D qubit in the resource state generated by the same RSI 1510. In some embodiments, the computation may be performed by controlling switches in each reconfigurable fused circuit 1512a-1512c in each unit cell 1500.

[0105]

[0143] 15, in some embodiments, single-photon measurement circuits (similar to Pauli measurement circuits 1431-1433 shown in FIG. 14D) may be coupled to the routing paths of unit cells 1500 at the boundary of network array 1502 to perform single-qubit measurements of qubits at the outer boundary of the fused graph. Other options for managing qubits at the outer boundary of the fused graph may also be provided.

[0106]

[0144] 3.3. Patch-based Layer Generation The fully networked configuration shown in Figure 15 is a network of dimension n x ×n y To generate a layer of x×n y A network array 1502 of unit cells 1500 is used. As previously mentioned, the layer dimensions may be very large and a significant amount of hardware may be required to implement the network array 1502. To reduce the amount of hardware required, the network array 1502 may be of dimension P=n for some integer k>1. x ×n y This can be modified to generate layers by generating a set of k "patches" of n. The total layer size is n x ×n y ×k.

[0107]

[0145] FIG. 16 shows a simplified fusion graph 1620 illustrating patch-based generation of layers using a network array of unit cells 1600 according to some embodiments. The fusion graph 1620 shows that each layer is generated over a set of k RSI cycles. The unit cells 1600 used to implement the fusion graph 1620 can be connected to a network similar to the network array 1502 of FIG. 15. The unit cell 1600 differs from the unit cell 1500 of FIG. 15 in that the 1-cycle delay line 1514 is replaced with a k-cycle delay line 1614, so that the U qubit is delayed until the RSI cycle in which the RSI 1610 generates the resource state for the corresponding position in the next layer.

[0108]

[0146] The fusion graph 1620 shows a set of k disjoint cuboids. In some embodiments, additional reconfigurable fusion circuits, switching circuits, and delay lines (not shown in FIG. 16) can be used to "stitch" adjacent patches of each layer together. Suitable circuits for implementing stitching between patches will become apparent in consideration of the following sections.

[0109]

[0147] 3.4. Network of Interleaved Modules According to some embodiments, an alternative approach to implementing the fusion graph involves the use of a network array of "interleaving modules," each of which has a L 2 Size L in RSI cycle 2 The interleaving module is configured to process consecutive patches of data, and patches generated by adjacent interleaving modules can be stitched together at their boundaries. The parameter L, sometimes referred to herein as the "interleaving length," can be selected as needed. Considerations for selecting the interleaving length are described below.

[0110]

[0148] FIG. 17 shows a simplified schematic diagram of a network of interleaving modules according to some embodiments. x ×n y ) interleave modules 1700 are connected to form a network array 1702, with adjacent interleave modules 1700 connected by delay lines 1730, 1740 as shown. Delay line 1730 connects an instance of interleave module 1700 to its neighbor in the W direction and introduces a delay of L RSI cycles. Delay line 1740 connects an instance of interleave module 1700 to its neighbor in the N direction and introduces a delay of L RSI cycles. 2 A delay of RSI cycles is introduced. A network array 1702 is used to x )×(L·n y ) can be generated.

[0111]

[0149] Each interleave module 1700 includes an RSI circuit 1710 that outputs or provides a resource state having six qubits (labeled N, S, W, E, D, and U) during each RSI cycle. Reconfigurable fusion circuits 1712a, 1712b, and 1712c, also referred to as "local" fusion circuits, may be examples of the reconfigurable fusion circuit 1400 of FIG. 14 and may be used to selectively perform fusion or single-qubit measurement operations on qubits in different resource states provided by the RSI circuits 1710 in the same interleave module 1700 during different RSI cycles. Additionally, further "network" fusion circuits 1712d and 1712e may be provided to enable entanglement between resource states provided by the RSI circuits 1710 in adjacent instances of the interleave module 1700. 14D that selectably perform fusion operations or single-qubit measurement operations on qubits in locally generated resource states and “networked” qubits received from adjacent instances of interleaving module 1700. Routing switches 1716a-1716d may be switching circuits (e.g., as described above) configured to selectively route N, S, W, and E qubits in particular resource states to one of local fusion circuits 1712a, 1712b (which receive qubits in different resource states provided by the same RSI circuit 1710 in different operating cycles) or to one of networked fusion circuits 1712d, 1712e (which receive qubits in different resource states provided by different RSI circuits 1710 in adjacent instances of interleaving module 1700).

[0112]

[0150] In this example, each interleave module 1700 builds a "row" of patches by progressing from W to E over L consecutive RSI cycles, then builds the next row in the S direction over the next L RSI cycles, and so on. Thus, delay line 1714a provides one RSI cycle of delay for the E qubit. If switch 1716d is set to select the narrow path (i.e., the path coupled to local fusion circuit 1712b) when the E qubit arrives, the E qubit in the first resource state output by RSI 1710 can arrive at narrow fusion circuit 1712b synchronously with the W qubit in the next resource state output by RSI 1710. Similarly, delay line 1714b provides L RSI delay cycles for the S qubit. If switch 1716b is configured to select the narrow path (i.e., the path coupled to local fusion circuit 1712a) when S qubits arrive, then S qubits in a first resource state output by RSI 1710 can arrive at narrow fusion circuit 1712a synchronously with N qubits in another resource state output by a later RSI cycle of RSI 1710L, thereby enabling a fusion operation between qubits in resource states corresponding to adjacent lattice positions in different rows. As previously mentioned, interleaving module 1700 is configured to select the narrow path (i.e., the path coupled to local fusion circuit 1712a) when S qubits arrive. 2 The delay line 1714c constructs a patch for the layer in the RSI cycle. Thus, the delay line 1714c transmits the L 2 RSI 1710 provides RSI delay cycles so that the U qubit in a resource state output by RSI 1710 arrives at fused circuit 1712c in sync with the D qubit in a different resource state output by RSI 1710 for the corresponding position in the next layer.

[0113]

[0151] Networked fusion circuits 1712d, 1712e can each receive a “local” qubit output by a local RSI 1710 (i.e., an RSI 1710 in the same interleave module with networked fusion circuits 1712d, 1712e) and a “network” qubit from an adjacent interleave module 1700, thereby allowing patches generated by different interleave modules 1700 to be “stitched” together by a fusion operation. The networked qubits can pass through delay lines 1730, 1740. Thus, for example, a networked qubit from an adjacent interleave module 1700 in the E direction can arrive at networked fusion circuit 1712d synchronized with a “local” E qubit in an adjacent resource state in the fusion graph.

[0114]

[0152] In this way, each interleave module 1700 can execute consecutive patches within each layer of the fusion graph, and patches executed by different interleave modules 1700 can be stitched together at their boundaries. In some embodiments, the order of operations of each interleave module 1700 can be specified using "interleave coordinates" assigned to vertices in the fusion graph. The interleave coordinates can specify a layer number, a patch number within the layer (which identifies which interleave module executes the patch), and a cycle number within the patch (which identifies the order of processing vertices or resource states within the patch). Figure 18A shows the assignment of interleave coordinates to vertices in a single layer 1800 of a fusion graph according to some embodiments. In this example, the interleave length L is 4, and there are four interleave modules 1700 connected in a 2x2 network array. Therefore, the layer dimensions are 8x8. As indicated by the increasing numbers within each patch, NW patch 1801 is assigned to the first interleave module 1700, NE patch 1802 is assigned to the second interleave module 1700, SW patch 1803 is assigned to the third interleave module 1700, and SE patch 1804 is assigned to the fourth interleave module 1700. Within each patch 1801-1804, vertices are numbered 1-16 to identify the RSI cycle in which the resource state corresponding to the vertex is generated. Thus, during RSI cycle 1, the NW most vertices within each patch 1801-1804 are generated, during RSI cycle 2, the vertex adjacent in the E direction is generated through RSI cycle 4, and so on. During RSI cycle 5, the vertex adjacent in the S direction to the NW most vertices within each patch is generated, and so on. For convenience, the WE direction may be referred to as "rows" and the NS direction as "columns."

[0115]

[0153] Delay lines 1730, 1740 connected between instances of interleave module 1700 can provide appropriate delays so that the resource state qubits generated by adjacent instances of interleave module 1700 arrive synchronously at networked fusion circuits 1712d, 1712e. For example, during RSI cycle 1, RSI circuit 1710 in second interleave module 1700 (assigned to NE patch 1802) outputs a resource state having W qubits that are routed by switch 1716c onto a network path into delay line 1730. In this example, delay line 1730 adds L=4 RSI delay cycles, such that the W qubits arrive at networked fusion circuit 1712e of first interleave module 1700 (assigned to NW patch 1801) during RSI cycle 5. Meanwhile, during RSI cycle 4, RSI circuit 1710 in first interleave module 1700 outputs a resource state having E qubits delayed by one RSI cycle by delay line 1714a. During the next RSI cycle (cycle 5), the delayed E qubits are routed by switch 1716d to networked fusion circuit 1712e. Thus, qubits from resource states output by RSI circuits 1710 in different interleave modules can be properly synchronized across patch boundaries. Similar considerations apply for patch boundaries in the N-S direction.

[0116]

[0154] In some embodiments, the delay lines 1730, 1740 can be omitted. For example, FIG. 18B illustrates an alternative assignment of interleaving coordinates to vertices in a layer 1820 of a fused graph according to some embodiments. This notation is similar to that of FIG. 18A, except that different interleaving modules 1700 are identified using letters A, B, C, and D, which indicate interleaving modules configured somewhat differently from one another, as will be apparent. Layer 1820 is also illustrated as being larger than 8x8 to illustrate how the pattern can be extended to an interleaving module network of any size. As indicated by the cycle number at each vertex, interleaving module A begins with the NW most resource states in patch 1821, proceeds along the rows in the E direction, then proceeds to the next row in the S direction (as in FIG. 18A). Interleaving module B begins with the most resource states in patch 1822, proceeds along the rows in the W direction, then proceeds to the next row in the S direction. Instance C of interleave module 1700 starts with the SW-most resource state in patch 1823, proceeds along the rows in the E direction, then proceeds to the next row in the N direction. Instance D of interleave module 1700 starts with the SE-most resource state in patch 1823, proceeds along the rows in the W direction, then proceeds to the next row in the N direction. As the cycle numbering indicates, whenever adjacent resource states are output by RSI circuit 1710 in different instances of interleave module 1700, those resource states are output in the same RSI cycle, and delay lines on the network paths connecting different interleave modules can be omitted. In this case, interleave modules of types A, B, C, and D are configured with internal delay lines in different positions depending on the direction across the patch. For example, if a type A interleaving module (which may be implemented as shown for interleaving module 1700 in FIG. 17) delays the E qubits in the resource state by one RSI cycle, a type B interleaving module will instead delay the W qubits in the resource state by one RSI cycle.Similarly, rather than delaying S qubits, a type C interleaving module delays N qubits by L cycles. Appropriate modifications to interleaving module 1700 to delay the appropriate qubits are straightforward. Inset 1830 shows that the ABCD pattern of patches can be repeated to support larger networks with more interleaving modules without the use of delay lines on the network paths.

[0117]

[0155] 4. FBQC using interleaving module In some embodiments, FBQC can be implemented using the network array 1702 of the interleaving module 1700. For example, the network array of the interleaving module can be used to perform the computations represented by the fusion graphs of Figures 13A-13C.

[0118]

[0156] As an example, Figure 19A shows a diagram of the representative layer 1304 of Figure 13C with interleave coordinates overlaid, according to some embodiments. In this example, the network array 1700 is assumed to have dimensions of 6x3 and an interleave length L = 6. The interleave coordinates are assigned similarly to Figure 18A, proceeding from W to E and N to S within each patch.

[0119]

[0157] 19B shows a detailed view of patch 1908 of FIG. 19A. As can be seen, the patch boundary need not align with the logical qubits or any other boundaries in the fused graph. (In other words, code distance and interleave length need not have any particular relationship.) In some embodiments, patch 1908 can be interpreted as a series of instructions for setting the states of switches 1716a-1716d and reconfigurable fused circuits 1712a-1712e of interleave module 1700 during each RSI cycle. For example, during each RSI cycle, the states of switches 1716a-1716d, which control whether a qubit is routed to local fused circuits 1712a-1712b, networked fused circuits 1712d-1712e, or network delay lines 1730, 1740, can be determined from the interleave coordinates associated with the current RSI cycle. The state of each reconfigurable fused circuit 1712a to 1712e (each of which may be an example of the reconfigurable fused circuit 1400 in FIG. 14) may be determined based on the connectivity between vertices for the resource states at their interleaved coordinates.

[0120]

[0158] 20 shows a table 2000 illustrating settings of the switches 1716a-1716d and reconfigurable fused circuits 1712a, 1712b, 1712d, 1712e of the interleave module 1700 that can be determined from the patch 1908 according to some embodiments. The qubits propagating through the switches 1716a-1716d and reconfigurable fused circuits 1712a, 1712b, 1712d, 1712e during a given RSI cycle are identified by an alphanumeric designation, such as N1 or W34, where the letter is the qubit's direction label (as used throughout this description) and the number indicates the RSI cycle in which the resource state containing that qubit was output by the RSI 1710. Qubits marked with a prime number (e.g., W' or N") are networked qubits received over a network path from a neighboring interleaving module 1700. Table cells shaded in gray indicate operations related to resource state generated during the processing of a previous layer. There need not be any "dead" time between layers; all 36 (or, more generally, all L) associated with a layer in the fusion graph 2 It should be noted that after generating the resource states, the interleaving module 1700 can immediately begin generating resource states associated with the next layer of the fused graph.

[0121]

[0159] For each RSI cycle, the state of each switch is indicated by the qubit identifier of the qubit propagating through the switch and either “net” or “local” to indicate whether the switch is set to select that qubit’s “network” or “local” output path (as shown in FIG. 17). The state of each reconfigurable fused circuit is indicated by an operation, either “F()” for fusion or “m()” for single-qubit measurement, where the operand is the qubit identifier. In this example, the type of single-qubit measurement (Pauli X, Y, or Z) is not specified. In some embodiments, the type of single-qubit measurement can be specified or inferred from the fusion graph. As shown in FIG. 14D, the selection of the operation of the reconfigurable fused circuit can be controlled by selecting the corresponding state of switches 1412, 1414.

[0122]

[0160] As shown, for the resource states output by RSI circuit 1710 during cycles 1 and 2, all qubits are routed to a fusion operation with appropriate qubits in other resource states. (For qubit W1, a network fusion operation is selected.) For the resource states generated during cycles 3 and 4, qubit E3 and qubit W4 are sent to single-qubit measurements according to the half-lines in patch 1908. Switch settings for other RSI cycles can similarly be determined based on the fusion graph.

[0123]

[0161] The state of U / D reconfigurable fused circuit 1712c is not shown in Figure 20. In this example, U / D fused circuit 1712c can perform fusion operations for each layer except for the D qubits in the first layer and the U qubits in the last layer, from which single qubit measurements can be selected. Delay line 1714c is connected to L 2 A delay (in this case, 36 RSI cycles) is provided so that U / D fusion circuit 1712 fuses the U1 qubit in one layer with the D1 qubit in the next layer. In some embodiments, other behaviors can be implemented, and the operation of each U qubit and D qubit can be determined from the fusion graph.

[0124]

[0162] As this example illustrates, switch settings of an interleave module having a reconfigurable fused circuit can be determined based on a fusion graph. Thus, a data structure representing the fusion graph can be provided as an input to classical control logic, which can determine the corresponding sequence of switch settings and control the operation of the networked array of interleave modules to perform the computation specified by the fusion graph. Other inputs can also be provided, including a set of instructions that enumerate the settings for each operating cycle.

[0125]

[0163] It should be understood that layers of any size can be generated using the network of interleaving modules shown in Figure 17. (In some embodiments, the size may be fixed in the hardware design.) The number of interleaving modules (N) and the interleaving length L can be varied as desired, and in extreme cases, N can be reduced to 1. For a given layer size, different choices of N and L will result in different computation times, and a choice can be made to achieve a desired balance between hardware size and computation speed.

[0126]

[0164] 5. Interleaving module with additional functionality In the preceding examples, it is assumed that the fusion graph can be based on a regular bulk lattice in entanglement space. For example, the fusion graphs described above have a structure that can be represented as layers, with each layer having an associated regular array (or 2D lattice) of resource states. For some logical operations, it may be desirable to introduce irregularities at selected locations within the lattice ("irregularities" or "defects" are used in this context to refer to variations from the bulk lattice that alter the number of resource states (or vertices) within a layer). By way of example, FIGS. 21A and 21B show example fusion graphs for operations that alter the lattice structure. In these examples, only portions of the fusion graphs corresponding to specific operations are shown. It should be understood that these operations can be combined into larger fusion graphs in which the illustrated operations create irregularities in the bulk lattice, as shown, for example, in fusion graph 1240c of FIG. 12D.

[0127]

[0165] Figure 21A shows a fusion graph 2100 for a "twist" operation. Ten resource states (vertices 2102 shown as circles) are involved in the twist operation, with five vertices 2102 in each of two different layers along the UD axis. As with the previous fusion graph, a line 2104 connecting two vertices indicates a Type II fusion operation, and a half-line 2106 connected to a single vertex indicates a single-qubit Pauli measurement. (The shading is the same as legend 1250 in Figure 12E.) In this case, the single-qubit measurement (half-line 2106) is a Pauli Y measurement. Two "X" marks 2110 correspond to lattice positions "skipped" by the twist operation. That is, qubits from any resource states that may be associated with the skipped positions 2110 are not affected by the fusion or other measurement operations.

[0128]

[0166] Figure 21B shows a fusion graph 2150 for a "transpose" operation, using the same notation as Figure 21A. The EW fusion operation associated with the transpose operation involves eight resource states (vertices 2152). However, the transpose operation combines resource states that are not in adjacent grid positions in the EW direction. Four grid positions are skipped by the transpose operation, as indicated by the "X" 2160.

[0129]

[0167] Whether a resource state is generated for a skipped lattice position 2110 or 2160 is a matter of design choice, so long as any qubit associated with the skipped lattice position does not interact with other qubits. In some embodiments, generation of a resource state for a skipped position 2110 can be prevented or avoided (e.g., by not providing the resource state to the RSI circuitry during the corresponding RSI cycle, or by not triggering the RSI circuitry to generate the resource state during the corresponding RSI cycle). In other embodiments, a resource state for a skipped position 2110 may be generated, and then its qubit may be absorbed. For example, the RSI circuitry may include a “terminal” routing path that terminates in an opaque material, and a routing switch for selectively routing the qubit to either the terminal routing path or an appropriate output path.

[0130]

[0168] According to some embodiments, the interleaving module may include additional circuitry to support operations such as twists and transpositions. FIG. 22 shows a simplified schematic diagram of an interleaving module 2200 according to some embodiments. The interleaving module 2200 may be similar in structure and operation to the interleaving module 1700, with additional routing options for the E and W qubits. Reconfigurable fusion circuits 2212a, 2212b, and 2212c, also referred to as "local" fusion circuits, may be instances of the reconfigurable fusion circuit 1400 of FIG. 14D and may be used to selectively perform fused or single-qubit measurements on qubits in resource states output by the RSI circuit 2210 within the interleaving module 2200 in different RSI cycles. Additionally, additional "network" fusion circuits 2212d and 2212e may be provided to enable entanglement between resource states provided by RSI circuits in adjacent instances of the interleaving module 2200. Networked fusion circuits 2212d and 2212e may be further instances of reconfigurable fusion circuit 1400 of Figure 14D that selectably perform fusion operations or single-qubit measurements on qubits in locally generated resource states and networked qubits received from different instances of interleaving module 2200. Reconfigurable fusion circuit 2212f, also referred to as a "local delay" fusion circuit, may be another example of reconfigurable fusion circuit 1400 of Figure 14D and may be used to generate lattice dislocations and twist defects of the types shown in Figures 21A and 21B. Routing switches 2216a and 2216b, similar to routing switches 1716a and 1716b of interleaving module 1700 of Figure 17, may be reconfigurable optical switching circuits that operate to selectively route N and S qubits in particular resource states to one of local fusion circuit 2212a or networked fusion circuit 2212d. Routing switches 2216c and 2216d may be reconfigurable optical switching circuits that operate to select one of three output paths for the W and E qubits.If a regular lattice is being processed, routing switches 2216c and 2216d can route the W and E qubits to one of local fused circuit 2212b or networked fused circuit 2212e, similar to routing switches 1716a and 1716b of interleaving module 1700 of Figure 17. If a lattice defect (e.g., a dislocation or a twist) is being processed, routing switches 2216c and 2216d can instead select a "local delay" path. In the local delay path, the E qubit (already delayed by one RSI cycle by delay line 2214a) can be delayed by an extra RSI cycle by delay line 2224 and then provided to reconfigurable fused circuit 2212f. The W qubit is supplied to the reconfigurable fusion circuit 2212f without further delay, so that the reconfigurable fusion circuit 2212f operates with the W qubit from the current resource state and the E qubit from the resource state output two cycles ago, thereby performing a "skip" as shown in Figures 21A and 21B.

[0131]

[0169] The operation of the interleaving module 2200 may be similar or identical to the operation of the interleaving module 1700 described above, except that the interleaving module 2200 may support the operation of introducing lattice defects.

[0132]

[0170] In the illustrated example, interleaving module 2200 can introduce irregularities in the EW direction. If the ability to introduce lattice irregularities in more than one direction is desired, similar routing paths, delay lines, and reconfigurable fusion circuits can be provided for multiple directions, including the NS and / or UD directions.

[0133]

[0171] 6. Improved computational efficiency In some embodiments, a network array of interleaving modules (e.g., array 1702 of FIG. 17) can provide a general-purpose quantum computer capable of performing any quantum computation that can be represented using a fused graph. (Interleaving module 1700 can be used to perform any quantum computation whose fused graph does not include lattice defect operations, as previously described. Interleaving module 2200 or other variations can be substituted for array 1702 as desired.) Any number of interleaving modules can be included in the network array, with each interleaving module having a desired size L 2 For the present purposes, we assume that the delay line is a fixed length structure whose length is determined based on the interleaving length L.

[0134]

[0172] For a network with a fixed number of interleaving modules, using a larger L can increase the number of logical qubits that can be encoded (for a given code distance). However, the larger L, the slower the logical operations can be expected to be. In this sense, there is a design trade-off between space (or hardware) and time. For a given quantum computation and a fixed number of interleaving modules, based on the number of logical qubits that need to be encoded and the code distance, some minimum interleaving length L can be chosen to perform the computation. min At the same time, a larger L means a longer delay line, which in turn may mean increased propagation loss in the delay line (because existing optical fibers and other waveguides are not perfectly transparent), and at some point the interleaving length must reach a threshold (L max) It is possible to reach L min L max If the interleaving length L exceeds L, it is necessary to add an additional interleaving module to perform quantum computation. Therefore, the selected interleaving length L is min and L max In some embodiments, L=L minmay be the optimal choice. However, in some embodiments, additional physical qubits can be used to reduce the overall volume of the quantum computation (which can be measured by the size of the fused graph) by exploiting a space-time tradeoff better than linear. In this case, interleaving can increase the execution speed of the quantum computation compared to a non-interleaved approach (e.g., the fully networked unit cell of FIG. 15). Furthermore, because interleaving slows the speed of logical operations, increasing L can reduce the speed of classical processing needed to keep up with the logical operations. For example, conditional logic may require a classical processor to receive and decode a first set of measurements corresponding to a first logical operation to determine the subsequent logical operation to be performed. If the decoder is slower than the rate at which it can execute the logical operations, the computation may stall or slow down. In various embodiments, the interleaving length L can be optimized for a particular hardware implementation based on the aforementioned design considerations and / or other considerations.

[0135]

[0173] 7. Improved connectivity In the examples described above, logical qubits can be represented using square surface codes that map well to planar topologies. For example, the fused graph of FIG. 13A can be viewed as a series of planar layers connected by fusion operations between successive layers. However, in some cases, fused graphs using different topologies can enable more compact logical operations, and compactness can be defined in terms of the volume of the fused graph corresponding to the logical operation. In some embodiments, the network of interleaving modules can have additional connections to support the implementation of more compact fused graphs. Examples are provided below.

[0136]

[0174] 7.1. Moving a Logical Qubit One example where a planar representation can be volume-intensive is when "moving" a logical qubit, a logical operation in which a bulk lattice region representing the logical qubit is shifted from one region to another in the fused graph. For example, a logical qubit may need to be shifted to an adjacent region so that a two-qubit logical operation can be performed between them. Figure 23A shows an example of a fused graph 2300 for moving a logical qubit from a source region 2302 to a destination region 2304. The logical qubits are stationary (not interacting), and the fused graph 2300 represents a regular bulk lattice with single-qubit measurements at the boundaries. In this example, there is an intermediate layer 2306 (along the UD direction) associated with the move operation that simply teleports quantum information to the next layer, which may require additional computation time. Figure 23B shows a fused graph 2350 for a more efficient implementation of the move operation for logical qubits. In fusion graph 2350, quantum information is shifted from W to E by a desired number of lattice positions in a single step along the UD axis using a fusion operation between U qubits in the U-most layer of source region 2352 and D qubits in the D-most layer of destination region 2354.

[0137]

[0175] According to some embodiments, this type of “fast” movement operation can be implemented using an interleaving module by adding additional routing switches for the U and D qubits. FIG. 24 shows a simplified schematic diagram of an interleaving module 2400 according to some embodiments. Interleaving module 2400 may be similar to interleaving module 2200 (or interleaving module 1700) with the addition of routing switches and networked fusion circuitry for the U and D qubits, as shown. The routing switches and fusion circuitry for the N, S, E, and W qubits are not shown in FIG. 24; these components and their operation may be similar or identical to the components shown in FIG. 17 or FIG. 22. As shown in FIG. 24, interleaving module 2400 may include an RSI circuit 2410, which may be identical to other RSI circuits described herein. Similar to interleaving module 1700, the U qubits in each resource state are routed to a delay line 2414c, which in turn routes the L qubits to the U qubits. 2 17) or to network path 2430′, which connects to an instance of interleaving module 2400 elsewhere in the network array. Routing switch 2416f operates to deliver the (delayed) U qubits to either local fusion circuit 2412c or networked fusion circuit 2412f. Networked fusion circuit 2412f may be an instance of reconfigurable fusion circuit 1400 of FIG. 14 that operates on the U qubits delivered by routing switch 2416f and the D qubits received via network path 2430′ from another instance of interleaving module 2400 elsewhere in the network.

[0138]

[0176] 25 shows a simplified schematic diagram of network paths 2430 and 2430′ connectivity between interleave modules 2400 in a network array according to some embodiments. A network array 2502 of interleave modules 2400 is shown. In this example, network paths 2430 transfer qubits between adjacent instances of interleave modules 2400. This allows logical qubits to be shifted by one interleave length L in the E direction in successive layers. Connectivity can be changed as desired to support larger shifts and / or shifts in different directions between successive layers.

[0139]

[0177] 7.2. Periodic boundary conditions The above example uses a square surface code patch, with each logical qubit mapped to a d×d lattice in a planar layer. However, embodiments are not limited to square surface codes or planar codes. For example, toric codes can be defined by creating periodic boundary conditions in each layer. Figures 26A-26D are conceptual diagrams of toric codes with periodic boundary conditions. Figure 26A shows a planar layer 2600 with boundaries 2602, 2603, 2604, and 2605, which can be associated with the N, E, W, and S directions in entangled space. To create a periodic boundary condition in the EW direction, a fusion operation 2610 can be performed between the E qubit in the resource state along boundary 2605 and the W qubit in the resource state along boundary 2604, as shown in Figure 26B. To create a periodic boundary in the N-S direction, a fusion operation 2612 can be performed between the N qubit in the resource state along boundary 2602 and the S qubit in the resource state along boundary 2603, as shown in Figure 26C. Figure 26D shows how the toric code of Figure 26C can be mapped to a set of four planar patches 2621, 2622, 2623, 2624 using fusion operations between resource states at the boundaries of different patches (shown by curves 2631, 2632, 2633, 2634).

[0140]

[0178] According to some embodiments, toric codes can be implemented using a network array of interleaving modules, such as interleaving module 1700 (or interleaving module 2400). Figure 27 shows a simplified schematic diagram of a network array of interleaving modules 2702 according to some embodiments. Network array 2702 can be generally similar to network array 1702, and interleaving module 2700 can be generally similar to any of the interleaving modules previously described. However, in network array 2702, each interleaving module 2700 on the E-edge of array 2702 is connected to a corresponding interleaving module on the W-edge of array 2702 by path 2730, and each interleaving module on the N-edge of array 2702 is connected to a corresponding interleaving module on the S-edge of array 2702 by path 2740. The generation of the toric code can be performed using appropriate time delays, with each interleaving module 2700 generating one of the patches 2621-2624 shown in Figure 26D.

[0141]

[0179] These examples of additional connectivity between interleave modules are illustrative, and variations and modifications are possible. In various embodiments, connections between spatially separated interleave modules can facilitate routing of logical qubits within a quantum computer. For example, some architectures may include different logical units responsible for different types of operations, and logical qubits may need to be moved from one logical unit to another. Non-local spatial connections between interleave modules allow logical qubit movement to be performed efficiently. The particular type and number of connections between interleave modules can be adapted to suit a particular architecture and fused graph topology.

[0142]

[0180] 7.3. Non-Euclidean Geometry In the above example, a network array is formed by connecting interleave modules such that every interleave module has unique neighbors (or possibly no neighbors) in each of the N, E, W, and S directions. In some embodiments, adding more selectable routing paths and reconfigurable fusion devices can perform network fusion between qubits generated by different (but fixed) combinations of interleave modules. By way of example, FIG. 28 shows a simplified schematic diagram of an interleave module 2800 according to some embodiments. Interleave module 2800 can be similar to interleave module 2400 of FIG. 24, except that routing switch 2816e provides three or more output paths. The local path delivers D qubits to local fusion circuit 2412c. The other paths are alternative network paths 2830a-2830c, each of which can be coupled to a different instance of interleave module 2800. Similarly, a further “U-net” switch 2832 is provided to select among alternative networked D qubits received via network paths 2830d-2830f. The alternative networked D qubits may be from resource states generated in other interleaving modules 2800. The selected networked D qubits are provided to networked fusion circuit 2412f. Operation may be similar to interleaving module 2400, with additional routing paths allowing logical qubits to be selectively moved in different directions and / or different distances between adjacent layers and / or delayed by different numbers of RSI cycles. It should be understood that the alternative network paths are not limited to U and D qubits, and that any routing switch in an interleaving module may be selectively coupled to any number of network paths. Similarly, switches such as U-net switch 2832 may be provided to select among any number of input network paths.

[0143]

[0181] In some embodiments, one or more routing switches in the interleaving module can enable selection not only between different network paths, but also between different local paths that couple to delay lines of different lengths and / or different reconfigurable fused circuits in the interleaving module. Appropriate combinations of local and network routing paths can enable more complex surface codes and / or other potential efficiencies.

[0144]

[0182] 29A and 29B show two examples of fused graphs for star-shaped surface code patches 2900 and 2920. Star-shaped surface code patches can be understood as n-gonal generalizations of triangular (n=3) and square (n=4) surface code patches. In star-shaped surface code patch 2900, n=8. For large n, star-shaped surface code patches use approximately half the number of physical qubits per logical qubit as square surface code patches. However, the shape of star-shaped surface code patches makes them difficult to implement with a regular two-dimensional array of physical qubits.

[0145]

[0183] According to some embodiments, a star-shaped surface code patch can be implemented using an interleaving module with switchable network connections. Figures 30A and 30B show an example of a connectivity structure supporting a star-shaped surface code patch that can be implemented using a network of interleaving modules according to some embodiments. Figure 30A shows the decomposition of a star-shaped surface code patch 2900 into a triangular truncated grid pattern 3002 that repeats eight times. Connectivity (fusion operations) between instances of pattern 3002 is shown as lines 3004. It should be understood that arrows 3003 at the left and right edges indicate periodic boundary conditions. Additionally, a "backbone" 3008 (corresponding to the central portion of star-shaped surface code 2900) is connected to each instance of pattern 3002.

[0146]

[0184] Figure 30B shows the decomposition of the star surface code patch 2920 into a triangular truncated grid pattern 3022 that repeats eight times. A "double backbone" 3028 connects each instance of the grid pattern 3022. It should be understood that the arrows 3023 on the left and right edges indicate periodic boundary conditions. In Figure 30B, interleaved coordinates (numbered 1-8) are assigned to each vertex to suggest interleaved patterns that can be used to generate the star surface code patch 2900.

[0147]

[0185] Figure 31 shows a simplified schematic diagram of a network array 3102 of interleaving modules 3100 that can be used to generate the grid pattern shown in Figure 30B in accordance with some embodiments. Each interleaving module 3100 can be similar to the interleaving modules previously described and can include switchable network connections (e.g., similar to those shown in Figure 28) to enable desired connections. Lines 3130 connecting the interleaving modules 3100 represent selectable network paths between different instances of the interleaving modules 3100.

[0148]

[0186] It will be appreciated that the various surface topologies described herein are exemplary and that appropriately connected interleaving modules can implement a wide variety of surface codes.

[0149]

[0187] 8. Computational system for realizing FBQC FIG. 32 illustrates an example system architecture for a quantum computer system 3200 capable of implementing FBQC according to some embodiments. Using photonic physics qubits, some embodiments of the quantum computer system 3200 can generate measurement data reflecting an entanglement structure (e.g., a fused graph) for fault-tolerant FBQC. The system 3200 includes classical control logic 3210, a resource state generator 3202, and a network 3212 of interleaving modules 3220. For clarity of illustration, classical signal paths 3232-3237 are shown connected to only one instance of the interleaving module 3220. It should be understood that the classical control logic 3210 can communicate with components within each instance of the interleaving module 3220 in a manner described herein.

[0150]

[0188] The classical control logic 3210 can be implemented as a digital logic circuit having an arrangement of classical logic gates (AND, OR, NOR, XOR, NAND, NOT, etc.), such as a field programmable gate array (FPGA) or system on a chip (SOC) with a programmable processor and memory, or on-chip hardwired circuitry, such as an application specific integrated circuit (ASIC). In some embodiments, the classical control logic 3210 (or a portion thereof) can be implemented in an off-chip classical computer with a processor and memory, which can be programmed to perform some or all of the operations of the classical control logic 3210.

[0151]

[0189] In operation, classical control logic 3210 (which may include a classical computer) may receive "program code" 3201 that specifies a quantum computation to be performed. For example, the program code may include a machine-readable data file that defines a fusion graph such as that shown in the figure above. Classical control logic 3210 may read the program code and generate control signals for resource state generator 3202 and interleaving module 3220 to perform the computation.

[0152]

[0190] Resource state generator 3202 may include any circuitry or other component capable of generating resource states, which may be a system of photonic qubits (e.g., using dual-rail encoding as described above). For example, resource state generator 3202 may be an implementation of qubit entanglement system 1000 of FIG. 10. In various embodiments, resource state generator 3202 may generate six-ring resource states or other resource states with an appropriate number of qubits and entanglement patterns. In some embodiments, resource state generator 3202 may be reconfigurable to generate resource states with different entanglement patterns during different operating cycles, and classical control unit 3210 may send classical control signals to resource state generator 3202 via signal path 3230, e.g., to start and stop resource state generation and / or to select the number or type of resource states to generate during each operating cycle. In some embodiments, resource state generator 3202 can succeed in generating the desired number of resource states for a given operating cycle with a probability less than one, and resource state generator 3202 can provide a classical herald signal to classical control logic 3210 via signal path 3231. The classical herald signal can include, for example, a signal from a detector associated with the reported photon source and / or an entanglement generation circuit, such as a Bell state generator and / or the fusion circuit described above. Classical control logic 3210 can use the herald signal received via signal path 3231 to determine whether each instance of resource state generation was successful or failed. For example, a particular pattern of the presence or absence of photons in a detector can indicate success or failure. In some embodiments, resource state generator 3202 can be maintained at cryogenic temperatures (e.g., 4 K), while interleaving module 3220 can operate at higher temperatures (e.g., 300 K). The resource state generator 3202 may be coupled to the interleave module network 3212 using optical fiber or other waveguides and may provide each interleave module 3220 with one resource state per operating cycle.

[0153]

[0191] Each interleave module 3220 may be an instance of interleave module 1700 of FIG. 17, interleave module 2400 of FIG. 24, or any other interleave module, including any of the examples described above. As shown in FIG. 32, each interleave module 3220 may include an RSI circuit 3222, a set of routing switches 3224, and a set of reconfigurable fusion circuits 3226. The details of the coupling between components within each interleave module 3220 and between interleave modules 3220 are not shown in FIG. 32. It should be understood that any of the coupling schemes described above, or other schemes that support the implementation of fusion graphs having particular topological forms, may be used.

[0154]

[0192] Each RSI 3222 can receive resource states as described above. In some embodiments, the RSI 3222 can operate autonomously without requiring data input, and each RSI 3222 circuit can receive one resource state per operating cycle (also called an RSI cycle or clock cycle). Any of the RSI circuit configurations described above or other configurations can be used. If desired, resource state generation can be performed internal to each RSI 3222 rather than in a separate resource state generator 3202.

[0155]

[0193] An optical fiber (or other waveguide) 3242 may be used to couple each RSI 3222 to its associated routing switch 3224. In some embodiments, the optical fiber (or other waveguide) 3242 may introduce appropriate relative delays in the propagation paths of different qubits of the same resource state. For example, the optical fiber 3242 may implement delay lines 1714a-1714c shown in FIG. 17.

[0156]

[0194] Classical control logic 3210 may generate control signals for routing switches 3224 in each instance of interleave module 3220 and send the control signals to routing switch 3224 via classical signal path 3234. As previously mentioned, in some embodiments, routing switch 3224 may route qubits from RSI 3222 to either local path 3244a or network path 3244b. Local path 3244a and network path 3244b forward qubits to reconfigurable fused circuit 3226. As previously mentioned, local path 3244a connects to reconfigurable fused circuits 3226 in the same interleave module 3220, and network path 3244a connects to reconfigurable fused circuits 3226 in a different interleave module 3220. For clarity of explanation, FIG. 32 shows one local path and one network path, but it should be understood that multiple paths of either type may be provided, and that routing paths for different qubits in a given resource state may be selected independently of each other. In some embodiments, the classical control logic 3210 can select routing paths and corresponding control signals for the routing switch 3224 based on a fused graph representation of the quantum computation. An example of a cycle-by-cycle configuration of the routing switch to execute the fused graph was described above in connection with Figures 19A, 19B, and 20. Other selection logic can also be implemented.

[0157]

[0195] In some embodiments, the set of all routing switches 3224 across all instances of interleave module 3212 can provide a fused network router 3250. In some embodiments, the fused network router 3250 can be a reconfigurable fused network router that supports different layer topologies, including the examples described above, without requiring modifications to the underlying hardware. For example, as described above with reference to FIG. 28 , an alternative network routing path 3244b can be provided between a routing switch 3224 in one interleave module 3220 and a reconfigurable fused circuit 3226 in each of two or more other interleave modules 3220. In various embodiments, a network routing path can be provided between any routing switch and any reconfigurable fused circuit. In the extreme case, all routing switches can be connected to all reconfigurable fused circuits; however, for a fused graph with a regular lattice structure (as in the example described above), not all possible connections are useful, and the set of local paths 3244a and network paths 3244b in a given implementation can be based on the fused graph topology that system 3200 is intended to support.

[0158]

[0196] Classical control logic 3210 may also generate control signals for reconfigurable fused circuit 3226 in each instance of interleave module 3220 and send the control signals to reconfigurable fused circuit 3226 via classical signal path 3236. As previously mentioned, in some embodiments, each reconfigurable fused circuit 3226 may be an implementation of circuit 1400 of FIG. 14D operating on two input qubits. Circuit 1400 may be controlled by providing classical control signals to select the states of switches 1410 and 1412, which have the effect of routing the two input qubits to a desired measurement operation, which may include either a two-qubit joint measurement operation (e.g., a Type II fusion operation) or individual qubit measurements (e.g., in a particular Pauli basis) for each of the two input qubits. In some embodiments, the classical control logic may select the desired measurement operation based on a fused graph representation (or other representation) of the quantum computation. An example of cycle-by-cycle selection of measurement operations for executing a fusion graph was described above in connection with Figures 19A, 19B, and 20. Other selection logic can also be implemented.

[0159]

[0197] Measurement data (also referred to as "measurements") generated by reconfigurable fused circuit 3226 may be provided to classical control logic 3210 via classical signal path 3237. As mentioned above, in some embodiments, the measurement data may include photon counts (or binary signals indicating the presence or absence of photons) of each detector or detector on an active path in the reconfigurable fused circuit in a given cycle.

[0160]

[0198] Classical control logic 3210 can decode measurement result data received via classical control path 3237 to determine the outcome of the quantum computation. In some embodiments, classical control logic 3210 can also incorporate herald signals received via signal path 3233 into the decoding. Further description of the decoding operations that can be performed in classical control logic 3210 can be found in WO 2021 / 155289, referenced above.

[0161]

[0199] 33 is a flow diagram of a process 3300 for operating an array of interleaving modules (e.g., interleaving modules 3220) according to some embodiments. Process 3300 may be implemented in, for example, classical control logic 3210. At block 3302, classical control logic 3210 may obtain a machine-readable representation of a fused graph corresponding to a quantum computation (or other operation on logical qubits) to be performed. At block 3304, classical control logic 3210 may define patches of the fused graph to be generated by each interleaving module 3210. For example, as described above, if the interleaving length is L, then each layer of the fused graph may be defined as a patch of size L. 2 The RSI cycle may be divided into patches, and each patch may be assigned to a different instance of the interleave module 3210. In block 3306, the classical control logic 3210 may initialize an RSI cycle counter. The RSI cycle counter may be, for example, a conventional clock circuit that runs at a rate corresponding to the rate at which resource states are provided to the RSI 3222. In block 3308, the classical control logic 3210 may determine an interleave coordinate for the current RSI cycle. An example of determining an interleave coordinate is described above with reference to FIG. 19A.

[0162]

[0200] At block 3310, each RSI 3222 may obtain a resource state. For example, a signal generated by classical control logic 3210 in response to an RSI cycle counter may trigger generation of a resource state in resource state generator 3202, which may provide the resource state to each RSI 3222. At block 3312, classical control logic 3210 may determine a setting for routing switch 3224 based on the interleave coordinates. For example, as described above, classical control logic 3210 may determine whether each qubit should be directed to a local fused circuit or a networked fused circuit based on the interleave coordinates (or the position of the resource state within the patch). At block 3314, classical control logic 3210 may generate a control signal to routing switch 3224 to route the qubit to a local path or a network path based on the determination at block 3312. In block 3316, the classical control may determine switch settings for the reconfigurable fused circuit 3226 based on the measurement operation indicated in the fusion graph. For example, as described above, the classical control logic 3210 may determine from the fusion graph whether to perform a fusion operation or a single-qubit measurement (and, if applicable, which single-qubit measurement to perform). In block 3318, the classical control logic 3210 may generate control signals to the reconfigurable fused circuit 3226 to implement the settings determined in block 3316. In block 3320, the classical control logic 3210 may receive measurement result data from the reconfigurable fused circuit 3226. The measurement result data may be used as described above.

[0163]

[0201] At block 3322, the classical control logic 3210 may determine whether the quantum computation is complete, e.g., whether the entire fused graph has been executed. If not, at block 3324, the RSI cycle counter may be incremented, and the process 3300 may return to block 330 to determine the next interleave coordinate and process the next set of resource states. The process 300 may continue to iterate until the computation is complete and may terminate at block 3326. It should be understood that all instances of the interleave module 3220 may operate in parallel, with photons propagating between different interleave modules 3220 based on the settings of the routing switch 3224. Delay lines may be provided within or between the interleave modules so that qubits from different resource states arrive at the reconfigurable fused circuit 3226 with the correct relative timing to execute the fused graph.

[0164]

[0202] The system 3200 of Figure 32 and the process 3300 of Figure 33 are illustrative and are subject to variations and modifications. Blocks shown separately may be combined, or a single block may be implemented using multiple separate components. The order of operations may be changed where logic permits, and operations described as sequential may be performed simultaneously. The interleaving module 3200 may be implemented according to any of the interleaving module arrays described above or variations or modifications thereof.

[0165]

[0203] System 3200 is but one example of a quantum computer system that can incorporate the interleaving module described herein to perform operations on logical qubits or other operations that can be specified using a fused graph, including operations related to quantum computing, quantum communication, and other applications. Many different systems can be implemented, as will be appreciated by those of ordinary skill in the art with access to this disclosure. Furthermore, the determination of the interleaving coordinates and operations to be performed for a given interleaving coordinate can be based on the fused graph or any other input that specifies a set of operations to be performed on a set of resource states. Thus, the interleaving module can be used in a variety of applications, including, but not limited to, FBQC.

[0166]

[0204] 9. Further Embodiments The foregoing examples of interleaving modules and processes are illustrative and can be modified as needed. The use of directional labels (e.g., N, E, W, S, U, D) is for convenience of explanation and should be understood to refer to entanglement space without requiring or implying a particular physical arrangement of components or physical qubits. All numerical examples are for illustrative purposes and can be modified. Furthermore, while layers and patches are described with reference to square numbers, it should be understood that non-square layers and / or non-square patches can also be used. For example, patches or layers can be rectangular. Triangular patches or layers (or patches or layers having other shapes) can also be generated by, for example, varying the number of resource states per row. Furthermore, while the foregoing examples assume that all instances of resource states have the same entanglement pattern, such uniformity is not required. For example, in some embodiments, the resource state generator can be reconfigurable to generate resource states with different entanglement patterns at different clock cycles. Furthermore, the resource state generator can operate non-deterministically, which can introduce stochastic variation between resource states.

[0167]

[0205] In some embodiments, resource state generation is non-deterministic, meaning that in a given operating cycle, a particular resource state generator may or may not succeed in generating the desired resource state. Thus, some embodiments may provide several (M) resource state generation circuits. M may be greater than N, where N is the total number of instances of the interleaving module, and M may be selected to provide a sufficiently high probability that at least N resource states are generated during a given operating cycle (the "sufficiently high probability" in a given implementation may be determined based on the particular implementation of fault tolerance). Active multiplexing techniques, examples of which are known in the art, may be used to select one of the N resource state generators at each clock cycle to distribute resource states to the N different instances of the interleaving module. Thus, each interleaving module may, but need not, have its own dedicated instance of a resource state generator.

[0168]

[0206] The foregoing embodiments provide examples of systems and methods for generating entanglement structures that can be used to perform FBQC. However, the embodiments are not limited to FBQC and may be used in a variety of contexts, including measurement-based quantum computing (MBQC), other quantum computing systems, quantum communication systems, and any other context in which it is desirable to perform measurements on a system including a large number of physical qubits with a specified entanglement structure. The specific size (number of qubits) of resource states and entanglement patterns may be varied as appropriate depending on the particular use case. Additionally or alternatively, the number of resource states and the entanglement shape between the resource states may be varied according to the particular use case. For example, while the above description uses an example of a fused graph having a three-dimensional shape, fused graphs having more or fewer dimensions may be implemented by providing an appropriately connected network of appropriate sources of resource states and interleaving modules.

[0169]

[0207] Additionally, while the above-described embodiments include reference to particular materials and structures (e.g., optical fibers), other materials and structures capable of generating, propagating, and manipulating photons can be substituted. As previously described, resource states can be generated using photonic circuitry, or resource states can be created using matter-based qubits, after which appropriate transducer technology can be applied to swap the state of the matter-based qubits into a photonic state. While the interleaving described herein utilizes the propagation of photonic qubits, similar techniques may be applicable to systems of physical qubits realized using entities that propagate along well-defined hardware paths.

[0170]

[0208] It should be understood that the resource states, interleaving modules, and networks of interleaving modules shown herein are exemplary and that variations and modifications are possible. In some embodiments, resource states having different sizes and / or entanglement patterns can be used at different vertex positions in the fusion graph, and position-dependent selection of resource state configurations can be used to perform logical operations. Furthermore, while FBQC is an example use of the interleaving techniques described herein, it should be understood that interleaving techniques are generally applicable to the construction of large entangled quantum systems from smaller entangled quantum systems (resource states). Thus, interleaving modules and techniques of the type described herein can be applied in a variety of contexts, including, but not limited to, FBQC and other quantum computing systems.

[0171]

[0209] Classical control logic can be implemented on-chip using waveguides, beam splitters, detectors and / or other photonic circuit components, or off-chip as desired.

[0172]

[0210] It should be understood that all numerical values ​​used herein are for illustrative purposes and are subject to change. In some cases, ranges are provided to give a sense of scale, but values ​​outside the disclosed ranges are not excluded.

[0173]

[0211] It should also be understood that all figures herein are intended as schematic representations. Unless specifically indicated otherwise, the figures are not intended to imply a particular physical arrangement of elements shown therein, or that all elements shown are required. Those skilled in the art with access to this disclosure will understand that elements shown in the figures or otherwise described in this disclosure can be modified or omitted, and that other elements not shown or described can be added.

[0174]

[0212] This disclosure provides a description of the claimed invention with reference to particular embodiments. Those skilled in the art with access to this disclosure will understand that the embodiments do not exhaust the scope of the claimed invention, which scope extends to all variations, modifications, and equivalents.

Claims

1. In the apparatus, a resource state interconnect having a plurality of output paths for outputting resource states during each of a plurality of operating cycles, each resource state being a quantum system of a plurality of entangled qubits, different qubits of the resource state being output on different ones of the output paths; a plurality of routing switches, each having an input path coupled to a different one of the output paths of the resource state interconnect and a plurality of output paths, each routing switch configured to receive qubits of different resource states on its input path and to selectively route the received qubits to one of the plurality of output paths; a plurality of reconfigurable fused circuits, each of the plurality of reconfigurable fused circuits configured to receive two input qubits and selectively perform either a projected entanglement measurement between the two input qubits or one of a plurality of single-qubit measurements on each of the two input qubits, thereby generating measurement result data; a plurality of delay lines having different delay lengths, the different delay lines being coupled between respective output paths of the resource state interconnect and respective input paths of different ones of the routing switches; a plurality of routing paths including a plurality of local routing paths and a plurality of network routing paths, wherein the local routing paths are coupled between the routing switches and the reconfigurable fused circuits such that each of the routing switches is coupled to at least one of the reconfigurable fused circuits, and each of the network routing paths exits the device; An apparatus comprising:

2. The apparatus of claim 1 , wherein each of the network routing paths couples to a reconfigurable fused circuit in another instance of the apparatus.

3. 2. The apparatus of claim 1, wherein each of the reconfigurable fused circuits is configured such that the plurality of single-qubit measurements include a Pauli X measurement, a Pauli Y measurement, and a Pauli Z measurement.

4. Each of the reconfigurable fused circuits is configured such that the plurality of single-qubit measurements are －ｉπ／８ and a subsequent Pauli-Z measurement.

5. The plurality of delay lines a first delay line having a delay length corresponding to one operating cycle; a second delay line having a delay length corresponding to a number of operating cycles (L), where L is greater than 1; Number of operating cycles L ２ a third delay line having a delay length corresponding to The apparatus of claim 1 , comprising:

6. The plurality of reconfigurable fused circuits include: a first local fusion circuit; a second local fusion circuit; a third local fusion circuit; a first networked fusion circuit; a second networked fusion circuit; Including, the plurality of network paths includes a first network path and a second network path; The plurality of routing switches a first routing switch configured to selectively direct a first qubit of each resource state from the first delay line to either a first input of the first local fused circuit or a first input of the first networked fused circuit; a second routing switch configured to selectively direct a second qubit of each resource state to either a second input of the first local fused circuit or the first network path; a third routing switch configured to selectively direct a third qubit of each local resource state from the second delay line to either a first input of the second local fused circuit or a first input of the second networked fused circuit; a fourth routing switch configured to selectively direct a fourth qubit of each resource state to either a second input of the second local fused circuit or the second network path; The apparatus of claim 5 , comprising:

7. The plurality of local routing paths include: a first local routing path for directing a fifth qubit of each resource state to the third delay line, an output of the third delay line being coupled to a first input of the third local fused circuit; a second local routing path for directing the sixth qubit of each resource state to a second input of the third local fused circuit; The apparatus of claim 6 , comprising:

8. the plurality of reconfigurable fusion circuits further includes a third networked fusion circuit; the plurality of network paths further includes a third network path; The plurality of routing switches a fifth routing switch configured to selectively direct a fifth qubit of each resource state to either a first input of the third local fused circuit or a first input of the third networked fused circuit; a sixth routing switch configured to selectively direct a sixth qubit of each resource state to either a second input of the third local fused circuit or the third network path; The apparatus of claim 6 further comprising:

9. The plurality of reconfigurable fused circuits include: a first local fusion circuit; a second local fusion circuit; a third local fusion circuit; a fourth local fusion circuit; a first networked fusion circuit; a second networked fusion circuit; Including, the plurality of network paths includes a first network path and a second network path; The plurality of routing switches a first routing switch configured to selectively direct a first qubit of each resource state from the first delay line to one of a first input of the first local fused circuit, a first input of the first networked fused circuit, or a fourth delay line coupled to a first input of the fourth local fused circuit, the fourth delay line having a delay length corresponding to one operating cycle; a second routing switch configured to selectively direct a second qubit of each resource state to one of a second input of the first local fused circuit, the first network path, or a second input of the fourth local fused circuit; a third routing switch configured to selectively direct a third qubit of each local resource state from the second delay line to either a first input of the second local fused circuit or a first input of the second networked fused circuit; a fourth routing switch configured to selectively direct a fourth qubit of each resource state to either a second input of the second local fused circuit or the second network path; The apparatus of claim 5 , comprising:

10. The plurality of routing paths include: a first routing path for directing a fifth qubit of each resource state to the third delay line, an output of the third delay line being coupled to a first input of the third local fused circuit; a second routing path for directing the sixth qubit of each resource state to a second input of the third local fused circuit; 10. The apparatus of claim 9, comprising:

11. the plurality of reconfigurable fusion circuits further includes a third networked fusion circuit; the plurality of network paths further includes a third network path; The plurality of routing switches a fifth routing switch configured to selectively direct a fifth qubit of each resource state to either a first input of the third local fused circuit or a first input of the third networked fused circuit; a sixth routing switch configured to selectively direct a sixth qubit of each resource state to either a second input of the third local fused circuit or the third network path; The apparatus of claim 9 further comprising:

12. The plurality of reconfigurable fused circuits include: a first local fusion circuit; a first networked fusion circuit; Including, the plurality of network paths includes a first network path; The plurality of routing switches a first routing switch configured to selectively direct a first qubit of each resource state from the third delay line to either a first input of the first local fused circuit or a first input of the first networked fused circuit; a second routing switch configured to selectively direct a second qubit of each resource state to either a second input of the first local fused circuit or the first network path; Including, a second input of the first networked fusion circuit coupled to a network path of another instance of the device; 6. The apparatus of claim 5.

13. The plurality of reconfigurable fused circuits include: a first local fusion circuit; a first networked fusion circuit; Including, the plurality of network paths includes a first group of network paths, the first group of network paths including two or more network paths; The plurality of routing switches a first routing switch configured to selectively direct a first qubit of each resource state from one of the delay lines to either a first input of the first local fused circuit or a first input of the first networked fused circuit; a second routing switch configured to selectively direct a second qubit of each resource state to a second input of the first local fused circuit or to any one network path in the first group of network paths; The apparatus of claim 5 , comprising:

14. 14. The apparatus of claim 13, wherein said one of said delay lines is said third delay line.

15. The apparatus of claim 13 , wherein each of the network paths in the first group of network paths is coupled to a different instance of a plurality of other instances of the apparatus.

16. an input switch having a plurality of external input paths and an output path coupled to a second input of the first networked fused circuit; The apparatus of claim 13 further comprising:

17. 17. The apparatus of claim 16, wherein each of the external input paths is coupled to a network path of a different one of a plurality of other instances of the apparatus.

18. 2. The apparatus of claim 1, wherein each of the plurality of reconfigurable fused circuits is configured such that the projected entanglement measurement operation includes a destructive measurement on both of the input qubits.

19. The apparatus of claim 1 , wherein each of the reconfigurable fusion circuits is configured such that the projected entanglement measurement is a Type II fusion operation that provides a joint XX measurement and a joint ZZ measurement.

20. 10. The apparatus of claim 1, further comprising: classical control logic coupled to the plurality of reconfigurable fused circuits and the plurality of routing switches, the classical control logic configured to select an operation for each of the plurality of reconfigurable fused circuits and the plurality of routing switches.

21. 21. The apparatus of claim 20, wherein the classical control logic is further configured to select the operation for each of the plurality of reconfigurable fused circuits and the plurality of routing switches based at least in part on a fused graph representing a quantum computation to be performed.

22. The apparatus of claim 1 , further comprising a resource state generation circuit that generates a resource state and provides the resource state to the resource state interconnect.

23. The apparatus of claim 1 , wherein the qubits in the resource states are photonic qubits.

24. 24. The apparatus of claim 23, wherein the resource state interconnect comprises a plurality of waveguides coupled between an external source of resource state and the output path of the resource state interconnect.

25. 24. The apparatus of claim 23, wherein the resource state interconnect includes a resource state generation circuit that outputs a photonic resource state.

26. A network of interleave modules, each interleave module comprising: a resource state interconnect having a plurality of output paths for outputting resource states during each of a plurality of operating cycles, each resource state being a quantum system of a plurality of entangled qubits, different qubits of the resource state being output on different ones of the output paths; a plurality of routing switches, each having an input path coupled to a different one of the output paths of the resource state interconnect and a plurality of output paths, each routing switch configured to receive qubits of different resource states on its input path and to selectively route the received qubits to one of the plurality of output paths; a plurality of reconfigurable fused circuits, each of the plurality of reconfigurable fused circuits configured to receive two input qubits and selectively perform either a projected entanglement measurement between the two input qubits or one of a plurality of single-qubit measurements on each of the two input qubits, thereby generating measurement result data; a plurality of delay lines having different delay lengths, the different delay lines being coupled between respective output paths of the resource state interconnect and respective input paths of different ones of the routing switches; a plurality of routing paths including a plurality of local routing paths and a plurality of network routing paths, wherein the local routing paths are coupled between the routing switches and the reconfigurable fused circuits such that each of the routing switches is coupled to at least one of the reconfigurable fused circuits, and each of the network routing paths is coupled to a reconfigurable fused circuit in a different interleave module within the network; a network of interleaved modules, including: classical control logic coupled to the network of interleave modules and configured to control the routing switch and the reconfigurable fusion circuit to receive classical data signals representing the measurement result data from the reconfigurable fusion circuit; A system comprising:

27. 27. The system of claim 26, wherein each of the reconfigurable fused circuits is configured such that the plurality of single qubit measurements include a Pauli X measurement, a Pauli Y measurement, and a Pauli Z measurement.

28. Each of the reconfigurable fused circuits is configured such that the plurality of single-qubit measurements are －ｉπ／８ and a subsequent Pauli-Z measurement.

29. The plurality of delay lines in each interleave module include: a first delay line having a delay length corresponding to one operating cycle; a second delay line having a delay length corresponding to a number of operating cycles (L), where L is greater than 1; Number of operating cycles L ２ a third delay line having a delay length corresponding to 27. The system of claim 26, comprising:

30. In at least one of the interleaving modules: The plurality of reconfigurable fused circuits include: a first local fusion circuit; a second local fusion circuit; a third local fusion circuit; a first networked fusion circuit; a second networked fusion circuit; Including, the plurality of network paths includes a first network path and a second network path; The plurality of routing switches a first routing switch configured to selectively direct a first qubit of each resource state from the first delay line to either a first input of the first local fused circuit or a first input of the first networked fused circuit; a second routing switch configured to selectively direct a second qubit of each resource state to either a second input of the first local fused circuit or the first network path; a third routing switch configured to selectively direct a third qubit of each local resource state from the second delay line to either a first input of the second local fused circuit or a first input of the second networked fused circuit; a fourth routing switch configured to selectively direct a fourth qubit of each resource state to either a second input of the second local fused circuit or the second network path; 30. The system of claim 29, comprising:

31. In at least one of the interleaving modules, the plurality of local routing paths include: a first local routing path for directing a fifth qubit of each resource state to the third delay line, an output of the third delay line being coupled to a first input of the third local fused circuit; a second local routing path for directing the sixth qubit of each resource state to a second input of the third local fused circuit; 31. The system of claim 30, comprising:

32. In at least one of the interleaving modules: the plurality of reconfigurable fusion circuits further includes a third networked fusion circuit; the plurality of network paths further includes a third network path; The plurality of routing switches a fifth routing switch configured to selectively direct a fifth qubit of each resource state to either a first input of the third local fused circuit or a first input of the third networked fused circuit; a sixth routing switch configured to selectively direct a sixth qubit of each resource state to either a second input of the third local fused circuit or the third network path; 31. The system of claim 30, further comprising:

33. In at least one of the interleaving modules: The plurality of reconfigurable fused circuits include: a first local fusion circuit; a second local fusion circuit; a third local fusion circuit; a fourth local fusion circuit; a first networked fusion circuit; a second networked fusion circuit; Including, the plurality of network paths includes a first network path and a second network path; The plurality of routing switches a first routing switch configured to selectively direct a first qubit of each resource state from the first delay line to one of a first input of the first local fused circuit, a first input of the first networked fused circuit, or a fourth delay line coupled to a first input of the fourth local fused circuit, the fourth delay line having a delay length corresponding to one operating cycle; a second routing switch configured to selectively direct a second qubit of each resource state to one of a second input of the first local fused circuit, the first network path, or a second input of the fourth local fused circuit; a third routing switch configured to selectively direct a third qubit of each local resource state from the second delay line to either a first input of the second local fused circuit or a first input of the second networked fused circuit; a fourth routing switch configured to selectively direct a fourth qubit of each resource state to either a second input of the second local fused circuit or the second network path; 30. The system of claim 29, comprising:

34. In at least one of the interleaving modules, the plurality of routing paths include: a first routing path for directing a fifth qubit of each resource state to the third delay line, an output of the third delay line being coupled to a first input of the third local fused circuit; a second routing path for directing the sixth qubit of each resource state to a second input of the third local fused circuit; 34. The system of claim 33, comprising:

35. In at least one of the interleaving modules: the plurality of reconfigurable fusion circuits further includes a third networked fusion circuit; the plurality of network paths further includes a third network path; The plurality of routing switches a fifth routing switch configured to selectively direct a fifth qubit of each resource state to either a first input of the third local fused circuit or a first input of the third networked fused circuit; a sixth routing switch configured to selectively direct a sixth qubit of each resource state to either a second input of the third local fused circuit or the third network path; 34. The system of claim 33, further comprising:

36. In at least one of the interleaving modules: The plurality of reconfigurable fused circuits include: a first local fusion circuit; a first networked fusion circuit; Including, the plurality of network paths includes a first network path; The plurality of routing switches a first routing switch configured to selectively direct a first qubit of each resource state from the third delay line to either a first input of the first local fused circuit or a first input of the first networked fused circuit; a second routing switch configured to selectively direct a second qubit of each resource state to either a second input of the first local fused circuit or the first network path; Including, a second input of the first networked fusion circuit coupled to a network path of a different interleave module in the network of interleave modules; 30. The system of claim 29.

37. In at least one of the interleaving modules: The plurality of reconfigurable fused circuits include: a first local fusion circuit; a first networked fusion circuit; Including, the plurality of network paths includes a first group of network paths, the first group of network paths including two or more network paths; The plurality of routing switches a first routing switch configured to selectively direct a first qubit of each resource state from one of the delay lines to either a first input of the first local fused circuit or a first input of the first networked fused circuit; a second routing switch configured to selectively direct a second qubit of each resource state to a second input of the first local fused circuit or to any one network path in the first group of network paths; 30. The system of claim 29, comprising:

38. 38. The system of claim 37, wherein said one of said delay lines is said third delay line.

39. 38. The system of claim 37, wherein each of the network paths in the first group of network paths is coupled to a different interleaving module in the network of interleaving modules.

40. The at least one of the interleaving modules: an input switch having a plurality of external input paths and an output path coupled to a second input of the first networked fused circuit; 38. The system of claim 37, further comprising:

41. 41. The system of claim 40, wherein each of the external input paths is coupled to a network path of a different interleave module in the network of interleave modules.

42. 27. The system of claim 26, wherein each of the plurality of reconfigurable fused circuits in each of the interleaving modules is configured such that the projected entanglement measurement operation includes a destructive measurement on both of the input qubits.

43. 27. The system of claim 26, wherein each of the plurality of reconfigurable fusion circuits in each of the interleaving modules is configured such that the projected entanglement measurement is a Type II fusion operation that provides a joint XX measurement result and a joint ZZ measurement result.

44. The interleaving module has a dimension n ｘ ×n ｙ = N, and n ｘ and n ｙ 27. The system of claim 26, wherein is an integer.

45. Each interleaving module determines the number of resource states (L ２ ) and the size of each layer is L ２ 45. The system of claim 44, wherein the number of inputs is 1×N.

46. 27. The system of claim 26, wherein the classical control logic is further configured to determine a sequence of control settings in the routing switch and the reconfigurable fused circuit based at least in part on a fused graph representing a quantum computation to be performed.

47. 27. The system of claim 26, further comprising a plurality of resource state generation circuits for generating resource states and providing said resource states to said resource state interconnects of said interleaving modules.

48. 27. The system of claim 26, wherein the qubits of the resource states are photonic qubits.

49. 49. The system of claim 48, wherein the resource state interconnect in each interleave module includes a plurality of waveguides coupled between an external source of resource state and the output path of the resource state interconnect.

50. 49. The system of claim 48, wherein the resource state interconnect in each interleave module includes a resource state generation circuit that outputs a photonic resource state.

51. determining a current cycle counter; determining interleave coordinates based at least in part on the current cycle counter; obtaining a resource state, the resource state comprising a system of entangled photonic qubits; determining, based at least in part on the interleaving coordinates, a plurality of routing switch configurations for a plurality of routing switches, each routing switch being arranged to receive one of the photonic qubits in the resource state, wherein at least some outputs of each of the routing switches are coupled to a delay line; determining, based at least in part on the interleaving coordinates, a plurality of operation selections in a plurality of reconfigurable fused circuits, each of the plurality of reconfigurable fused circuits configured to receive two input qubits from two of the routing switches, at least one of the two input qubits being received via one of the delay lines, and configured to selectably perform either a projected entanglement measurement operation between the two input qubits or one of a plurality of single-qubit measurements on each of the two input qubits, thereby generating measurement result data; transmitting a control signal to the routing switch based on the routing switch setting; sending a control signal to the reconfigurable fused circuit based on the operation selection; receiving the measurement result data from the reconfigurable fusion circuit; A method comprising:

52. incrementing a current cycle counter; repeating an operation of determining interleave coordinates, an operation of acquiring resource states, an operation of determining routing switch settings, an operation of determining operation selection, an operation of transmitting the control signal to the routing switch and the reconfigurable fusion circuit, and an operation of receiving measurement result data; 52. The method of claim 51, further comprising:

53. receiving data representing a fused graph that defines a set of measurement operations to be performed on qubits in a plurality of resource states; the interleave coordinates and the routing switch settings are determined based in part on the fusion graph and in part on the cycle counter.

53. The method of claim 52.

54. 52. The method of claim 51 , wherein the plurality of single qubit measurements comprises a Pauli X measurement, a Pauli Y measurement, and a Pauli Z measurement.

55. The plurality of single qubit measurements are －ｉπ／８ and a Pauli-Z measurement.

56. 52. The method of claim 51 , wherein the projected entangled measurement operation comprises a destructive measurement on both of the input qubits.

57. 57. The method of claim 56, wherein the projected entanglement measurement is a Type II fusion operation that provides a joint XX measurement and a joint ZZ measurement.

Images