Apparatus and method for error reduction in distributed quantum systems using fusion and decomposition gates - Patents.com
By fusing and decomposing quantum gates within a quantum computing compiler, the method addresses error reduction in distributed quantum systems by minimizing inter-module communication, thereby improving computational fidelity.
Patent Information
- Application Number
- JP2023571397
- Authority / Receiving Office
- JP · JP
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2021-12-09
- Filing Date
- 2022-11-10
- Publication Date
- 2024-12-05
AI Technical Summary
Current quantum computing systems face challenges in error reduction, particularly in distributed systems due to increased inter-module communication which leads to lower fidelity and decoherence, and existing solutions do not effectively address these issues by modifying the quantum gate sequence.
Implementing fusion and decomposition techniques in a quantum computing compiler to combine multiple quantum gates into a single unitary operation and then decompose them into alternative sequences, reducing inter-module communication and error-prone operations.
This approach significantly reduces quantum errors by minimizing inter-module communication, enhancing the fidelity of quantum computations in distributed systems.
Smart Images

Figure 2024544807000001_ABST
Abstract
Description
[Technical field]
[0001] FIELD OF THE DISCLOSURE Embodiments of the present invention relate generally to the field of quantum computing. More specifically, these embodiments relate to error reduction in distributed quantum systems through fusion and decomposition gates. [Background technology]
[0002] Quantum computing refers to the field of study related to computational systems that use quantum mechanical phenomena to manipulate data. Such quantum mechanical phenomena, such as superposition (a quantum variable can exist in many different states simultaneously) and entanglement (multiple quantum variables have correlated states regardless of the distance between them in space or time), have no analog in the classical computing world and therefore cannot be implemented on classical computing devices. [Brief description of the drawings]
[0003] A better understanding of the present invention can be obtained from the following detailed description taken in conjunction with the following drawings.
[0004] [Figure 1A] FIG. 2 is a diagram of an exemplary quantum dot device according to one embodiment. [Figure 1B] FIG. 2 is a diagram of an exemplary quantum dot device according to one embodiment. [Figure 1C] FIG. 2 is a diagram of an exemplary quantum dot device according to one embodiment. [Figure 1D] FIG. 2 is a diagram of an exemplary quantum dot device according to one embodiment. [Figure 1E] FIG. 2 is a diagram of an exemplary quantum dot device according to one embodiment. [Figure 1F] FIG. 2 is a diagram of an exemplary quantum dot device according to one embodiment.
[0005] [Diagram 2] FIG. 1 illustrates an embodiment of a processor pipeline for processing quantum and non-quantum instructions.
[0006] [Diagram 3] FIG. 1 is a diagram of one embodiment of a processor front-end circuit for processing quantum and non-quantum instructions.
[0007] [Figure 4A] FIG. 1 is a diagram of an embodiment of a quantum-classical processor interface. [Figure 4B] FIG. 1 is a diagram of an embodiment of a quantum-classical processor interface.
[0008] [Figure 5A] FIG. 1 is a diagram of an exemplary quantum circuit and program code for implementing the quantum circuit. [Figure 5B] FIG. 1 is a diagram of an exemplary quantum circuit and program code for implementing the quantum circuit.
[0009] [Figure 6A] This diagram shows an example of quantum instructions being generated by a compiler, decoded into uops, and executed within a quantum execution engine. [Figure 6B] This diagram shows an example of quantum instructions being generated by a compiler, decoded into uops, and executed within a quantum execution engine.
[0010] [Figure 7] FIG. 2 is a diagram of a method according to one embodiment of the present invention.
[0011] [Figure 8] FIG. 2 is a diagram of one embodiment of a qubit index generator for addressing qubits in a quantum processor.
[0012] [Figure 9] FIG. 13 is a diagram of a method for determining a qubit index value for identifying a qubit.
[0013] [Figure 10] 1 illustrates an example of a system for decoding and correcting quantum errors.
[0014] [Figure 11] 1 shows a typical quantum error correction cycle.
[0015] [Figure 12A] 1 shows the intermodule interconnections between quantum gates. [Figure 12B] 1 shows the intermodule interconnections between quantum gates.
[0016] [Figure 13A] We present unitary generation logic for fusing multiple quantum gates to form a unitary.
[0017] [Figure 13B] We present a decomposition logic that decomposes a unitary into multiple alternative gate sequences.
[0018] [Figure 14A] 1 illustrates the configuration of a quantum gate for multiple qubits across multiple modules. [Figure 14B] 1 illustrates the configuration of a quantum gate for multiple qubits across multiple modules.
[0019] [Figure 15] 13 shows fusion and decomposition logic that performs fusion and decomposition operations on selected qubit partitions.
[0020] [Figure 16A] 1 shows the timing associated with a gate operation for a particular clock cycle.
[0021] [Figure 16B] 1 shows examples of the locations (i.e., gates) of quantum operations that are executed during a particular clock cycle.
[0022] [Figure 17] 1 illustrates a method according to one embodiment of the present invention. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0023] In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the embodiments of the invention described below. However, it will be apparent to one skilled in the art that embodiments of the invention may be practiced without some of these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to avoid obscuring the underlying principles of the embodiments of the invention. [Introduction]
[0024] Quantum computers perform calculations using quantum mechanical phenomena such as superposition and entanglement. In contrast to digital computers, which store data in one of two distinct states (0 or 1), quantum computing uses quantum bits (qubits), which may be in a superposition of states. Qubits may be implemented using physically distinguishable quantum states of elemental particles such as electrons and photons. For example, the polarization of photons may be used where the two states are vertical and horizontal polarization. Similarly, the spin of an electron may have distinguishable states, such as "spin up" and "spin down".
[0025] The states of a qubit are typically represented by the bracket notation |0> and |1>. In classical computer systems, a bit is exclusively in one state or the other, i.e., "0" or "1". However, a qubit in a quantum mechanical system can be in a superposition of two states simultaneously, a feature that is unique to and fundamental to quantum computing.
[0026] A quantum computing system executes an algorithm that involves quantum logic operations being performed on qubits. A sequence of operations is statistically compiled into a schedule, and the qubits are addressed using an indexing scheme. The algorithm is then executed a sufficient number of times until the confidence interval of the computed answer exceeds a threshold (e.g., ~95+%). Hitting the threshold means that the desired algorithmic result has been achieved.
[0027] Qubits have been implemented using a variety of different technologies that allow the manipulation and reading of quantum states. These include, but are not limited to, quantum dot devices (spin-based and spatial-based), trapped ion devices, superconducting quantum computers, optical lattices, nuclear magnetic resonance computers, solid-state NMR Kane quantum devices, helium liquid surface electron quantum computers, resonator quantum electrodynamics (CQED) devices, molecular magnet computers, and fullerene-based ESR quantum computers, to name a few. Thus, although quantum dot devices are described below in connection with certain embodiments of the invention, the underlying principles of the invention may be utilized in combination with any type of quantum computer, including but not limited to those listed above. The particular physical implementation used for the qubits is independent of the embodiments of the invention described herein. [Quantum dot devices]
[0028] Quantum dots are small semiconductor particles, typically a few nanometers in size. Because of their small size, quantum dots behave according to the rules of quantum mechanics and have optical and electronic properties that differ from their macroscopic counterparts. Quantum dots are sometimes called "artificial atoms" to allude to the fact that they are single objects with distinct constrained electronic states, as in the case of atoms or molecules.
[0029] 1A-1F are various views of a quantum dot device 100, which may be used in embodiments of the invention described below. FIG. 1A is a top view of a portion of the quantum dot device 100 with some of the material removed so that a first gate line 102, a second gate line 104, and a third gate line 106 are visible. Although many of the drawings and descriptions herein may refer to a particular set of lines or gates as "barrier" or "quantum dot" lines or gates, respectively, this is merely for ease of discussion, and in other embodiments, the roles of the "barrier" and "quantum dot" lines and gates may be interchanged (e.g., a barrier gate may instead function as a quantum dot gate, and vice versa). 1B to 1F are side cross-sectional views of the quantum dot device 100 of FIG. 1A, in detail, FIG. 1B is a view through the BB section of FIG. 1A, FIG. 1C is a view through the CC section of FIG. 1A, FIG. 1D is a view through the DD section of FIG. 1A, FIG. 1E is a view through the EE section of FIG. 1A, and FIG. 1F is a view through the F-F section of FIG. 1A.
[0030] The quantum dot device 100 of Figure 1 may be operated in any of several manners. For example, in some embodiments, an electrical signal, such as a voltage, a current, a radio frequency (RF) and / or a microwave signal, may be provided to one or more of the first gate line 102, the second gate line 104 and / or the third gate line 106 to cause quantum dots (e.g., electron spin-based quantum dots or hole spin-based quantum dots) to form in the quantum well stack 146 under the third gate 166 of the third gate line 106. The electrical signal provided to the third gate line 106 may control the electric potential of the quantum well under the third gate 166 of that third gate line 106, while the electrical signal provided to the first gate line 102 (and / or the second gate 164 of that second gate line 104) may control the potential energy barrier between adjacent quantum wells under the first gate 162 of that first gate line 102 (and / or the second gate 164 of that second gate line 104). Quantum interactions between quantum dots in different quantum wells in quantum well stack 146b (e.g., under different quantum dot gates) may be controlled in part by a potential energy barrier provided by a barrier potential imposed between them (e.g., by interposing a barrier gate).
[0031] In general, the quantum dot device 100 disclosed herein may further include a source of magnetic field (not shown) that may be used to create an energy difference in the normally decaying state of the quantum dot (e.g., the spin state of an electron spin-based quantum dot), and the state of the quantum dot (e.g., the spin state) may be manipulated by applying electromagnetic energy to the gate line to create a quantum bit capable of computation. The source of the magnetic field may be one or more magnet lines, as discussed below. Thus, the quantum dot device 100 disclosed herein may be capable of manipulating the position, number, and quantum state (e.g., spin) of the quantum dots in the quantum well stack 146 through the controlled application of electromagnetic energy.
[0032] In the quantum dot device 100 of FIG. 1, a gate dielectric 114 may be disposed on the quantum well stack 146. The quantum well stack 146 may include at least one quantum well layer 152 (not shown in FIG. 1) in which the quantum dots may be localized during operation of the quantum dot device 100. The gate dielectric 114 may be any suitable material, such as a high-K dielectric material. Multiple parallel first gate lines 102 may be disposed on the gate dielectric 114, and spacer material 118 may be disposed on the sides of the first gate lines 102. In some embodiments, a patterned hard mask 110 may be disposed on the first gate lines 102 (in a pattern corresponding to the pattern of the first gate lines 102), and the spacer material 118 may extend to the surface of the hard mask 110, as shown. Each of the first gate lines 102 may be a first gate 162. Different ones of the first gate lines 102 may be electrically controlled in any desired combination (e.g., each first gate line 102 may be electrically controlled separately, or some or all of the first gate lines 102 may be shorted together in one or more groups, as desired).
[0033] Multiple parallel second gate lines 104 may be disposed over and between the first gate lines 102. As illustrated in FIG. 1, the second gate lines 104 may be disposed orthogonal to the first gate lines 102. As illustrated in FIG. 1D, the second gate lines 104 may extend over the hard mask 110 and may include second gates 164 that extend down toward the quantum well stack 146 and contact the gate dielectric 114 between adjacent ones of the first gate lines 102. In some embodiments, the second gates 164 may fill the areas between adjacent ones of the first gate lines 102 / spacer material 118 structures, and in other embodiments, an insulating material (not shown) may be present between the first gate line 102 / spacer material 118 structures and adjacent second gates 164. In some embodiments, spacer material 118 may be disposed on the sides of the second gate line 104, while in other embodiments, spacer material 118 may not be disposed on the sides of the second gate line 104. In some embodiments, a hard mask 115 may be disposed above the second gate line 104. The multiple gates of the second gates 164 of the second gate line 104 are electrically continuous (due to the shared conductive material of the second gate line 104 on the hard mask 110). Different ones of the second gate lines 104 may be electrically controlled in any desired combination (e.g., each second gate line 104 may be electrically controlled separately, or some or all of the second gate lines 104 may be shorted together in one or more groups, as desired). The first gate lines 102 and the second gate lines 104 together may form a grid, as depicted in FIG. 1.
[0034] Multiple parallel third gate lines 106 may be disposed over and between the first gate line 102 and the second gate line 104. As illustrated in FIG. 1, the third gate lines 106 may be arranged diagonally with respect to the first gate line 102 and diagonally with respect to the second gate line 104. In particular, the third gate lines 106 may be arranged diagonally over an opening in the grid formed by the first gate line 102 and the second gate line 104. The third gate lines 106 may include a third gate 166 that extends down to the gate dielectric 114 in an opening in the grid formed by the first gate line 102 and the second gate line 104, such that each third gate 166 may be bounded by two different first gate lines 102 and two different second gate lines 104. In some embodiments, the third gates 166 may be bounded by an insulating material 128, while in other embodiments the third gates 166 may fill an opening in the grid (e.g., in contact with spacer material 118 disposed on the sides of adjacent first gate line 102 and second gate line 104, not shown). Additional insulating material 117 may be disposed on and / or around the third gate lines 106. The multiple gates of the third gates 166 of the third gate lines 106 are electrically continuous (due to the shared conductive material of the third gate lines 106 on the first gate line 102 and second gate line 104). Different ones of the third gate lines 106 may be electrically controlled in any desired combination (e.g., each third gate line 106 may be electrically controlled separately, or some or all of the third gate lines 106 may be shorted together in one or more groups, as desired).
[0035] 1A-1F depict a particular number of first gate lines 102, second gate lines 104, and third gate lines 106, this is for simplicity purposes of illustration and any number of first gate lines 102, second gate lines 104, and third gate lines 106 may be included in the quantum dot device 100. Other examples of arrangements of the first gate lines 102, second gate lines 104, and third gate lines 106 are possible. Electrical interconnects (e.g., vias and conductive lines) may contact the first gate lines 102, second gate lines 104, and third gate lines 106 in any desired manner.
[0036] Although not shown in FIG. 1, there is an accumulation region (e.g., laterally adjacent to the quantum well layer) that may be electrically coupled to the quantum well layer of the quantum well stack 146. The accumulation region may be spaced from the gate line by a thin layer of intervening dielectric material. The accumulation region may be a region where carriers accumulate (e.g., by doping or by the presence of a large electrode that draws carriers into the quantum well layer) and may act as a reservoir of carriers that can be selectively drawn into an area of the quantum well layer under the third gate 166 (e.g., by controlling the voltage on the quantum dot gates, first gate 162 and second gate 164) to form a carrier-based quantum dot (e.g., an electron or hole quantum dot, including a single charge carrier, a large number of charge carriers, or no charge carriers at all). In other embodiments, the quantum dot device 100 may not include a lateral accumulation region, but may instead include a doped layer in the quantum well stack 146. Such a doped layer may provide carriers to the quantum well layer. Any combination of accumulation regions or doped layers (eg, doped or undoped) within the quantum well stack 146 may be used in any of the embodiments of the quantum dot device 100 disclosed herein. [Apparatus and method for hybrid classical-quantum computing]
[0037] After Richard Feynman asked in 1982 whether quantum physics could be efficiently simulated using quantum computers, much effort in studying quantum computers has focused on their generality and efficiency with respect to classical computation. One such example is David Deutsch's 1985 quantum Turing machine, which can be programmed to perform any computational task that is feasible by any physical object.
[0038] In contrast to theories and algorithms, quantum physical machines are still in their infancy. Efforts to build quantum information processing systems have been moderately successful so far. Miniature quantum computers capable of performing a small set of quantum operations on very few qubits represent the state of the art in quantum computing. In addition, quantum states are fragile in the sense that they remain coherent only for a limited duration. This gap between algorithms and physical machines has led the effort to invent hybrid classical-quantum algorithms. Some recent quantum algorithm developments have focused on short-depth quantum circuits to perform quantum computations formed as subroutines embedded in larger classical optimization loops, such as the variational eigensolver (PJJO'Malley, 2016). To address the severe resource constraints in quantum computing, quantum languages, tools, and flows have been developed that provide a software layer / stack to convert and optimize applications to the quantum physical layer (Frederic T. Chong, September 14, 2017).
[0039] On the hardware side, classical computers are used to perform error correction for quantum computation. The "quantum coprocessor" model is the most convenient and widespread execution model, in which a classical CPU controls a quantum processing unit in a manner similar to how a CPU in a modern computer system interacts with a GPU. As described in (X.Fu, May 2016) and (X.Fu, 2018), the microarchitecture for an experimental superconducting quantum coprocessor included features such as an arbiter on the code fetch data path to direct classical instructions to the host CPU and quantum instructions to the quantum coprocessor, an exchange register file to synchronize the register files between the host CPU and the quantum coprocessor, and a quantum instruction cache.
[0040] However, the microarchitecture for such mechanisms is not well defined and lacks explicit support for hybrid classical-quantum programs. As a result, it is unclear how quantum coprocessors will be implemented within a quantum computer, especially those required to run different sets of quantum programs. Flexible, programmable models for running hybrid classical-quantum algorithms remain to be developed.
[0041] One embodiment of the present invention adds a set of quantum instructions to an instruction set architecture (ISA) of a processor, such as a CPU. As an example, these instructions may be included in an extension to the ISA (such as the AVX-512 extension for an x86 platform). Additionally, in one embodiment, a quantum engine is added to the execution units of the processor, and new quantum instructions are fetched, decoded, scheduled, and executed on the functional units of the quantum engine. In one embodiment, the quantum engine interacts with the classical execution engine using a shared register file and / or system memory. Upon executing a quantum instruction (or quantum uops in certain embodiments described herein), the quantum execution engine generates control signals to manipulate the state of qubits in the quantum processor. The quantum engine also executes instructions to make measurements of a specified set of qubits and store the results. In these embodiments, a quantum / classical interface provides connectivity between the quantum engine of the classical processor and the quantum engine of the quantum processor.
[0042] 2 illustrates one embodiment of a processor or core 210 that fetches, decodes, and executes quantum instructions 201A and non-quantum instructions 201B utilizing the same pipeline resources as non-quantum instructions 201B. The processor / core 210 of this embodiment supports quantum extensions to the existing ISA of the processor / core 210 (e.g., extending the ISA to include quantum instructions 201A). Program code 205C including quantum and non-quantum instructions is generated by a compiler 205B from source code 205A written by a programmer (e.g., utilizing the extended ISA). Various source / program code examples are provided below.
[0043] Quantum and non-quantum instructions 201A-B are fetched from memory 205 at the front end of the instruction pipeline and stored in a level 1 (L1) instruction cache 201. Instructions and data may also be stored in a level 2 or level 3 cache within the cache / memory subsystem 215, which manages memory requests and cache coherency.
[0044] Decoder 202 decodes instructions 201A-B into micro-operations or uops 203A, which are scheduled for execution by scheduler 203 and executed by execution circuitry 204. In one embodiment, certain stages of the pipeline are enhanced to include hardware support for processing quantum instructions 201B, while other stages are unchanged. For example, quantum decode circuitry 202A may be added to decoder 202 to decode quantum instructions 201A, just as non-quantum decode circuitry 202B decodes non-quantum instructions 201B. Although illustrated as separate components in FIG. 2 for purposes of illustration, quantum decode circuitry 202A and non-quantum decode circuitry 202B may include common or overlapping sets of circuitry and / or microcode. For example, in one embodiment, an existing decoder may be extended to include microcode support for quantum instructions (e.g., in a microcode ROM) to generate a new set of quantum uops. Decoder 202 may include other decoding circuitry, depending on the processor architecture, such as a set of decode table structures (see, for example, FIG. 3 and associated text).
[0045] In one embodiment, decoder 202 generates a sequence of uops 203A in response to decoding instructions 201A-B. In an implementation having quantum and non-quantum instructions, the uops may include a mix of quantum and non-quantum uops, which are then scheduled for execution by instruction scheduler 203.
[0046] Quantum and non-quantum uops 203A generated by decoder 202 may be initially queued for execution in one or more uops queues of scheduler 203, which dispatches uops from the uops queues according to dependencies and / or execution resource availability. Embodiments of the invention may be implemented on a variety of different types of processors with different types of schedulers. For example, in one embodiment, a set of execution "ports" couples scheduler 203 to execution circuitry 204, where each execution port is capable of issuing uops to a particular set of functional units 204C-E. In the exemplary architecture shown in FIG. 2, for example, SIMD and floating point (FP) uops may be issued by scheduler 203 to FP / SIMD execution ports coupled to a set of FP / SIMD functional units 204C, and integer uops may be issued to integer ports coupled to a set of integer functional units 204D. Although only two types of non-quantum functional units are shown for simplicity, the processor / core 210 may include various other / additional non-quantum functional units (e.g., load / store address generation units, branch units, additional SIMD and integer units, etc.).
[0047] In the particular embodiment shown in FIG. 2, the quantum engine functional unit 204E shares the same set of register files 204A-B used by the legacy processor functional units 204C-D. In this particular example, the register files 204A-B include FP / SIMD register file 204A, which stores floating point and SIMD operands used by FP / SIMD functional unit 204C and integer register file 204B, which stores integer operands for integer functional unit 204D. In one implementation, FP / SIMD register file 204A has 512-bit vector registers and integer register file 204B comprises 64-bit scalar registers. Of course, different processor architectures use different types of registers shared by the quantum engine functional units 204E. Various other types of registers may be used, such as a set of control / status registers and mask registers.
[0048] In an embodiment in which quantum uops are mixed with non-quantum uops, the quantum uops are issued across one or more quantum ports to a set of quantum engine functional units 204E, which execute the quantum uops to perform the underlying quantum operations. For example, in response to the quantum uops, quantum engine functional units 204E may generate control signals across quantum-classical interface 206 to manipulate and measure qubits of quantum processor 207.
[0049] The quantum-classical interface 206 includes digital-to-analog (DA) circuitry to convert the digital quantum control signals generated by the quantum engine functional unit 204E into analog signals needed to control the quantum processor 207 (such as a codeword trigger pulse generation (CTPG) unit and an arbitrary waveform generator (AWG) described below), and also includes analog-to-digital (AD) circuitry to convert physical qubit measurements into digital result data.
[0050] In one embodiment, the quantum-classical interface 206 is integrated on the same semiconductor chip as other components of the instruction processing pipeline (e.g., execution circuitry 204, scheduler 203, decoder 202, etc.). Depending on the particular physical implementation of the quantum processor 207, different types of circuit / logic components may be used, as discussed in more detail below.
[0051] 3 illustrates one embodiment in which quantum instruction processing support is added to a low-power processing pipeline that includes a pre-decode buffer 301B, a two-way decoder 302 with dual sets of quantum / non-quantum decoder circuits 202A-B, a dual look-up table for instruction translation (XLAT), and a ucodeROM 304. In one embodiment, the XLAT components 303, 305 and ucodeROM 304 are extended to support quantum instructions as indicated by logic blocks 303Q-305Q. Pre-decode buffer 301B detects and marks macro-instruction boundaries prior to full decoding into uops by the two-way decoder 302.
[0052] Operands for quantum and non-quantum uops are stored in a set of shared registers 321 (as described above) and are accessed by quantum functional unit 320 when executing the uops. Q-C interface 320 controls the operation of quantum processor 207 in response to quantum uops.
[0053] Different examples of quantum-classical interface 206 are illustrated in Figures 4A-4B. QC interface 206 in Figure 4A includes multiple uops units 401A-C that generate codewords to control the operation of multiple codeword trigger pulse generation (CTPG) units 402A-C in response to uops executed by quantum engine functional unit 204E. In response, CTPG units 402A-C generate sequences of pulses to control qubits of quantum processor 207. When quantum processor 207 reaches a specified execution state, quantum measurements are performed by one or more of measurement identification units (MDUs) 403A-B.
[0054] 4B includes a set of components for performing microwave complex signal generation, including an RF microwave unit 451, a multi-channel arbitrary waveform generator (AWG) 452, one or more digital-to-analog converters (DACs) 453, and one or more measurement units 454. In one embodiment, the inputs to each of these components include a set of codewords generated by the quantum engine functional unit 204E, and the outputs are analog waveforms that manipulate the state of qubits in the quantum processor 207. The measurement unit 454 measures the current state associated with one or more qubits at a specified point in time during execution.
[0055] To further guide the analysis and discussion, a concrete example is illustrated in FIG. 5A, which shows a quantum circuit for a many-body disordered Hamiltonian to evolve in time. x and R y Note that the angle by which h rotates is derived from several parameters. In particular, hk for k ∈ {0, 1, …, 5, 6} z and hk x are randomly generated and used to emulate large many-body systems that require a larger number of qubits than the basic quantum chip can support.
[0056] An example of a quantum program using this circuit for part of its calculations is illustrated in Figure 5B, which includes a mix of quantum and non-quantum instructions (as indicated by the comments to the right of the source code). In this example, NR is the number of disordered realizations (i.e., a variety of small random realizations to emulate a large many-body system), NQ is the number of qubits, NP is the number of iterations to achieve the required precision for probability (Pr), NT is the number of Trotter steps, and a[i] accumulates qubit measurements. The probability that a qubit is in state |0> or |1> is obtained by repeating the measurements (NP) and averaging.
[0057] This program structure shows how classical and quantum operations are tightly intertwined and executed on the classical-quantum processing architecture described herein. The most efficient way to execute this program is to process all instructions in a pipeline, such as those described above, and the quantum engine functional unit 204E for controlling the qubits is configured as an execution engine comparable to the other classical execution engines 204A-B (integer, floating point, etc.).
[0058] Figures 6A-6B provide an example of quantum operations performed in response to the program code of Figure 5A. In particular, Figure 6A illustrates a portion of quantum assembly language (QASM) code 601 for implementing the highlighted portion 501 of the quantum circuit of Figure 5A. The QASM code 601 is compiled into hybrid processor program code 602 in memory 205. In this example, registers RBX and RBX+1 from the shared register file 321 or 204B are used to hold qubit indices, in this particular example, for addressing logical qubits #2 and #3, respectively. The mapping of the relevant portions of QASM code 601 to hybrid processor program code 602 is indicated by arrows.
[0059] 6B illustrates how the quantum macro instruction QCNOTUP (to implement a CNOT gate) is decoded by decoder 202 into a series of uops 605. The uops 605 are executed by quantum engine functional unit 204E to generate codewords in a specified codeword or command packet format 606. In one particular format, a first data field indicates the qubit on which the operation is to be performed (qubit 3 in this example), a second data field indicates the channel over which the operation is to be transmitted (channel 4), a third field indicates the command state (e.g., a single command state), and a fourth data field indicates the type of qubit (transmon qubit). Of course, the underlying principles of the present invention are not limited to any particular encoding format.
[0060] A method according to one embodiment of the present invention is illustrated in Figure 7. The method may be implemented within the context of the processor architectures described above, but is not limited to any particular processor or system architecture.
[0061] At 701, source code containing quantum instructions is compiled to generate runtime program code having quantum and non-quantum instructions. At 702, quantum / non-quantum instructions are fetched from memory and stored in a local cache (e.g., an L1 instruction cache) or instruction buffer. As mentioned, quantum instructions may be freely mixed with non-quantum instructions within the pipeline.
[0062] At 703, the quantum and non-quantum instructions are decoded into a set of quantum and non-quantum uops, respectively, and queued prior to execution. At 704, quantum / non-quantum instruction uops are scheduled for execution based on uops and / or resource dependencies. For example, if a first uop is dependent on the result of a second uop, then the first uop may be scheduled for execution only if the data produced by the second uop is available in one of the registers. Similarly, if a particular functional unit is busy, then the scheduler may wait for an indication that the functional unit is available before scheduling a uop that requires that functional unit. Various other / additional scheduling techniques (e.g., scheduling based on priority, register load, etc.) may be implemented.
[0063] At 705, quantum and non-quantum uops execute on their respective functional units in the execution circuitry. As mentioned, a shared register set may be used to store source and destination operands required by these uops.
[0064] At 706, results produced by execution of the quantum uops may be used as inputs to an interface unit to control the quantum states of qubits in the quantum processor. In one embodiment, a series of code words or command packs may be generated that identify the quantum channel, one or more qubits in the quantum processor, qubit types and / or command states. The specific physical operations performed in response to the code words or command packs are based on the underlying type of quantum processor being used.
[0065] The embodiments described herein integrate quantum instructions within existing processor pipelines. Due to the tight integration, such embodiments significantly reduce various overheads / bottlenecks associated with current coprocessor designs, including, for example, communication between classical and quantum computation layers / modules in the software stack, and between the classical CPU and the quantum chip via message queues. Given the relatively small size of quantum routines, current GPU-like coprocessor implementations are inefficient.
[0066] For increased classical processing power, the hybrid coprocessor model reduces some of the overhead. In one particular implementation that supports the hybrid coprocessor model, many new microarchitectural features were introduced. However, these microarchitectural features were loosely defined to be the boundary between classical CPUs and quantum coprocessors.
[0067] In contrast, in the hybrid architectures described herein, the classical computation pipeline is equipped to fully support a defined set of quantum instructions, which may be freely mixed with non-quantum instructions both at the front-end of the pipeline (i.e., at the microinstruction level) and within the back-end of the pipeline (e.g., where quantum uops are mixed with non-quantum uops), and may be executed on execution units within the processor's execution circuitry. [Scalable qubit addressing modes for quantum execution engines and / or coprocessors]
[0068] In quantum computing, a qubit is a unit of quantum information that is the quantum counterpart of a classical binary bit. Computations are accomplished by applying quantum gates, which represent quantum logic operations, directly to the qubits. Mathematically, the computation process is described as the qubit undergoing a single transformation. Once the computation is complete, the qubit is measured to obtain information about the state of the qubit.
[0069] Therefore, to describe a quantum operation, it is essential to identify the qubit or set of qubits to which the operation applies. In a quantum program, each quantum instruction needs to encode both the operation to be performed and the qubit or qubits that perform the operation. In existing quantum instruction set architectures (e.g., QASM, Open QASM, QIS, etc.), register operands are typically encoded in the opcode of the instruction. This scheme works only for classical computation because the number of registers is very limited (e.g., 16, 32, 64, etc.). However, this scheme is not scalable for quantum computing, because quantum instructions will eventually need to address a very large number of qubits. As a result, encoding qubit addresses in the opcode field of a quantum instruction would increase the instruction width enormously.
[0070] As described above, in one embodiment, quantum and non-quantum instructions are processed together in a shared processor pipeline. Thus, quantum instructions may rely on the same addressing modes available to non-quantum instructions. Qubits in this embodiment are therefore addressed in a similar manner to non-quantum instructions, which access the system memory and provide a sufficiently large address space to accommodate a large number of qubits.
[0071] 8, in this embodiment, the quantum engine functional unit 204E includes a qubit index generation unit (QIG) 802 that determines a qubit index value or qubit ID in response to one or more uops 805. One or more quantum operation units 801 process the operations specified by the uops. The qubit index value (e.g., 011 for qubit 3 in this example) is then incorporated into a codeword or command packet 606, possibly along with one or more commands generated by the quantum operation unit 801 in response to processing the uops 805.
[0072] QIG802 may operate according to different addressing modes supported by the processor. In one embodiment, the instruction identifies one of the shared registers 321 that contains a qubit index value (sometimes called a qubit ID). The qubit index value may then be used to identify a qubit in a codeword or command packet 606 and / or to perform an operation using the qubit index value to generate one or more additional qubit index values. For example, it may add the qubit ID value to an integer specified by the uop to generate a second qubit ID.
[0073] The following example illustrates one way that the QIG802 generates qubit IDs in response to uops using x86 assembly syntax. These operations may be performed within an x86 pipeline that has been extended to support quantum instructions. However, the same general principles may be implemented on any processor architecture.
[0074] The single qubit instruction "QIROTX[RDI], 1" adds an X gate to the qubit number stored in RDI. So if RDI contains 5, then an X gate is added to qubit number 5. In this example, QIG802 determines the qubit ID by simply reading the value stored in RDI (which in this example is one of the shared registers 321). In this embodiment, the RDI value was previously stored by another uop. In another example, if the architectural register RBX contains a value of 2, then the two-qubit instruction “QCNOTUP[RBX+3]” applies a CNOT operation, where qubit 2 (q[2]) is the control qubit and qubit 5 (q[5]) is the target qubit. The control qubit's ID is stored in RBX, and the QIG resolves the [RBX+3] notation when the control qubit's ID is the target qubit ID. Thus, the addressing scheme is extended to allow two different qubits to be addressed with a single instruction (i.e., CNOT). In contrast, in classical computing, only one memory location is addressed per instruction.
[0075] FIG. 8 also illustrates a codeword trigger pulse generator (CTPG) 402A, which includes control logic and an analog-to-digital converter to resolve the codeword / command packet 606 to identify one or more qubits (Q3 in this example) and generate a sequence of pulses to fulfill the specified quantum operation. When all of the quantum operations have been executed as specified by the program code 205C, the quantum operation circuitry 801 and QIG 802 generate the codeword / command packet 606 and cause one or more MDUs 403A-B to measure one or more qubits (as specified by the QIG 802, which generates the qubit index). As mentioned, the MDU includes analog-to-digital circuitry to convert the analog measurements to digital values, which are then processed by the quantum error correction unit 808 to detect and possibly correct errors. If valid result data is received, it may be stored in one or more of the shared registers 321 and / or accumulated with previous measurement data. In addition to error correction, the measurements may also be used for program flow control based on measurement feedback.
[0076] The quantum error correction unit 808 may implement various techniques to detect and correct quantum errors. For example, in one embodiment, an error decoder (within the QEC unit 808) decodes multiple qubit measurements from the quantum processor 207 to determine whether an error occurred, and if so, implements (possible) corrective measures. The error measurements may be obtained from multiple qubits in a manner that does not disturb the quantum information in the encoded state of the qubits (e.g., using an ancilla qubit). In response, the QEC unit 808 generates error syndrome data, from which it may identify the error that occurred and implement a correction operation. In one embodiment, the error syndrome data comprises a stabilizer code, such as a surface code. In some cases, the response may simply be to reinitialize the qubits and start over. In other cases, however, modifications to the quantum algorithm implemented in the quantum program code 205C may be made to stabilize regions of the quantum processor responsible for the error (e.g., in this case, the compiler 205B includes a just-in-time (JIT) compiler). In either case, the CTPG 402A performs basic physical operations under the control of codeword / command packets 606 generated by the QEFU 204E. For example, the CTPG 402A may generate an electromagnetic pulse to adjust the phase of one or more qubits according to a detected phase error, or it may reset the phase / spin of all qubits if reinitialization is required.
[0077] Addressing qubits in a manner similar to the way classical CPUs address memory provides scalability properties / attributes required for future quantum processor implementations. In particular, the embodiments described above seamlessly integrate within existing processor ISAs and provide qubit indexing that scales to large number of qubit systems. These embodiments also remove pressure from the quantum instruction opcode space, addressing the qubit space, and integrating quantum operations into existing processor pipelines, via quantum extensions to x86 or other architectures.
[0078] A method according to one embodiment of the present invention is illustrated in Figure 9. The method may be implemented on the architectures described above, but is not limited to any particular processor or system architecture.
[0079] At 901, quantum and non-quantum instructions from the runtime program code are fetched and decoded to generate quantum uops and non-quantum uops. At 902, an index generation unit evaluates quantum uops that include register identifiers and optionally one or more values included with the uops to determine qubit index values. As described above, the indexes may be generated using a variety of techniques, including reading qubit index values from registers identified by the uops and generating additional qubit index values using integer values included with the uops.
[0080] At 903, the quantum execution circuit generates a codeword that specifies a quantum operation to be performed on a qubit identified by the calculated qubit index value. At 904, the quantum operation is performed on the specified qubit. At 905, a qubit measurement is performed in response to another codeword generated based on the additional uops. At 906, analog measurements made on one or more of the plurality of qubits are converted to digital values. Error correction and / or flow control may then be performed based on the resulting digital values stored in the processor's register file.
[0081] 10 shows a typical quantum computer configuration with error detection and correction. The illustrated example includes a quantum computer runtime 1001 (e.g., implemented in QASM program code), which is executed by a quantum execution pipeline 1005 of a quantum execution unit 1002. By way of example and not limitation, the quantum execution unit 1002 may be an application specific integrated circuit (ASIC), a general purpose processor, or a programmable functional unit for executing quantum instructions.
[0082] In response to executing the quantum program code, quantum execution pipeline 1005 sends commands to qubit drive controller 1010, which performs physical quantum operations on quantum chip 1020. Depending on the implementation, this may be accomplished with a sequence of RF pulses to manipulate qubits Q0-Q15 of quantum chip 1020.
[0083] After all or a certain number of the program steps are completed, the measurement unit 1015 reads / estimates the quantum state of one or more of the qubits Q0-Q15 and provides the measurement results to the decoding / error correction unit 1016, which decodes the measurements using an error correction decoding technique. For example, the decoding / error correction unit 1016 decodes the multi-qubit measurements from the quantum processor 1020 to determine whether an error occurred and, if so, implements a corrective action if possible. The error measurements may be obtained from the multiple qubits in a manner that does not disturb the quantum information in the encoded state of the qubits (e.g., using an ancilla qubit). In response, error syndrome data may be generated, from which errors and correction operations may be identified. In one embodiment, the error syndrome data comprises a stabilizer code, such as a surface code. In some cases, the response may simply be to reinitialize the qubits Q0-Q15 and start over. In other cases, however, modifications to the quantum algorithm may be implemented in the quantum program code 1001.
[0084] The decoded / corrected results are provided to the quantum execution unit 1002 for further processing by the quantum runtime 1001. The typical operation flow of current quantum computers is designed based on a fixed cycle time for each quantum operation performed by the quantum execution pipeline 1005, and each measurement made by the measurement unit 1015.
[0085] 11 illustrates one embodiment of a quantum error correction cycle that may be implemented by the architecture described herein. At 1101, the logical states of the qubits of the system are initialized. For example, if electron spin is used as the quantum state, the electrons in the quantum system may be prepared (e.g., initialized to a particular spin orientation and / or entangled with an electromagnetic control signal from a quantum controller).
[0086] At 1102, the state of the quantum system evolves in response to additional electromagnetic inputs specified by quantum runtime 1001 and implemented by quantum controller 1010. For example, different sets of qubits, including ancilla qubits, may be entangled and manipulated according to quantum runtime 1001.
[0087] At 1103, a measurement of the quantum system is made. For example, the current spin of one of the entangled electrons may be measured. The system may then be reinitialized to move on to the next measurement (i.e., taking into account that making a measurement or knowing any information about the quantum system will perturb the quantum state). During each error correction cycle, the physical qubit may be measured periodically.
[0088] At 1104, error detection / classification is performed on the measurements to determine if any errors occurred. The error cycle is completed at 1105 with an error correction operation using a designated set of codes which attempts to correct any detected errors. [Error reduction in distributed quantum systems by fusion and decomposition gates]
[0089] Scaling up quantum computers requires communication between quantum modules. As used herein, the term "module" refers to a core, chiplet, die, package, system or other distinguishable collection of qubits. This requirement for scaling may hold true even within a decade, since even a near-term quantum computer may be composed of multiple interconnected silicon quantum dot "chiplets," ion traps, superconductor arrays, or any other type of interconnected hardware.
[0090] However, such inter-module communication can lead to lower fidelity quantum computing given that inter-module operations are more error-prone than intra-module operations, and more communication leads to more idle time, which increases decoherence between qubit states.
[0091] Currently, there are only partial solutions to this problem, which mainly focus on reordering the qubit indices using different optimization algorithms. However, these techniques do not provide any correction to the quantum gate sequence itself. As a result, the possible means to reduce communication-related errors are limited.
[0092] To address these limitations, embodiments of the invention described below include various techniques that reduce quantum errors by reducing the amount of inter-module communication required. In particular, these embodiments implement "fuse and decompose" operations in quantum computing compilers, in which many quantum gates are "fused" into one large "unitary" operation and decomposed into different sequences of gates that reduce overall algorithmic errors and / or reduce the complexity of classical algorithmic steps such as optimization and synchronization. As described above, these techniques scale to large numbers of quantum modules.
[0093] 12A-B, near-term and mid-term quantum computing requires communication between quantum modules 1201-1206, which may be chiplets, cores, or any other distinguishable collection of qubits. FIG. 12A shows multiple quantum modules 1201-1206 connected via communication interconnect 1210 to form one larger quantum system 1200. FIG. 12B shows an example of gate-level interconnect between a first quantum module 1251 and a second quantum module 1252. In this particular example, quantum modules 1251-1252 include multiple single-qubit U-gates, which are used for illustrative purposes. However, it should be noted that the basic principles of the present invention may be implemented in modules having a variety of other qubit gate types.
[0094] 13A-13B and 14A-14B provide an overview of the fusion and decomposition techniques described herein. As shown in FIG. 13A, sequences of consecutive gates that are near the boundaries of a module 1301 and operate on no more than X qubits are identified, where X is a predefined threshold. Unitary generation logic 1310 then combines the sequences of gates into one large unitary matrix 1302.
[0095] 13B, decomposition logic 1310 then decomposes this unitary 1302 into multiple alternative gate sequences 1320. For each decomposition, an exact gate sequence may be generated (e.g., 1321), or an approximate gate sequence may be used, as described below in connection with FIGS.
[0096] In the following example, the fusion and decomposition techniques are implemented on an exemplary 2D grid topology to highlight how fusion and decomposition can be scaled up in parallel on multi-module devices.
[0097] Shown in Figure 14A are four modules 1401-1404, each having multiple qubits 1410. The goal is to reduce communication between modules 1401-1404 by reducing gates that cross intermodule lines 1440.
[0098] As shown in Figure 14B, the first sequence of operations (subroutine 1) moves quantum gates to avoid crossing both the intermodule line 1440 and the cluster line 1450. In particular, a swap sequence is performed that minimizes the number of gates that cross these lines during one set of clock cycles. The cluster line 1450 is used to cluster multiple gates together. Fewer gates crossing the cluster line 1450 ensures that as many gates as possible can be used in the merge-decompose operation.
[0099] These operations may be optional, but may allow successively more clock cycles to be fused. Parallelizing the determination of this swap sequence across multiple qubits and across multiple clock cycles is trivial.
[0100] 15, the second sequence of operations (subroutine 2) includes two nested steps. First, partition generation logic 1550 identifies partitions of multiple qubits (e.g., 1510, 1511). Each partition must be no more than X qubits, where X is a predetermined number (e.g., 4, 6, 8, etc.). Second, for each of these partitions 1510, 1511, fusion and decomposition logic 1560-1561 performs the fusion and decomposition operations described above with respect to FIGS. 13A-13B. The fusion and decomposition operations may be performed over multiple clock cycles. Next, selection logic (not shown) selects the partition with the lowest cost function C min Select the decomposition result with
[0101] Embodiments of the present invention may use a variety of different cost functions. For example, the cost function may be a function of one or more of the following: decoherence time, change in execution time, local two-qubit gate error, intermodule two-qubit gate error, change in number of local gates, change in number of intermodule gates, and approximate simulation of a new circuit. Additional examples are provided below. FIG. 16A is a crude diagram of an embodiment of the present invention in the multi-module case. The optimization process alternates between subroutine 1 (SR1) and subroutine 2 (SR2), where subroutine 1 is the optimized swap sequence (see, e.g., FIG. 14B and related discussion). The clock cycles are labeled τ i FIG. 16B shows an example of the quantum gate positions during clock cycle 1 and clock cycle 2. Subroutine 2 is a parallel analysis of the selection of partition operations and fusion and decomposition operations, which can be performed over any number of clock cycles R. i (For illustration purposes, R1 and R2 clock cycles are shown.) The final cost function is min In some implementations, the sequence is a sum of period R i This may be further optimized by varying
[0102] Depending on the many parameters and hyperparameters over which optimization may be performed, these techniques can be made arbitrarily cheap or expensive. In some cases, for example, a user may choose to search only a small set of decompositions. Also, note that substantial compilation costs are often worth even a small reduction in quantum error.
[0103] Embodiments of the present invention may be applied internally to modules: for example, the fusion and decomposition techniques described herein may be used to reduce the depth or errors of any quantum circuit, even if the quantum device contains a single quantum module.
[0104] Furthermore, embodiments of the present invention are applicable to both short-term and long-term quantum computing hardware. For short-term multi-module hardware, the embodiments described herein may be used to reduce communication for the purpose of improving fidelity. Conversely, for the long term, the main focus of these techniques may shift to reducing quantum simulation time, including both quantum and classical subroutines (classical subroutines include compilation steps and execution synchronization). For long-term error correction hardware, the cost function primarily considers reducing the overall simulation time.
[0105] A method according to one embodiment of the present invention is illustrated in Figure 17. The method may be implemented on the architectures described below, but is not limited to any particular quantum processing architecture.
[0106] At 1701, a set of quantum modules are interconnected. As described above, each of the quantum modules may be an individual quantum processor, such as a chiplet or multi-chip module. At 1702, a swap sequence operation is performed to minimize adjacent gates at the boundaries (e.g., reduce inter-module communication). At 1703, a set of qubits for which gates are to be fused is selected. For example, a set of N qubits may be selected (e.g., N=4, 6, 8, etc.). At 1704, the gates on each set of qubits are fused and at 1705, decomposed into multiple alternative gate sequences.
[0107] A cost function is applied to each of the alternative gating sequences at 1706. The gating sequence with the smallest cost function is then selected.
[0108] Below are example cost functions: However, it should be noted that the underlying principles of the present invention are not limited to any particular cost function or set of cost functions.
[0109] Example Cost Function 1: Fast Criterion with Exact Decomposition.
number
[0110] Example Cost Function 2: Fast Criterion with Approximate Decomposition.
number
number
number
[0111] Example Cost Function 3: Tensor Network Criterion. This implementation applies equally to both exact and approximate decomposition methods.
[0112] 1.(a) Noise-free circuit ψ NF , (b) Original noise circuit ψ orig , and (c) the candidate approximation circuit,ψ candi We construct three tensor networks of N qubits for . We include gates that are prone to decoherence and errors by introducing “noise gates” and / or “error gates”.
[0113] 2. The initial state is arbitrary, i.e. it may be chosen as an equal superposition, a density matrix of a plausible input subspace, or other user-defined choice.
[0114] 3. Build a network to calculate the cost function.
number
[0115] To accelerate the computation, intermediate singular value decomposition (SVD) may be used for the less sophisticated tensor network computations. This methodology will be readily understood by those skilled in the art (e.g., theorists in the field of quantum computing).
[0116] The techniques described above are applicable to any hardware type, including but not limited to arrays of quantum dots on the same silicon wafer (communication type: on-chip interconnect), superconducting chips in different bridges (communication type: photonic interconnect), and ion trap qubit arrays in different bridges (communication type: photonic interconnect).
[0117] In the above detailed description, references are made to the accompanying drawings which form a part hereof, and in which are shown by way of example embodiments which may be practiced. It is to be understood that other embodiments may be utilized and structural or logical changes may be made without departing from the scope of the present disclosure. Therefore, the following detailed description is not to be taken in a limiting sense.
[0118] Various operations may be described as multiple separate acts or operations, ordered in a manner that is most helpful in understanding the claimed subject matter. However, the order of description should not be construed to imply that these operations are necessarily order dependent. In particular, these operations may not be performed in the order presented. The described acts may be performed in a different order than in the described embodiment. Various additional operations may be performed and / or described operations may be omitted in additional embodiments. The terms "first," "second," "third," etc. do not imply a particular order unless otherwise specified.
[0119] [example]
[0120] Below are exemplary implementations of different embodiments of the present invention.
[0121] Example 1. A method comprising combining a group of quantum gates to form at least one unitary operation; decomposing the unitary operation into a plurality of alternative gate sequences, including either exact or approximate gate sequences; and evaluating the plurality of alternative gate sequences based on a cost function to identify at least one of the gate sequences.
[0122] Example 2. The method of Example 1, wherein the population of quantum gates includes a first subset of a plurality of quantum gates across a plurality of interconnected quantum modules.
[0123] Example 3. The method of Example 2, further comprising: partitioning the plurality of quantum gates into a plurality of subsets of quantum gates, including the first subset; combining the quantum gates in each subset to form a separate unitary operation; decomposing each of the unitary operations into a plurality of alternative gate sequences; and evaluating the plurality of alternative gate sequences based on a cost function to identify at least one of the gate sequences.
[0124] Example 4. The evaluating step further comprises adding cost function values determined from each of the plurality of alternative gate sequences decomposed from each of the unitary operations to generate a plurality of cost values; and The method of Example 3, comprising selecting the combination of gate sequences associated with a minimum of the cost values.
[0125] Example 5. The method of Example 1, wherein the cost function is based on one or more of a decoherence time, a change in execution time, a local two-qubit gate error, an intermodule two-qubit gate error, a change in the number of local gates, a change in the number of intermodule gates, and an approximate simulation of the circuit.
[0126] Example 6. The method of Example 3, further comprising identifying the set of quantum gates to be used to form the unitary operation within a first module, the step including identifying a sequence of consecutive gates within the first module that are within a specified proximity of a boundary of the first module and that operate on no more than X qubits, where X is a predetermined threshold.
[0127] Example 7. The method of Example 6, wherein the identifying step further comprises identifying a configuration in which the group of quantum gates is moved to a different location within the first module to minimize or reduce a number of interconnections with quantum gates in a second module.
[0128] Example 8. The method of example 7, wherein the first module and the second module each include a quantum processor including a plurality of qubits.
[0129] Example 9. The method of Example 7, wherein the first module and the second module each include an array of quantum dots on a silicon wafer, a superconducting chip in a different bridge, and / or an ion trap qubit array in a different bridge.
[0130] Example 10. The method of example 1, wherein the set of quantum gates is contained in a single quantum module.
[0131] Example 11. 1. An apparatus comprising: a quantum module including a plurality of qubits; unitary generation logic for combining a group of quantum gates to form at least one unitary operation; decomposition logic for decomposing the unitary operation into a plurality of alternative gate sequences, including either exact or approximate gate sequences; and selection logic for evaluating the plurality of alternative gate sequences based on a cost function to identify at least one of the gate sequences.
[0132] Example 12. The apparatus of example 11, wherein the quantum module comprises one of a plurality of interconnected quantum modules, the population of quantum gates comprises a first subset of a plurality of quantum gates, and at least some of the plurality of quantum gates span the interconnected quantum modules.
[0133] Example 13. The apparatus of Example 12 further comprises partitioning logic for partitioning the plurality of quantum gates into a plurality of subsets of quantum gates including the first subset, the unitary logic combining the quantum gates in each subset to form a separate unitary operation, the decomposition logic decomposing each of the unitary operations into a plurality of alternative gate sequences, and the selection logic evaluating the plurality of alternative gate sequences based on a cost function to identify at least one of the gate sequences.
[0134] Example 14. The apparatus of Example 13 further comprises cost summation logic for adding cost function values determined from each of the plurality of alternative gate sequences decomposed from each of the unitary operations to generate a plurality of cost values, the selection logic selecting a combination of gate sequences associated with a minimum of the cost values.
[0135] Example 15. The apparatus of example 11, wherein the cost function is based on one or more of a decoherence time, a change in execution time, a local two-qubit gate error, an intermodule two-qubit gate error, a change in the number of local gates, a change in the number of intermodule gates, and an approximate simulation of the circuit.
[0136] Example 16. The apparatus of Example 13, wherein the partitioning logic identifies the set of quantum gates to be used to form the unitary operation within a first module, the identifying including identifying within the first module a sequence of consecutive gates that are within a specified proximity of a boundary of the first module and that operate on no more than X qubits, where X is a predetermined threshold.
[0137] Example 17. The apparatus of Example 16, wherein to identify the group of quantum gates within the first module, the partitioning logic identifies an arrangement that moves the group of quantum gates to a different location within the first module to minimize or reduce a number of interconnections with quantum gates in a second module.
[0138] Example 18. The apparatus of example 17, wherein the first module and the second module each include a quantum processor including a plurality of qubits.
[0139] Example 19. The apparatus of Example 17, wherein the first module and the second module each include an array of quantum dots on a silicon wafer, a superconducting chip in a different bridge, and / or an ion trap qubit array in a different bridge.
[0140] Example 20. A machine-readable medium having program code stored thereon that, when executed by a qubit controller, causes a qubit controller to perform steps of combining a group of quantum gates to form at least one unitary operation, decomposing the unitary operation into a plurality of alternative gate sequences, including either an exact gate sequence or an approximate gate sequence, and evaluating the plurality of alternative gate sequences based on a cost function to identify at least one of the gate sequences.
[0141] Example 21. The machine-readable medium of Example 20, wherein the population of quantum gates includes a first subset of a plurality of quantum gates across a plurality of interconnected quantum modules.
[0142] Example 22. Providing a machine with the steps of partitioning the plurality of quantum gates into a plurality of subsets of quantum gates, including the first subset; combining said quantum gates in each subset to form distinct unitary operations; decomposing each of said unitary operations into a plurality of alternative gate sequences; and 22. The machine-readable medium of Example 21, further comprising program code for performing a procedure of evaluating the plurality of alternative gating sequences based on a cost function to identify at least one of the gating sequences.
[0143] Example 23. The evaluating step further comprises adding cost function values determined from each of the plurality of alternative gate sequences decomposed from each of the unitary operations to generate a plurality of cost values; and 23. The machine-readable medium of example 22, comprising selecting a combination of gate sequences associated with a minimum of the cost values.
[0144] Example 24. The machine-readable medium of example 20, wherein the cost function is based on one or more of a decoherence time, a change in execution time, a local two-qubit gate error, an intermodule two-qubit gate error, a change in the number of local gates, a change in the number of intermodule gates, and an approximate simulation of the circuit.
[0145] Example 25. The machine-readable medium of Example 22, further comprising identifying the set of quantum gates to be used to form the unitary operation within a first module, the identifying comprising identifying a sequence of consecutive gates within the first module that are within a specified proximity of a boundary of the first module and that operate on no more than X qubits, where X is a predetermined threshold.
[0146] Example 26. The machine-readable medium of Example 25, wherein the identifying step further includes identifying a configuration in which the group of quantum gates is moved to a different location within the first module to minimize or reduce a number of interconnections with quantum gates in a second module.
[0147] Example 27. The machine-readable medium of Example 26, wherein the first module and the second module each include a quantum processor including a plurality of qubits.
[0148] Example 28. The machine-readable medium of Example 26, wherein the first module and the second module each include an array of quantum dots on a silicon wafer, a superconducting chip in a different bridge, and / or an ion trap qubit array in a different bridge.
[0149] Example 29. The machine-readable medium of example 20, wherein the bank of quantum gates is contained in a single quantum module.
[0150] For purposes of this disclosure, the phrase "A and / or B" means (A), (B) or (A and B). For purposes of this disclosure, the phrase "A, B and / or C" means (A), (B), (C) (A and B), (A and C), (B and C) or (A, B and C). When the term "between" is used in reference to a range of measurements, both ends of the range of measurements are included. As used herein, the phrase "A / B / C" means (A), (B) and / or (C).
[0151] The description uses the phrases "in one embodiment" or "in an embodiment," each of which may refer to one or more of the same or different embodiments. Additionally, the terms "comprising," "including," "having," and the like, are synonymous when used in reference to embodiments of the present disclosure.
[0152] An embodiment of the present invention may include various steps described above. The steps may be embodied in machine-executable instructions that may be used to cause a general-purpose or special-purpose processor to perform the steps. Alternatively, the steps may be performed by specific hardware components that contain hardwired logic for performing the steps, or by any combination of programmed computer components and custom hardware components.
[0153] As described herein, instructions may refer to a particular configuration of hardware, such as an application specific integrated circuit (ASIC) configured to perform a particular operation or having a predetermined functionality, or software instructions stored in memory embodied in a non-transitory computer readable medium. Thus, the techniques illustrated in the figures may be implemented using code and data stored and executed in one or more electronic devices (e.g., end stations, network elements, etc.). Such electronic devices store and communicate (internally and / or with other electronic devices over a network) code and data using computer machine readable media, such as non-transitory computer machine readable storage media (e.g., magnetic disks, optical disks, random access memory, read only memory, flash memory devices, phase change memory) and transient computer machine readable communication media (e.g., electrical, optical, acoustic or other forms of propagated signals, such as carrier waves, infrared signals, digital signals, etc.).
[0154] Further, such electronic devices typically include a set of one or more processors coupled to one or more other components, such as one or more storage devices (non-transitory machine-readable storage media), user input / output devices (e.g., keyboards, touch screens, and / or displays), and network connections. The coupling of the processors and the set of other components is typically through one or more buses and bridges (also referred to as bus controllers). The signals carrying the storage devices and network traffic represent one or more machine-readable storage media and machine-readable communication media, respectively. Thus, the storage devices of a given electronic device typically store code and / or data for execution on the set of one or more processors of that electronic device. Of course, one or more portions of the embodiments of the present invention may be implemented using different combinations of software, firmware, and / or hardware. Throughout this detailed description, for purposes of explanation, numerous specific details have been set forth in order to provide a thorough understanding of the present invention. However, it will be apparent to one skilled in the art that the present invention may be practiced without some of these specific details. In certain instances, well-known structures and functions have not been described in the detailed description in order to avoid obscuring the subject matter of the present invention. Therefore, the scope and spirit of the invention should be judged in terms of the following claims.
Claims
1. combining a group of quantum gates to form at least one unitary operation; decomposing the unitary operation into a number of alternative gate sequences, including either exact gate sequences or approximate gate sequences; and The method comprises evaluating the plurality of alternative gating sequences based on a cost function to identify at least one of the gating sequences.
2. 10. The method of claim 1, wherein the population of quantum gates comprises a first subset of a plurality of quantum gates across a plurality of interconnected quantum modules.
3. partitioning the plurality of quantum gates into a plurality of subsets of quantum gates, the subset including the first subset; combining the quantum gates in each subset to form distinct unitary operations; decomposing each of said unitary operations into a plurality of alternative gate sequences; and 3. The method of claim 2, further comprising evaluating the plurality of alternative gating sequences based on a cost function to identify at least one of the gating sequences.
4. The evaluating step further comprises: adding the cost function values determined from each of the plurality of alternative gate sequences decomposed from each of the unitary operations to generate a plurality of cost values; and 4. The method of claim 3, further comprising the step of selecting a combination of gate sequences associated with a minimum of said cost values.
5. 5. The method of claim 1 , wherein the cost function is based on one or more of: decoherence time, change in execution time, local two-qubit gate error, intermodule two-qubit gate error, change in number of local gates, change in number of intermodule gates, and approximate simulation of the circuit.
6. 6. The method of claim 3, further comprising identifying the set of quantum gates within a first module to be used to form the unitary operation, the identifying comprising identifying a sequence of consecutive gates within the first module that are within a specified proximity of a boundary of the first module and operate on no more than X qubits, where X is a predetermined threshold.
7. The identifying step further comprises:
7. The method of claim 6, comprising moving the group of quantum gates to different locations within the first module to identify an arrangement that minimizes or reduces a number of interconnections with quantum gates in a second module.
8. The method of claim 7 , wherein the first module and the second module each comprise a quantum processor including a plurality of qubits.
9. 8. The method of claim 7, wherein the first module and the second module each comprise an array of quantum dots on a silicon wafer, a superconducting chip in a different bridge, and / or an ion trap qubit array in a different trap.
10. 10. The method of claim 1, wherein the set of quantum gates is comprised in a single quantum module.
11. A quantum module containing multiple qubits; unitary generation logic for combining a group of quantum gates to form at least one unitary operation; decomposition logic for decomposing the unitary operation into a number of alternative gate sequences, including either exact gate sequences or approximate gate sequences; and an apparatus comprising selection logic for evaluating the plurality of alternative gating sequences based on a cost function to identify at least one of the gating sequences.
12. 12. The apparatus of claim 11 , wherein the quantum module comprises one of a plurality of interconnected quantum modules, the group of quantum gates comprises a first subset of a plurality of quantum gates, and at least a portion of the plurality of quantum gates span the interconnected quantum modules.
13. further comprising partitioning logic for partitioning the plurality of quantum gates into a plurality of subsets of quantum gates, the subset including the first subset; the unitary logic combining the quantum gates in each subset to form separate unitary operations; the decomposition logic decomposing each of the unitary operations into a plurality of alternative gate sequences; 13. The apparatus of claim 12, wherein the selection logic evaluates the multiple alternative gating sequences based on a cost function to identify at least one of the gating sequences.
14. and cost summation logic for adding cost function values determined from each of the plurality of alternative gate sequences decomposed from each of the unitary operations to generate a plurality of cost values; The apparatus of claim 13 , wherein the selection logic selects the combination of gate sequences associated with a minimum of the cost values.
15. 15. The apparatus of claim 11, wherein the cost function is based on one or more of: decoherence time, change in execution time, local two-qubit gate error, intermodule two-qubit gate error, change in number of local gates, change in number of intermodule gates, and approximate simulation of a circuit.
16. 16. The apparatus of claim 13, wherein the partitioning logic identifies the set of quantum gates within a first module to be used to form the unitary operation, the identifying comprising identifying a sequence of consecutive gates within the first module that are within a specified proximity of a boundary of the first module and operate on no more than X qubits, where X is a predetermined threshold.
17. 17. The apparatus of claim 16, wherein to identify the group of quantum gates within the first module, the partitioning logic identifies an arrangement that moves the group of quantum gates to a different location within the first module to minimize or reduce a number of interconnections with quantum gates in a second module.
18. 20. The apparatus of claim 17, wherein the first module and the second module each comprise a quantum processor including a plurality of qubits.
19. 20. The apparatus of claim 17, wherein the first module and the second module each comprise an array of quantum dots on a silicon wafer, a superconducting chip in a different bridge, and / or an ion trap qubit array in a different trap.
20. A machine-readable medium having program code stored thereon, the program code, when executed by a qubit controller, combining a group of quantum gates to form at least one unitary operation; decomposing said unitary operations into a number of alternative gate sequences, including either exact or approximate gate sequences; and A machine-readable medium causing a procedure to evaluate the plurality of alternative gating sequences based on a cost function to identify at least one of the gating sequences.
21. 21. The machine-readable medium of claim 20, wherein the population of quantum gates comprises a first subset of a plurality of quantum gates across a plurality of interconnected quantum modules.
22. The machine, partitioning the plurality of quantum gates into a plurality of subsets of quantum gates, the subset including the first subset; combining said quantum gates in each subset to form distinct unitary operations; decomposing each of said unitary operations into a plurality of alternative gate sequences; and 22. The machine readable medium of claim 21, further comprising program code for causing the step of evaluating the plurality of alternative gating sequences based on a cost function to identify at least one of the gating sequences.
23. The evaluating step further comprises: adding the cost function values determined from each of the plurality of alternative gate sequences decomposed from each of the unitary operations to generate a plurality of cost values; and 23. The machine readable medium of claim 22, further comprising the step of selecting a combination of gating sequences associated with a minimum of the cost values.
24. 24. The machine-readable medium of claim 20, wherein the cost function is based on one or more of: decoherence time, change in execution time, local two-qubit gate error, intermodule two-qubit gate error, change in number of local gates, change in number of intermodule gates, and approximate simulation of a circuit.
25. 25. The machine-readable medium of claim 22, further comprising identifying the set of quantum gates within a first module to be used to form the unitary operation, the identifying comprising identifying a sequence of consecutive gates within the first module that are within a specified proximity of a boundary of the first module and operate on no more than X qubits, where X is a predetermined threshold.
