A quantum chip and methods for optimizing a quantum circuit operations scheduling thereon

The modular quantum chip layout and optimized scheduling of quantum operations address the inefficiencies in existing FTQC technologies by reducing qubit usage and error accumulation, enhancing the feasibility and efficiency of quantum computation through parallelization and robust scheduling.

WO2024231838A1PCT designated stage expired Publication Date: 2024-11-141QB INFORMATION TECHNOLOGIES INC
View PDF 0 Cites 1 Cited by

Patent Information

Application Number
PCT/IB2024/054449
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Priority Date
2024-02-23
Filing Date
2024-05-07
Publication Date
2024-11-14

AI Technical Summary

Technical Problem

Current fault-tolerant quantum computation (FTQC) technologies face challenges in reducing error accumulation due to computational latencies, and existing quantum chip layouts and scheduling methods are inefficient, limiting the feasibility of large-scale quantum computing.

Method used

The design of a quantum chip layout with fewer qubits and optimized scheduling of quantum operations using a modular topology, incorporating magic state factories, data qubits, and a quantum bus, which employs optimization procedures like maximum independent set, Steiner tree problems, and integer programming to minimize time steps and reduce error accumulation.

Benefits of technology

This approach reduces the overall space-time cost of quantum systems, enhances the robustness of quantum operations scheduling, and allows for parallelization of quantum operations, thereby improving the feasibility and efficiency of quantum computation.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure IB2024054449_14112024_PF_FP_ABST
    Figure IB2024054449_14112024_PF_FP_ABST
Patent Text Reader

Abstract

A quantum chip and a method for optimizing scheduling of quantum circuit operations on a quantum chip are provided. The quantum chip may comprise at least one magic state factory comprising a plurality of qubits allowing the implementation of one or more non- Clifford gates and one or more distilling ports; a plurality of data qubits; and a quantum bus comprising qubits adjacent and operatively coupled to each of the one or more distilling ports of the at least one magic state factory and to each of the qubits of the plurality of data qubits, the quantum bus used to connect the at least one magic state factory with at least one of the plurality of data qubits using the one or more distilling ports. The method may comprise obtaining a quantum circuit and a layout representative of qubit types and an arrangement of qubits on the quantum chip.
Need to check novelty before this filing date? Find Prior Art

Description

A QUANTUM CHIP AND METHODS FOR OPTIMIZING A QUANTUM CIRCUIT OPERATIONS SCHEDULING THEREONCROSS-REFERENCE

[0001] This application claims the benefit of U.S. Provisional Application No. 63 / 500,908, filed May 08, 2023, U.S. Provisional Application No. 63 / 620,333, filed January 12, 2024, and U.S. Provisional Application No. 63 / 557,334, filed February 23, 2024, each of which applications are incorporated herein by reference in their entireties.BACKGROUND

[0002] Fault-tolerant quantum computation (FTQC) may be useful to unlock the advantages proposed for quantum computing, but applicable FTQC technology has yet to be developed. While FTQC devices would, in theory, manage the errors that accumulate during computation, finding ways to make physical FTQC hardware more feasible may help to bridge the gap between application and hardware development.SUMMARY

[0003] An example approach to making FTQC hardware more feasible is to reduce error accumulation caused by computational latencies or other issues. In an example, one approach to reducing error accumulation is to: (i) design quantum chip layouts such that they use fewer qubits and (ii) optimize the scheduling of the quantum operations in a quantum circuit by minimizing the number of time steps used to execute a given quantum algorithm. The quantum chip layout problem (i) and the quantum circuit operations scheduling problem (ii) may be interdependent and may be solved jointly as a quantum compilation problem (Beverland et al., “Surface Code Compilation via Edge-Disjoint Paths,” PRX Quantum 3, 020342, 2022, which is incorporated herein by reference in its entirety). In solving this problem, one aim is to reduce the overall space-time cost of the quantum system without violating the quantum circuit’s logical constraints and quantum hardware’s physical constraints.

[0004] The present disclosure provides methods and systems for solving the quantum compilation problem by optimizing scheduling of quantum circuit operations on a quantum chip comprising at least one magic state factory, a plurality of data qubits, and a quantum bus. One focus is on the design of a quantum chip layout using the quantum error correction schemes for FTQC and an algorithm for generating the scheduling of the quantum operations of a quantum circuit using the quantum chip layout design that reduces the quantum computation time within a reasonable classical computation time. The present disclosure may improve upon existing quantum chip layouts and methods for optimizing scheduling of quantum circuit operations thereon by using a modular quantum chip layout topology. For example, magic state factories may be surrounded by other qubit types (data, ancillary, storage, and bus), forming modules that can be tiled together for large-scale quantum chips. In some cases, a layout may comprise dedicated blocks, where one block comprises the data qubits, another block comprises the magic state factories, and a third block is proposed to intermediate the connections between the other blocks using magic state storage qubits, while a quantum bus connects all the blocks. These designs may be used for generating quantum chips where the quantum operations may be performed in parallel. The scheduling of the quantum operations may be generated using optimization procedures used to solve problems comprising the maximum independent set problem, Steiner tree problems, and integer programming problems, which model the original optimization problem. Examples of such procedures may comprise topological sorting, heuristics, and branch-and-bound.

[0005] Systems and methods of the present disclosure and the disclosed quantum chip may provide at least some of the following advantages. The disclosed quantum chip layouts may allow for the connection of qubits through multiple ancilla patches using a quantum bus, while the compiler may schedule multiple quantum operations requiring the connection of any number of qubits within a single time step, thus reducing the expected quantum computation time for the quantum circuit. By using magic state storage qubits, the distillation process for higher fidelity magic states may be restarted sooner, resulting in an improved distillation rate. This, in turn, may reduce the number of required magic state factories and, consequently, the logical qubits necessary for optimal scheduling. A quantum chip with a designated block for magic state storage may enhance the robustness of the compiler’s proposed schedule, as it allows for ancilla patches generated during thecompilation process to remain valid when considering the uncertainties involved in the magic state distillation process. Qubits frequently connected may be positioned closer to each other in the quantum chip layout to reduce the size of ancilla patches required to connect them. This may decrease the number of qubits blocked by the ancilla patch in the current time step, increasing the potential for parallelizing quantum operations.

[0006] In an aspect, the present disclosure provides a quantum chip. The quantum chip may comprise: (a) at least one magic state factory comprising: a plurality of qubits configured to implement one or more non-Clifford gates and one or more distilling ports; (b) a plurality of data qubits; and (c) a quantum bus comprising bus qubits adjacent and operatively coupled to each of said one or more distilling ports of said at least one magic state factory and to one or more qubits of said plurality of data qubits, wherein said quantum bus is configured to connect said at least one magic state factory with at least one of said plurality of data qubits using said one or more distilling ports.

[0007] In some embodiments, said quantum bus comprises at least one non-contractible sub-bus. In some embodiments, said at least one magic state factory comprises two or more magic state factories arranged in multiple distillation levels. In some embodiments, the quantum chip further comprises one or more magic state storage qubits. In some embodiments, said quantum bus is configured to connect said at least one magic state factory with at least one of said plurality of data qubits using said one or more distilling ports mediated via said magic state storage qubits.

[0008] In some embodiments, the quantum chip further comprises one or more qubit resizing spaces, wherein said one or more qubit resizing spaces are configured to perform one or more qubit resizing quantum operations. In some embodiments, said one or more non-Clifford gates comprise at least one member selected from the group consisting of: a Toffoli gate, a TT / 8 Z-rotation gate (T-gate), and a quantum rotational gate.

[0009] In some embodiments, said quantum chip has a layout representative of qubit types and an arrangement thereof on said quantum chip, wherein said layout comprises at least one member selected from the group consisting of: tiles, triangles, hexagons, and rectangles. In some embodiments, said quantum chip has a qubit type comprising at least one member selected from the group consisting of: bus qubits, data qubits, magic statestorage qubits, ancillary qubits, distilling ports, magic state factory qubits, magic state factory bus qubits, magic state factory data qubits, magic state factory storage qubits, and magic state factory ancillary qubits. In some embodiments, said quantum chip has a layout comprising two or more magic state factory qubits surrounded by one or more distilling ports and two or more qubits of any qubit type selected from the group consisting of: bus qubits, data qubits, magic state storage qubit, and ancillary qubits; said layout further comprising two or more bus qubits surrounding said two or more qubits. In some embodiments, said quantum chip has a layout comprising: a first block of qubits comprising one or more data qubits surrounded by one or more bus qubits; a second block of qubits adjacent to said first block, said second block comprising one or more magic state storage qubits and one or more bus qubits; and a third block of qubits adjacent to said second block, said third block comprising at least one magic state factory comprising one or more distilling ports and a plurality of magic state factory qubits.

[0010] In some embodiments, said quantum chip has a layout comprising building blocks of tileable subsystems. In some embodiments, said quantum chip has a layout comprising one or more blocks of four data qubits placed adjacent to each other in a two-by-two table and surrounded by twelve bus qubits. In some embodiments, said quantum chip has a layout comprising a qubit lattice corresponding to a topological quantum code. In some embodiments, said topological quantum code is a surface code, a rotated surface code, or a colour code.

[0011] In another aspect, the present disclosure provides a method for scheduling quantum circuit operations on a quantum chip comprising at least one magic state factory, a plurality of data qubits, and a quantum bus. The method may comprise: (a) obtaining a quantum circuit and a layout, wherein said layout is representative of one or more qubit types and an arrangement of qubits on said quantum chip, wherein said quantum circuit comprises one or more quantum operations; (b) optimizing said scheduling of said one or more quantum operations, wherein said scheduling is subject to one more constraints, wherein said one or more constraints are base at least in part on said layout and by said quantum circuit, and wherein said optimizing comprises solving at least a vertex-disjoint tree packing problem; and (c) reporting an optimized quantum circuit comprising the optimized scheduling of said one or more quantum operations.

[0012] In some embodiments, (b) comprises optimizing said quantum circuit by removing at least one of said one or more quantum operations, wherein said at least one of said one or more quantum operations comprises a Clifford gate. In some embodiments, (b) comprises minimizing computation time of said one or more quantum operations. In some embodiments, said layout comprises a qubit lattice corresponding to a topological quantum code. In some embodiments, said topological quantum code is a surface code, a rotated surface code, or a colour code. In some embodiments, said layout comprises at least one member selected from the group consisting of: tiles, triangles, hexagons, and rectangles.

[0013] In some embodiments, said one or more qubit types comprise at least one member of the group consisting of: bus qubits, data qubits, magic state storage qubits, ancillary qubits, distilling ports, magic state factory qubits, magic state factory bus qubits, magic state factory data qubits, magic state factory storage qubits, and magic state factory ancillary qubits. In some embodiments, said layout comprises two or more magic state factory qubits surrounded by one or more distilling ports and two or more qubits of any qubit type selected from the group consisting of: bus qubits, data qubits, magic state storage qubit, and ancillary qubits; said layout further comprising two or more bus qubits surrounding said two or more qubits. In some embodiments, said layout comprises: a first block of qubits comprising one or more data qubits surrounded by one or more bus qubits; a second block of qubits adjacent to said first block, said second block comprising one or more magic state storage qubits and one or more bus qubits; and a third block of qubits adjacent to said second block, said third block comprising at least one magic state factory comprising one or more distilling ports and a plurality of magic state factory qubits.

[0014] In some embodiments, said arrangement of said qubits comprises building blocks of tileable subsystems. In some embodiments, said quantum circuit comprises a sequence of quantum operations comprising at least one member selected from the group consisting of: a Toffoli gate, a71 / Q Z-rotation gate, and a quantum rotational gate.

[0015] In some embodiments, the method further comprises implementing and executing said optimized quantum circuit. In some embodiments, (b) comprises: (bl) translating said quantum circuit comprising said one or more quantum operations to a dependencygraph; (b2) using said dependency graph and said layout to define an optimization problem; and (b3) using an optimization procedure to solve said optimization problem to schedule said one or more quantum operations of said quantum circuit. In some embodiments, said optimization procedure comprises at least one member of the group consisting of a maximum independent set, Steiner trees, topological sorting, integer programming, branch-and-bound, branch-and-cut, and an interior-point. In some embodiments, said optimization problem comprises an objective function minimizing the quantum computation time, quantum circuit’s logical constraints, and quantum hardware’s physical constraints. In some embodiments, (b3) comprises solving an assignment problem to decide on the available plurality of data qubits to be used.

[0016] In another aspect, the present disclosure provides a system for optimizing scheduling of quantum circuit operations on quantum chip comprising at least one magic state factory, a plurality of data qubits, and a quantum bus. The system may comprise: a digital computer comprising a memory having instructions which when executed are configured to at least: (i) obtain a quantum circuit and a layout, wherein said layout is representative of one or more qubit types and an arrangement of qubits on said quantum chip, wherein said quantum circuit comprises one or more quantum operations; (ii) optimize said scheduling of said one or more quantum operations, wherein said scheduling is subject to one more constraints, wherein said one or more constraints are based at least in part on said layout and said quantum circuit, and wherein said optimizing comprises solving at least a vertex-disjoint tree packing problem; and (iii) report an optimized quantum circuit comprising the optimized scheduling of said one or more quantum operations; and wherein said digital computer is communicatively coupled to a quantum computer, wherein said quantum computer is configured to implement said scheduled quantum circuit.

[0017] In some embodiments, the system further comprises said quantum computer. In some embodiments, said quantum computer comprises the quantum chip of any aspect or embodiment. In some embodiments, the system further comprises a special-purpose computing platform, wherein said special-purpose computing platform is configured to receive and execute instructions to at least implement an optimization procedure to solve an optimization problem to optimize said quantum circuit operations, wherein saidspecial-purpose computing platform is communicatively coupled to said digital computer or to said quantum computer or both. In some embodiments, said special-purpose computing platform comprises at least one member of the group consisting of: a central processing unit (CPU), a field-programmable gate array (FPGA), an application-specific integrated circuit (ASIC), a graphics processing unit (GPU), a tensor processing unit (TPU), and a tensor streaming processor (TSP).

[0018] In another aspect, the present disclosure provides a system for scheduling quantum circuit operations on a quantum chip comprising at least one magic state factory, a plurality of data qubits, and a quantum bus. The system may comprise: a quantum computer comprising a quantum chip comprising: (i) at least one magic state factory comprising a plurality of qubits configured to implement one or more non-Clifford gates and one or more distilling ports; (ii) a plurality of data qubits; and (iii) a quantum bus comprising bus qubits adjacent and operatively coupled to each of said one or more distilling ports of said at least one magic state factory and to one or more qubits of said plurality of data qubits; wherein said quantum computer is configured to execute said quantum circuit operations; and wherein said quantum computer is communicatively coupled to a digital computer, wherein said digital computer configured to optimize scheduling of said quantum circuit operations on said quantum chip.

[0019] In some embodiments, the system further comprises said digital computer. In some embodiments, the digital computer is configured to implement the method of any aspect or embodiment.

[0020] In some embodiments, the system further comprises a special-purpose computing platform, wherein said special-purpose computing platform is configured to receive and execute instructions to at least implement an optimization procedure to solve an optimization problem to optimize said quantum circuit operations, wherein said specialpurpose computing platform is communicatively coupled to said digital computer or to said quantum computer or both. In some embodiments, said special-purpose computing platform comprises at least one member of the group consisting of: a central processing unit (CPU), a field-programmable gate array (FPGA), an application-specific integrated circuit (ASIC), a graphics processing unit (GPU), a tensor processing unit (TPU), and a tensor streaming processor (TSP).

[0021] Additional aspects and advantages of the present disclosure will become readily apparent to those skilled in the art from the following detailed description, wherein only illustrative embodiments of the present disclosure are shown and described. As will be realized, the present disclosure is capable of other and different embodiments, and its several details are capable of modifications in various obvious respects, all without departing from the disclosure. Accordingly, the drawings and description are to be regarded as illustrative in nature, and not as restrictive.INCORPORATION BY REFERENCE

[0022] All publications, patents, and patent applications mentioned in this specification are herein incorporated by reference to the same extent as if each individual publication, patent, or patent application was specifically and individually indicated to be incorporated by reference. To the extent publications and patents or patent applications incorporated by reference contradict the disclosure contained in the specification, the specification is intended to supersede and / or take precedence over any such contradictory material.BRIEF DESCRIPTION OF THE DRAWINGS

[0023] The novel features of the invention are set forth with particularity in the appended claims. A better understanding of the features and advantages of the present invention will be obtained by reference to the following detailed description that sets forth illustrative embodiments, in which the principles of the invention are utilized, and the accompanying drawings (also “Figure” and “FIG.” herein), of which:

[0024] FIG. 1 A is a diagram of an example quantum chip layout comprising at least one magic state factory, surrounded by a plurality of data qubits and a quantum bus.

[0025] FIG. IB is a diagram of an example quantum chip layout comprising a block having at least one magic state factory, a block having at least one magic state storage qubit, and a block having a plurality of data qubits and a quantum bus.

[0026] FIG. 1C is a diagram of an example quantum chip layout comprising a triangular colour code with at least one magic state factory, a plurality of data qubits, and a quantum bus.

[0027] FIG. 2 is a diagram of the example quantum chip layout disclosed with respect to FIG. IB with many ancilla patches that may be used to connect multiple qubits to perform quantum operations in parallel.

[0028] FIG. 3 is a schematic of an example system for optimizing scheduling of quantum circuit operations on a quantum chip comprising at least one magic state factory, a plurality of data qubits, and a quantum bus, in accordance with some embodiment disclosed herein.

[0029] FIG. 4 is a flowchart of an example method for optimizing scheduling of quantum circuit operations on a quantum chip comprising at least one magic state factory, a plurality of data qubits, and a quantum bus, in accordance with some embodiment disclosed herein.

[0030] FIG. 5 is a flowchart of an example procedure for optimizing scheduling of quantum circuit operations on a quantum chip, the procedure used by the method disclosed with respect to FIG. 4, in accordance with some embodiment disclosed herein.DETAILED DESCRIPTION OF THE INVENTION

[0031] While various embodiments of the invention are shown and described herein, it will be obvious to those skilled in the art that such embodiments are provided by way of example only. Numerous variations, changes, and substitutions may occur to those skilled in the art without departing from the invention. It should be understood that various alternatives to the embodiments of the invention described herein may be employed.

[0032] Neither the Title nor the Abstract is to be taken as limiting in any way the scope of the disclosed invention(s). The title of the present application and headings of sections provided in the present application are for convenience only and are not to be taken as limiting the disclosure in any way.

[0033] Unless otherwise defined, all technical terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. As used in this specification and the appended claims, the singular forms “a,” “an,” and “the” include plural references unless the context clearly dictates otherwise. Any reference to “or” herein is intended to encompass “and / or” unless otherwise stated.

[0034] The term “plurality” generally refers to “two or more,” unless expressly specified otherwise.

[0035] The term “e.g.” and like terms mean “for example,” and thus do not limit the terms or phrases they explain. For example, in a sentence “the computer sends data (e.g., instructions, a data structure) over the Internet,” the term “e.g.” explains that “instructions” are an example of “data” that the computer may send over the Internet, and also explains that “a data structure” is an example of “data” that the computer may send over the Internet. However, both “instructions” and “a data structure” are merely examples of “data,” and other things besides “instructions” and “a data structure” can be “data.”

[0036] Whenever the term “at least,” “greater than,” or “greater than or equal to” precedes the first numerical value in a series of two or more numerical values, the term “at least,” “greater than,” or “greater than or equal to” applies to each of the numerical values in that series of numerical values. For example, greater than or equal to 1, 2, or 3 is equivalent to greater than or equal to 1, greater than or equal to 2, or greater than or equal to 3.

[0037] Whenever the term “no more than,” “less than,” or “less than or equal to” precedes the first numerical value in a series of two or more numerical values, the term “no more than,” “less than,” or “less than or equal to” applies to each of the numerical values in that series of numerical values. For example, less than or equal to 3, 2, or 1 is equivalent to less than or equal to 3, less than or equal to 2, or less than or equal to 1.

[0038] Where values are described as ranges, the disclosure includes the disclosure of all possible sub-ranges within such ranges, as well as specific numerical values that fall within such ranges irrespective of whether a specific numerical value or specific subrange is expressly stated.

[0039] Certain inventive embodiments herein contemplate numerical ranges. When ranges are present, the ranges include the range endpoints. Additionally, every sub-range and value within the range is present as if explicitly written out.

[0040] The term “about” or “approximately” may mean within an acceptable error range for the particular value, which will depend in part on how the value is measured or determined, e.g., the limitations of the measurement system. For example, “about” may mean within 1 or more than 1 standard deviation, per the practice in the art. Alternatively, “about” may mean a range of up to 20%, up to 10%, up to 5%, or up to 1% of a given value. Where particular values are described in the application and claims, unless otherwise stated the term “about” meaning within an acceptable error range for the particular value may be assumed.

[0041] Systems and methods of the present disclosure provide optimization procedures for improving scheduling of quantum circuit operations on a quantum chip with a layout. While some progress has been made to solve these optimization problems, there remain considerable drawbacks. Two recent studies, by Litinski (Litinski, “A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery,” Quantum 3, p. 128, 2019, which is incorporated by reference herein in its entirety) and Beverland et al. (Beverland et al., “Surface Code Compilation via Edge-Disjoint Paths,” PRX Quantum 3, 020342, 2022, which is incorporated herein by reference in its entirety) proposed optimization procedures. However, these approaches may have limitations.

[0042] For example, quantum chip layouts with a contractible quantum bus may limit the scheduling of quantum operations to be done in serial since only a single multi-qubit ancilla patch can be generated at a time. In another example, systems and methods of the present disclosure may provide quantum buses which are non-contractible or which have at least one non-contractible sub-bus. A non-contractible quantum bus may comprise a layout of bus qubits in which at least one cycle is present. For example, if a graph is referred to in which vertices correspond to individual bus tiles, and two vertices are connected if the corresponding bus tiles share an edge (i.e., are adjacent to one another), then the graph is non-contractible because the graph does not have the mathematical property of being contractible (i.e., the graph contains a cycle).

[0043] In another example, systems and methods disclosure herein may allow for flexibility of allocation of magic state storage qubits. For example, a magic state storage qubit may not be dedicated to a particular magic state factory. Without being limited by theory, a drawback of dedicating magic state storage qubits to the magic state factories is that when the magic state distillation fails to send a magic state to its storage, the quantum operations scheduled to use an empty magic state storage qubit may need to be rescheduled to use another magic state storage qubit or distilling port or wait until a magic state is available in that magic state storage qubit, increasing either the classical or quantum computation time.

[0044] Systems and methods disclosure herein may integrate quantum corrections needed for non-Clifford gates. In some cases, quantum corrections used for non-Clifford gates can be moved to the end of the quantum circuits and incorporated into the final qubit measurements. Without being limited by theory, moving quantum corrections used for non-Clifford gates to the end may requires updating subsequent quantum operations in the circuit, which involves a significant classical computation overhead. As a result, applying this technique in real time may not be feasible.

[0045] Recognized herein is the need for improved methods and systems that may overcome at least one of the above-identified drawbacks.Quantum Computing

[0046] Quantum computing may be a method of computing which utilizes the concept of quantum superposition and entanglement to manipulate information. By contrast, classical computers may use the binary bits 0 and 1. Quantum entanglement may be phenomenon in which, when multiple qubits interact with each other, their quantum states are entangled and may no longer be represented individually. Quantum superposition may be the principle which states that the quantum state of a qubit can be represented by adding together two or more different quantum states, each associated with a probability. In some cases, the probabilities of all states add to 1. Quantum circuits, comprising one or more quantum gates, may be designed to perform quantum computation, such as factoring large prime numbers, which may be infeasible or highly inefficient for classical computers. Quantum gates may comprise logical operators comprising one or multiple qubits, whichcan be used to perform logical operations.

[0047] In contrast to quantum computing, classical computation may be computation performed using binary values using discrete bits without use of quantum mechanical superposition and quantum mechanical entanglement. A classical computer may be a digital computer, such as a computer employing discrete bits (e.g., Os and Is) without use of quantum mechanical superposition and quantum mechanical entanglement. A non- classical computer may comprise any method or system for performing computational procedures outside of the paradigm of classical computing.

[0048] A quantum device may be any device or system for performing computations using any quantum mechanical phenomenon such as quantum mechanical superposition and quantum mechanical entanglement. Quantum computations, quantum procedures, quantum operations, and quantum computers described herein may comprise any method or system for performing computations using quantum mechanical operations (such as unitary transformations or completely positive trace-preserving (CPTP) maps on quantum channels) on a Hilbert space represented by a quantum device. A quantum chip may be a physical device that can utilize quantum phenomena that allows the execution of quantum gates for the purpose of computing.

[0049] A qubit, short for quantum bit, may be the basic unit of quantum information. A qubit may comprise quantum states comprising a complex unit vector of dimension 2. These two dimensions may be referred to as 0 and 1. A physical qubit may be a physical implementation of a qubit. For example, a superconducting qubit may be a physical qubit implemented using superconducting electronic circuits. When quantum error correction is used, a logical qubit may be a set of physical qubits that encodes one fault-tolerant qubit. A data qubit may be one of the qubits used to encode quantum information for a quantum computation. It may contain a part of an input or a part of an output state. If quantum error correction is used, it may be a logical qubit, and if not, it may be a physical qubit. An ancillary qubit may comprise one of the additional qubits used to perform a quantum operation more efficiently or to perform intermediate computations. If quantum error correction is used, it may comprise a logical qubit, and if not, it may comprise a physical qubit.

[0050] A circuit may comprise the representation of a computational model in which the computation comprises a sequence of gates. In some cases, a circuit may be used in gate model quantum computation. In some cases, a circuit may be a quantum circuit, such as a sequence of qubit gates used in a gate model quantum computation. A quantum circuit may comprise an initial state preparation for a set of qudits, followed by performing a gate operation and measurements on it. A quantum circuit may comprise a sequence of quantum gates implementing some quantum computation on a set of qubits. A sequence may comprise some small gate set but can contain more complicated operations.

[0051] A quantum gate operation may comprise a quantum gate, a sequence of quantum gates or a combination of quantum gates and quantum measurements that perform an isometry on the quantum state of qubits. For example, a quantum gate may be implemented between data qubits through a quantum operation involving data qubits, ancillary qubits, magic state storage qubits, and bus qubits that connect these qubits. Gates, two-qubit gates, and one-qubit gates may comprise quantum logic gates which are used to perform logical operations. A two-qubit gate may comprise two qubits. A one- qubit gate may comprise one qubit.

[0052] A quantum chip may comprise a physical device that can utilize quantum phenomena that allows the execution of quantum gates for the purpose of computing. A quantum chip may comprise a quantum mechanical system on which well-defined quantum operations are performed to perform some quantum computation. For example, ion-trap systems and super-conducting devices are current leaders in the field, but other implementations do exist and can be constructed.

[0053] A quantum measurement may comprise a process for extracting classical information from quantum states generated on quantum devices. Quantum computing devices may use quantum gates. A quantum gate may be a manipulation of qubits that can be represented by unitary operation on the quantum state of the qubits. A quantum gate operation may comprise a quantum gate, a sequence of quantum gates or a combination of quantum gates and quantum measurements that perform an isometry on the quantum state of qubits. For example, gates, two-qubit gates, and one-qubit gates may be used to perform logical operations. A one-qubit gate may comprise one qubit. A two- qubit gate may comprise two qubits.Error Correction

[0054] Quantum correction or quantum error correction may comprise additional quantum operations that may be performed in order to reduce error rates in quantum computing systems. For example, an error correction may be performed after a measurement, when the measurement indicates that the resulting quantum state differs from what is needed to correctly continue the computation.

[0055] A quantum code may comprise a mathematical framework for encoding quantum data into a larger Hilbert space to protect against errors. Protecting against errors may comprise using multiple physical qubits to encode a single logical qubit. Error corrected quantum codes may be thus more costly than straightforward computation. In some cases, only a subset of all quantum gates can be performed on these quantum codes, and thus there is a need to determine how to run an arbitrary computation while remaining within the encoded subspace. In some cases, this may be done by augmenting the set of quantum gates that can be implemented using magic states, which are qubit states that may allow for additional fault-tolerant quantum operations.

[0056] A topological quantum code may comprise a type of quantum code in which the data is protected topologically. Many state-of-the-art codes, such as the surface code and the colour code, are of this type. Generally, these codes have quantum error correction schemes.

[0057] Examples of quantum error correction schemes for FTQC comprise surface codes, rotated surface codes, and colour codes (Fowler et al., “Surface codes: Towards practical large-scale quantum computing,” Physical Review A 86, 032324, 2012; and Bombin, “Topological codes,” in Lidar and Brun (Eds.), Quantum Error Correction, pp. 455-481, Cambridge University Press, 2013; each of which is incorporated herein by reference in its entirety). These schemes may use a two-dimensional grid of encoded logical qubit patches that make up a quantum chip’ s layout. The logical operations of a quantum circuit may be performed by connecting the qubits requested by each quantum operation. The connection of multiple qubits that are far apart may be done using an ancillary region.

[0058] The qubits comprising the ancillary region may comprise bus qubits. A quantum bus may comprise bus qubits. A quantum bus may comprise a collection of bus qubits. An ancilla patch may be generated to facilitate the movement and connection of data qubits, ancillary qubits, magic state storage qubits, and distilling ports, either inside or outside magic state factories. A quantum bus may comprise at least one sub-bus composed of a subset of at least one bus qubit that is disconnected from at least one other bus qubit.

[0059] An ancilla patch may comprise a tree-like structure that is used to connect multiple qubits in the quantum chip to perform a quantum operation. An ancilla patch may comprise using a plurality of bus qubits from a quantum bus when the multiple qubits to be connected are far apart. An ancilla patch may be generated without using bus qubits to connect qubits coupled to each other. An ancilla patch may be used in various quantum operations.

[0060] Some operations implementing Clifford gates in the quantum circuit may comprise connecting data qubits only or connecting data qubits to ancillary qubits. In some cases, operations implementing non-Clifford gates may also comprise the connection of data qubits to a qubit in a magic state. A Clifford gate may comprise one of a group of quantum gates mathematically defined as being generated by the Hadamard gate; phase gate S also referred to as an S-gate, (e.g., a Z-rotation); and a CNOT (controlled not) operation between qubits. Some operations implementing Clifford gates may comprise the connection of at least two data qubits or at least one data qubit to an ancillary qubit using an ancilla patch. A non-Clifford gates may comprise one of a group of quantum gates other than those contained in the Clifford group. Examples of non- Clifford gates comprise a Toffoli gate (controlled, controlled not); phase gate T, also referred to as T-gate and a TT / 8 Z-rotation gate; and arbitrary Z-rotations. In some cases, non-Clifford gates may be implemented through a quantum operation using one or more magic states and may comprise operations implementing Clifford gates for quantum correction. A magic state may comprise a qubit state that allows for fault-tolerant quantum operations containing non-Clifford gates. A non-Clifford gate may involve the connection of at least one data qubit to one qubit in the magic state, either a distilling port or a magic state storage qubit, using an ancilla patch.

[0061] FTQC may comprise the distillation of higher fidelity magic states prior to their use to lower the probability of producing errors. Higher fidelity magic states may be distilled from lower fidelity ones using a magic state distillation protocol. A magic state protocol may specify at least some or all of: the number of lower fidelity magic states needed to distill higher fidelity ones, the number of higher fidelity magic states distilled, and the set of quantum operations required for the distillation, which may determine the duration of the distillation process. A magic state distillation may comprise the process of turning multiple magic states with some given error probability into fewer magic states with a smaller error probability. There are several such magic state distillation protocols, such as the 15: 1 (fifteen-to-one) protocol that takes as input 15 T-state magic states and outputs one T-state magic state, the 8: 1 Toffoli protocol that takes as input 8 T-state magic states and outputs one Toffoli-state magic state, and the 3k+8:k protocol that takes as input 3k+8 T-state magic states and outputs k T-state magic states. As evident from these examples, it is possible to output multiple magic states during this process, as well as change the type of magic state during this process. The magic state distillation process may fail resulting in fewer magic states distilled than expected.

[0062] The magic state distillation protocol may be time consuming. To reduce the time, magic state distillation may be executed in a magic state factory where qubits are arranged in a way to efficiently carry out the protocol. A magic state factory may comprise a dedicated block of tiles on a quantum chip where a protocol for the magic state distillation is used to distill higher fidelity magic states. It may comprise a group of qubits and a quantum bus used for the distillation of magic states, and a group of distilling ports where the distilled magic states are sent after distillation and can be accessed by the qubits outside the magic state factory using an external quantum bus.

[0063] In some cases, the higher fidelity magic states may be distilled by the factories at distilling port qubits situated at the boundary between the magic state factory and the rest of the chip. The distilling port may comprise a qubit in a quantum chip located in a magic state factory that acts as an interface between the magic state factory and the rest of the chip. The distilling port may hold a magic state distilled in its magic state factory and allows the magic state to be transferred or used elsewhere in the quantum chip.

[0064] In some cases, magic states can remain at the distilling ports until they are used by operations implementing non-Clifford gates or be transferred to magic state storage qubits whenever it is convenient. A magic state storage qubit may comprise a qubit in a quantum chip used to store a magic state. A magic state may be transferred to a magic state storage qubit from a distilling port or another magic state storage qubit. Magic state storage qubits may be connected to other qubits to consume their magic state to perform a non-Clifford gate. Magic state storage qubits may be connected to an ancillary qubit using an ancilla patch in order to be restored after their use to be able to store another magic state again.

[0065] The quantum chip layout problem and the quantum circuit operations scheduling problem may each comprise an optimization problem. An optimization problem may comprise any problem involving minimizing or maximizing an objective function defined on a given domain. An optimization procedure may comprise a protocol, an algorithm, or a method for solving an optimization problem exactly or heuristically. An optimization problem may minimize or maximize an objective function to an absolute maximum or minimum. An optimization problem may minimize or maximize an objective function to a relative maximum or minimum. An optimization problem may reduce or increase an objective function to an amount which approaches an absolute maximum or minimum. In some cases, an optimization problem may approximate an absolute maximum or minimum. In some cases, minimizing and maximizing herein may involve the mathematical operation of maximizing or minimizing. In some cases, the mathematical operation of maximizing or minimizing may result in an exact maximum or minimum being reached. In some cases, the mathematical operation of maximizing or minimizing may result in an approximate maximum or minimum being reached.

[0066] Classical computation time may comprise the time spent using a classical device to execute computational procedure, such as an optimization procedure to solve an optimization problem. Quantum computation time may comprise the time necessary to run a quantum algorithm using a quantum device. For example, the time to follow the solution found for the optimization problem of scheduling quantum operations from a quantum circuit representing the quantum algorithm.

[0067] Solving the quantum chip layout problem is a challenging task since it may comprise specifying the arrangement of qubits in the chip considering the elementary quantum operations for the scheduling of quantum circuit operations. In some cases, a modular approach for the arrangement of qubits for large-scale quantum computing on a surface code may be implemented. Modules may be composed of data blocks, containing the data qubits and a quantum bus, and distillation blocks, containing the magic state factories, which together represent a full quantum chip. Data blocks may be arranged in a way that allows data qubits and the distilling ports to be connected using the quantum bus. The compact layout proposed may increase the density of data qubits in the quantum chip but may require extra operations to rotate these qubits to allow all quantum operators that require these qubits to be performed. Other layouts proposed may avoid these extra operations by reducing the density of data qubits. An alternative arrangement for the data blocks may comprise individual data qubits which are surrounded by a quantum bus, resulting in a layout with a lower density of data qubits but with more space on the quantum bus to parallelize the quantum operations to be scheduled (Horsman et al., “Surface code quantum computing by lattice surgery,” New Journal of Physics 14, 123014, 2012, which is incorporated by reference herein in its entirety).

[0068] To solve the quantum circuit operations scheduling problem, a compiler may be used to generate instructions that minimize the quantum computation time. This time can be measured by the number of time steps needed to execute all quantum operations scheduled to meet the constraints imposed by the quantum chip’s layout. Since quantum operations involve measuring qubits that are often far apart, distant qubits may be caused to interact through ancilla patches. Quantum operations that are parallelizable following the quantum circuit’s logical constraints can be scheduled to be executed at the same time step if it is possible to generate ancilla patches for them that do not violate the quantum hardware’s physical constraints, such as not sharing any bus qubit at the same time. Generating many ancilla patches to connect multiple qubits in the same time step may involve solving an NP-hard optimization problem, also known as the vertex-disjoint tree packing problem, which can be impractical for large-scale quantum computing (Herr et al., “Optimization of lattice surgery is NP-hard,” npj Quantum Information 3, no. 35, 2017, which is incorporated by reference herein in its entirety).

[0069] In some cases, to address this optimization problem, heuristic algorithms may be used to reduce the classical computation time that it takes to generate a schedule for the quantum circuit. For example, quantum operations may be scheduled in serial, which avoids the explicit generation of the ancilla patches to assess parallelization feasibility. In some cases, a particular data block layout may be also proposed to allow for two quantum operations to be scheduled in parallel by generating ancilla patches that are guaranteed not to violate the physical constraints. In some cases, ancilla patches may be generated to connect multiple parallelizable quantum operations.Quantum Device / Quantum Hardware

[0070] Any type of quantum hardware may be suitable for the technologies disclosed herein. A quantum processor or quantum computer may comprise one or more quantum gate arrays, one-way quantum computers, topological quantum computers, superconductor-based quantum computers, trapped ion quantum computers, trapped atom quantum computers, optical lattices, quantum dot computers, spin-based quantum computers, spatial-based quantum computers, Loss-DiVincenzo quantum computers, nuclear magnetic resonance (NMR) based quantum computers, solution- state NMR quantum computers, solid-state NMR quantum computers, solid-state NMR Kane quantum computers, electrons-on-helium quantum computers, cavity-quantum- electrodynamics based quantum computers, molecular magnet quantum computers, fullerene-based quantum computers, linear optical quantum computers, diamond-based quantum computers, nitrogen-vacancy (NV) diamond-based quantum computers, Bose- Einstein condensate-based quantum computers, transistor-based quantum computers, and rare-earth-metal-ion-doped inorganic crystal based quantum computers. The quantum processor or quantum computer may comprise one or more of: quantum annealers, Ising solvers, optical parametric oscillators (OPO), and gate model quantum computers.

[0071] A quantum processor or quantum computer may comprise one or more qubits. The one or more qubits may comprise superconducting qubits, trapped ion qubits, trapped atom qubits, photon qubits, quantum dot qubits, electron spin-based qubits, nuclear spinbased qubits, molecular magnet qubits, fullerene-based qubits, diamond-based qubits, nitrogen-vacancy (NV) diamond-based qubits, Bose-Einstein condensate-based qubits, transistor-based qubits, or rare-earth-metal-ion-doped inorganic crystal based qubits.

[0072] In some cases, a quantum device with a limitation of a two-dimensional structure of a quantum chip or a limitation on how many neighbouring qubits each qubit is connected to may benefit from methods and systems disclosed herein. In accordance with the description herein, suitable quantum computers may include, by way of non-limiting examples, including the associated references, each of which is incorporated by reference herein in its entirety: superconducting quantum computers (qubits implemented as small superconducting circuits — Josephson junctions) (Clarke et al., “Superconducting quantum bits”, Nature 453, no. 7198, pp. 1031-1042, 2008); trapped-ion quantum computers (qubits implemented as states of trapped ions) (Kielpinski et al., “Architecture for a large-scale ion-trap quantum computer”, Nature 417, no. 6890, pp. 709-711, 2002); optical lattice quantum computers (qubits implemented as states of neutral atoms trapped in an optical lattice) (Deutsch et al., “Quantum computing with neutral atoms in an optical lattice”, Fortschritte der Physik: Progress of Physics 48, no. 9-11, pp. 925-943, 2000); spin-based quantum dot computers (qubits implemented as the spin states of trapped electrons) (Imam oglu et al., “Quantum information processing using quantum dot spins and cavity QED”, Physical Review Letters 83, no. 20, p. 4204, 1999); spatial -based quantum dot computers (qubits implemented as electron positions in a double quantum dot) (Fedichkin et al., “Novel coherent quantum bit using spatial quantization levels in semiconductor quantum dot”, arXiv:quant-ph / 0006097, 2000); coupled quantum wires (qubits implemented as pairs of quantum wires coupled by quantum point contact) (Bertoni et al., “Quantum logic gates based on coherent electron transport in quantum wires”, Physical Review Letters 84, no. 25, p. 5912, 2000); nuclear magnetic resonance quantum computers (qubits implemented as nuclear spins and probed by radio waves) (Cory et al., “Nuclear magnetic resonance spectroscopy: An experimentally accessible paradigm for quantum computing”, arXiv: quant-ph / 9709001, 1997); solid-state NMR Kane quantum computers (qubits implemented as the nuclear spin states of phosphorus donors in silicon) (Kane, “A silicon-based nuclear spin quantum computer”, Nature 393, no. 6681, pp. 133-137, 1998); electrons-on-helium quantum computers (qubits implemented as electron spins) (Lyon, “Spin-based quantum computing using electrons on liquid helium”, arXiv:cond-mat / 0301581, 2006); cavity quantum electrodynamicsbased quantum computers (qubits implemented as states of trapped atoms coupled to high-finesse cavities) (Burell, “An Introduction to Quantum Computing using CavityQED concepts,” arXiv: 1210.6512, 2012); molecular magnet-based quantum computers (qubits implemented as spin states) (Leuenberger et al., “Quantum Computing in Molecular Magnets”, arXiv:cond-mat / 0011415, 2001); fullerene-based electron spin resonance (ESR) quantum computers (qubits implemented as electronic spins of atoms or molecules encased in fullerenes) (Harneit, “Quantum Computing with Endohedral Fullerenes”, arXiv: 1708.09298, 2017); linear optical quantum computers (qubits implemented as processing states of different modes of light through linear optical elements such as mirrors, beam splitters and phase shifters) (Knill et al. “Efficient linear optics quantum computation”, arXiv:quant-ph / 0006088, 2000); diamond-based quantum computers (qubits implemented as electronic or nuclear spins of nitrogen-vacancy (NV) centres in diamond) (Nizovtsev et al., “A quantum computer based on NV centers in diamond: optically detected nutations of single electron and nuclear spins”, Optics and spectroscopy 99, no. 2, pp. 233-244, 2005); Bose-Einstein condensate-based quantum computers (qubits implemented as two-component Bose-Einstein condensates) (Byrnes et al., “Macroscopic quantum computation using Bose-Einstein condensates”, arXiv :quantum-ph / l 103.5512, 2011); transistor-based quantum computers (qubits implemented as semiconductors coupled to nanophotonic cavities) (Sun et al., “A singlephoton switch and transistor enabled by a solid-state quantum memory”, arXiv:quant- ph / 1805.01964, 2018); rare-earth-metal-ion-doped inorganic crystal-based quantum computers (qubits implemented as atomic ground state hyperfine levels in rare-earth-ion- doped inorganic crystals) (Ohlsson et al. “Quantum computer hardware based on rare- earth-ion-doped inorganic crystals”, Optics Communications 201, no. 1-3, pp. 71-77, 2002); and metal-like carbon nanospheres based quantum computers (qubits implemented as electron spins in conducting carbon nanospheres) (Nafradi et al., “Room temperature manipulation of long lifetime spins in metallic-like carbon nanospheres”, arXiv:cond- mat / 1611.07690, 2016); topological quantum computers (qubits implemented as non- Abelian anyons) (Nayak et al., “Non -Abelian Anyons and Topological Quantum Computation,” arXiv:0707.1889, 2007); photonic continuous-variable quantum computing hardware (quantum variables represented by the quadrature operators of the quantum harmonic oscillators in a quantum optical mode) (Arrazola et al., “Quantum circuits with many photons on a programmable nanophotonic chip,” Nature 591, pp. 54- 60, 2021); photonic qubit-based quantum hardware (qubits implemented on pairs ofoptical paths) (O’Brien et al., “Photonic quantum technologies,” Nature Photonics 3, pp. 687-695, 2009); quantum computing hardware based on bosonic codes (error-protected qubits are formed by embedding a finite-dimensional code space within the infinitedimensional Fock space associated with a bosonic quantum field mode; examples include the Gottesman-Kitaev-Preskill (GKP) code, cat codes, and binomial codes, respectively) (Gottesman et al., “Encoding a qubit in an oscillator,” Physical Review A 64, 012310, 2001; Chamberland et al., “Building a Fault-Tolerant Quantum Computer Using Concatenated Cat Codes,” PRX Quantum 3, 010329, 2022; Michael et al., “New Class of Quantum Error-Correcting Codes for a Bosonic Mode,” Physical Review X 6, 031006, 2016); quantum hardware based on coherent network computing (operating by sampling low-energy eigenstates of an Ising Hamiltonian by encoding the spins in a network of optical parametric oscillators with all-to-all connectivity; future architectures may exploit quantum entanglement for computation) (Inui et al., “Entanglement and quantum discord in optically coupled coherent Ising machines,” Physical Review A 102, 062419, 2020; and Yanagimoto et al., “Embedding entanglement generation within a measurement-feedback coherent Ising machine,” arXiv: 1906.04902, 2019), each of which is incorporated herein by reference for all purposes.High-Performance Computing Device

[0073] A computing device which may interact with a quantum computing device disclosed herein and enhance a special-purpose computing platform disclosed herein may be a high-performance computing (HPC) device. An HPC device may comprise one or more of a graphics processing unit (GPU), a tensor processing unit (TPU), a field- programmable gate array (FPGA), an application-specific integrated circuit (ASIC), and a tensor streaming processor (TSP). Any other suitable processing unit that is capable of performing matrix multiplication may be used. Certain computing devices may be more efficient at operations such as matrix multiplication. These computing devices may provide additional efficiency gains over other computing systems. For example, a matrix multiplication device may be a GPU. A GPU may be a specialized electronic circuit optimized for high throughput, which can perform the same set of operations in parallel on many data blocks at a time. For example, a matrix multiplication device may be a TPU. A TPU may be a type of ASIC developed for low bit precision processing byGoogle Inc. For example, a matrix multiplication device may be an FPGA. An FPGA may be an integrated circuit chip that comprises configurable logic blocks and programmable interconnects. It can be programmed after manufacturing to execute custom algorithms. For example, a matrix multiplication device may be an ASIC. An ASIC may be an integrated circuit chip that is customized to run a specific algorithm. In some case, an ASIC cannot be programmed after manufacturing. For example, a matrix multiplication device may be a TSP. A TSP may be a domain-specific programmable integrated chip that is designed for linear algebra computations as they may be performed in artificial intelligence applications, an example of which may be found in Gwennap, “Groq Rocks Neural Networks,” Microprocessor Report, Tech. Rep., Jan., 2020, which is incorporated by reference herein in its entirety.Digital Computer

[0074] In some cases, a digital computer comprises one or more hardware central processing units (CPUs) that carry out a classical computer’s functions. In some cases, the classical computer further comprises an operating system (OS) configured to perform executable instructions. In some cases, the classical computer is connected to a computer network.

[0075] In some cases, the classical computer is connected to a computer network. In some cases, the classical computer is connected to the Internet such that it accesses the World Wide Web. In some cases, the classical computer is connected to one or more computer servers, which can enable distributed computing, such as a cloud computing infrastructure. In some cases, the classical computer is connected to an intranet and / or extranet or an intranet and / or extranet that is in communication with the Internet. In some cases, the classical computer is connected to a data storage device. In some cases, the network is a telecommunication and / or data network. In some cases, the network is a peer-to-peer network, which may enable devices coupled to the computer system to behave as a client or a server.

[0076] In accordance with the description herein, suitable classical computers may include, by way of non-limiting examples, server computers, desktop computers, laptop computers, notebook computers, sub-notebook computers, netbook computers, netpadcomputers, set-top computers, media streaming devices, handheld computers, Internet appliances, mobile smartphones, tablet computers, personal digital assistants, video game consoles, and vehicles. Smartphones may be suitable for use with methods and systems described herein. Select televisions, video players, and digital music players, in some cases, with computer network connectivity, may be suitable for use in the systems and methods described herein. Suitable tablet computers may include those with booklet, slate, and convertible configurations.

[0077] In some cases, the classical computer includes an operating system configured to perform executable instructions. The operating system may be, for example, software, including programs and data, which manages the device’s hardware and provides services for execution of applications. Suitable server operating systems include, by way of nonlimiting examples, FreeBSD, OpenBSD, NetBSD®, Linux®, Apple® Mac OS X Server®, Oracle® Solaris®, Windows Server®, and Novell® NetWare®. Suitable personal computer operating systems may include, by way of non-limiting examples, Microsoft® Windows®, Apple® Mac OS X®, Apple® macOS®, UNIX®, and UNIX- like operating systems such as GNU / Linux®. In some cases, the operating system is provided by cloud computing. Suitable mobile smart phone operating systems may include, by way of non-limiting examples, Nokia® Symbian® OS, Apple® iOS®, Research In Motion® BlackBerry OS®, Google® Android®, Microsoft® Windows Phone® OS, Microsoft® Windows Mobile® OS, Linux®, and Palm® WebOS®. Suitable media streaming device operating systems may include, by way of non-limiting examples, Apple TV®, Roku®, Boxee®, Google TV®, Google Chromecast®, Amazon Fire®, and Samsung® HomeSync®. Suitable video game console operating systems may include, by way of non-limiting examples, Sony® PS3®, Sony® PS4®, Microsoft® Xbox 360®, Microsoft® Xbox One®, Nintendo® Wii®, Nintendo® Wii U®, and Ouya®.

[0078] In some cases, the classical computer includes a storage and / or memory device. In some cases, the storage and / or memory device is one or more physical apparatuses used to store data or programs on a temporary or permanent basis. In some cases, the storage and / or memory device may have one or more additional data storage units that are external to the classical computer, for example, being located on a remote server thatis in communication with the classical computer through an intranet or the Internet. In some cases, the device comprises a volatile memory and requires power to maintain stored information. In some cases, the device comprises non-volatile memory and retains stored information when the classical computer is not powered. In some cases, the non-volatile memory comprises flash memory. In some cases, the non-volatile memory comprises dynamic random-access memory (DRAM). In some cases, the non-volatile memory comprises ferroelectric random-access memory (FRAM). In some cases, the non-volatile memory comprises phase-change random-access memory (PRAM). In some cases, the non-volatile memory comprises resistive random-access memory (RRAM). In some cases, the device comprises a storage device including, by way of non-limiting examples, CD-ROMs, DVDs, flash memory devices, magnetic disk drives, magnetic tapes drives, optical disk drives, and cloud computing based storage. In some cases, the storage and / or memory device comprises a combination of devices such as those disclosed herein.

[0079] In some cases, the classical computer includes a display to send visual information to a user. In some cases, the display is a cathode ray tube (CRT). In some cases, the display is a liquid crystal display (LCD). In some cases, the display is a thin film transistor liquid crystal display (TFT-LCD). In some cases, the display is an organic light emitting diode (OLED) display. In some cases, on OLED display is a passive-matrix OLED (PMOLED) or active-matrix OLED (AMOLED) display. In some cases, the display is a plasma display. In some cases, the display is a video projector. In some cases, the display is a combination of devices such as those disclosed herein.

[0080] In some cases, the classical computer includes an input device to receive information from a user. In some cases, the input device is a keyboard. In some cases, the input device is a pointing device including, by way of non-limiting examples, a mouse, trackball, track pad, joystick, game controller, or stylus. In some cases, the input device is a touch screen or a multi-touch screen. In some cases, the input device is a microphone to capture voice or other sound input. In some cases, the input device is a video camera or other sensor to capture motion or visual input. In some cases, the input device is a Kinect®, Leap Motion®, or the like. In some cases, the input device is a combination of devices such as those disclosed herein.

[0081] In the following detailed description, reference is made to the accompanying figures, which form a part hereof. In the figures, similar symbols typically identify similar components, unless context dictates otherwise. The illustrative embodiments described in the detailed description, figures, and claims are not meant to be limiting. Other embodiments may be used, and other changes may be made, without departing from the scope of the subject matter presented herein. It will be readily understood that the aspects of the present disclosure, as generally described herein, and illustrated in the figures, can be arranged, substituted, combined, separated, and designed in a wide variety of different configurations, all of which are explicitly contemplated herein.

[0082] Now referring to FIG. 1 A, there is shown a diagram of an example quantum chip layout comprising at least one magic state factory, surrounded by a plurality of data qubits and a quantum bus. In some cases, the quantum chip may comprise two or more magic state factory qubits surrounded by one or more distilling ports and two or more qubits of any qubit type, for example, bus qubits, data qubits, magic state storage qubits, and ancillary qubits; the layout further comprising two or more bus qubits surrounding the two or more qubits of any qubit type, for example, bus qubits, data qubits, magic state storage qubits, ancillary qubits, etc.

[0083] The quantum chip disclosed with respect to FIG. 1A may comprise at least one magic state factory 110, 112, 114, 116 that may comprise two or more qubits allowing the implementation of one or more non-Clifford gates using a predefined magic state distillation protocol. The one or more non-Clifford gates may comprise, for example, a Toffoli gate, a TT / 8 Z-rotation gate (a T-gate), and a quantum rotational gate. For example, the magic state factory 110 may implement a 20:4 protocol that takes as input 20 T-state magic states and performs T-gates using the plurality of qubits that comprises the magic state factory 110 to output four T-state magic states in the distilling ports DI, D2, D3, D4. This protocol may be performed in parallel with the actual quantum computation and may be self-contained to prevent conflicting uses of resources with the compilation of the quantum circuit, as well as to allow for the distillation protocol and layout to be optimized independently of the implementation of the quantum circuit.

[0084] Still referring to FIG. 1 A, the at least one magic state factory 110, 112, 114, 116 may comprise magic state factory data qubits Fql, Fq2, ..., Fql2, magic state factory ancillary qubits Fal, Fa2, ..., Fa4, magic state factory storage qubits Fsl, Fs2, ..., Fs4, one or more distilling ports DI, D2, . . ., D16, and an internal quantum bus comprising a plurality of magic state factory bus qubits that connects the internal qubits. For example, the magic state factory 114 may comprise the quantum bus 130 that connects the magic state factory data qubits Fq4, Fq5, Fq6, the magic state factory ancillary qubit Fa3, the magic state factory storage qubit Fs2, and the distilling ports D9, DIO, Dl l, D12. The distilling ports DI, D2, . . ., D16 of at the least one magic state factory 110, 112, 114, 116 are located apart from each other in FIG. 1 A to allow different access points for the magic states distilled by the factories, increasing the potential of generating ancilla patches to connect the qubits required by quantum operations scheduled in parallel without violating the quantum hardware’s physical constraints.

[0085] The quantum chip disclosed with respect to FIG. 1 A may comprise a plurality of data qubits ql, q2, . . ., ql28, and a quantum bus 140 comprising a plurality of bus qubits. The quantum bus 140 may comprise bus qubits adjacent and operatively coupled to each of the one or more distilling ports DI, D2, . . ., D16 of the at least one magic state factory 110, 112, 114, 116 and to each of the plurality of data qubits ql, q2, ..., ql28. The quantum bus 140 may be used to connect the at least one magic state factory 110, 112, 114, 116 with at least one of the plurality of data qubits ql, q2, . . . , ql28 using the one or more distilling ports DI, D2, ..., D16. The quantum bus 140 may be non-contractible and / or may comprise at least one non-contractible sub-bus. The quantum bus 140 may allow multiple ways of connecting a set of qubits in the quantum chip, increasing the potential of generating ancilla patches to connect the qubits required by quantum operations scheduled in parallel without violating the quantum hardware’s physical constraints.

[0086] Still referring to FIG. 1A, the quantum chip may comprise magic state storage qubits si, s2, ..., sl6. One of the magic state storage qubits si, s2, ..., sl6 may be connected to one of the distilling ports DI, D2, . . ., D16 after a magic state is distilled in the distilling port to store a magic state. If a magic state is stored in one of the magic state storage qubits si, s2, ..., s!6, the magic state storage qubit may be connected to at leastone of the plurality of data qubits ql, q2, ql28 using an ancilla patch to perform a quantum operation. The magic state storage qubits si, s2, si 6 may be coupled to at least one of the distilling ports DI, D2, ..., D16 to allow an easy transfer of the magic state distilled in the distilling port to the magic state storage qubit without generating an ancilla patch that uses bus qubits in the quantum bus, thus avoiding blocking other quantum operations that may be scheduled in parallel.

[0087] Still referring to FIG. 1A, the quantum chip may comprise ancillary qubits anl, an2, . . ., anl6. The ancillary qubits anl, an2, . . ., anl6 may be used to perform additional quantum operations more efficiently or to perform intermediate computations. For example, a TT / 4 rotation on a quantum circuit may require connecting at least one of the plurality of data qubits ql, q2, ..., ql28 or one of the magic state storage qubits si, s2, . . . , sl6 to one of the ancillary qubits anl, an2, . . . , anl6. Since ancillary qubits are usually rotated in the Y basis, the ancillary qubits anl, an2, . . ., anl6 are represented by two-tile qubits to allow the Y basis rotations to be performed in a single time step when using the surface code quantum error correction scheme. At least one data qubit may also be represented by a two-tile qubit for the same benefit. Alternatively, single-tile qubits may be connected to two or more adjacent bus qubits for the same benefit, such as data qubits ql, q2, q7, etc. The ancillary qubits anl, an2, . . ., anl6 may be placed far apart from each other to increase the potential of being able to schedule quantum operations in parallel. The ancillary qubits anl, an2, . . . , an 16 may be placed near the magic state storage qubits si, s2, ..., sl6 for the same reason since the magic state storage qubits may frequently require being connected to the ancillary qubits.

[0088] Still referring to FIG. 1 A, each qubit may be represented by at least one tile in the quantum chip. For example, the qubit ql is a single-tile qubit, while the qubit anl may be a two-tile qubit. A straight line represented as an edge on the border of a qubit may represent an X basis connection, which may allow rotating the qubit in the X basis, while a dashed line represented as an edge on the border of a qubit may represent a Z basis connection, which may allow rotating the qubit in the Z basis. An X basis, Y basis, and Z basis may comprise the standard decompositions for a single qubit into orthogonal reference states. Each of these three bases are decompositions into different pairs of states, and each basis may be useful for describing a rotation in that basis, where the tworeference states receive different phases.

[0089] When using the surface code quantum error correction scheme, a quantum operation that requires a qubit rotation in the Y basis may be performed by generating an ancilla patch that may connect both the X and Z bases of the qubit. Therefore, it may be advantageous to couple at least some qubits to at least two bus qubits to allow rotations in all bases to be performed in a single time step. For example, the qubits coupled to two bus qubits, such as ql disclosed with respect to FIG. 1 A, may allow rotations in all bases to be performed in a single time step. Meanwhile, the qubits coupled to a single bus qubit, such as q3 disclosed with respect to FIG. 1 A, may allow rotations either in the X or in the Z basis to be performed in a single time step. Since the qubit q3 has only a Z basis connection with the quantum bus in the state of the quantum system disclosed with respect to FIG. 1 A, the tile representing the qubit q3 may be rotated by 90 degrees to change to an X basis connection with the quantum bus.

[0090] Now referring to FIG. IB, there is shown a diagram of an example quantum chip layout. The layout may comprise a first qubit block comprising one or more data qubits surrounded by one or more bus qubits (i.e., a data block); a second block of qubits adjacent to the first block, the second block comprising one or more magic state storage qubits and one or more bus qubits (i.e., a magic state storage block); and a third block of qubits adjacent to the second block, the third block comprising at least one magic state factory comprising one or more distilling ports and a plurality of magic state factory qubits (i.e., a magic state factory block).

[0091] The magic state factory block 30 in the quantum chip disclosed with respect to FIG. IB may comprise at least one magic state factory such as 118 and 120 that may comprise two or more qubits allowing the implementation of one or more non-Clifford gates using a predefined magic state distillation protocol. The one or more non-Clifford gates may comprise, for example, a Toffoli gate, a T-gate, a quantum rotational gate, etc. For example, the magic state factory 118 may implement a 15: 1 protocol that takes as input 15 T-state magic states and performs T-gates using the plurality of qubits that comprises the magic state factory 118 to output one T-state magic state in the distilling port DI 7. This protocol may be conducted in parallel with the actual quantum computation and may be self-contained to prevent conflicting uses of resources with thecompilation of the quantum circuit, as well as to allow for the distillation protocol and layout to be optimized independently of the implementation of the quantum circuit.

[0092] The magic state factory block 30 in the quantum chip disclosed with respect to FIG. IB may comprise magic state factories arranged in multiple distillation levels, where magic state factories at lower levels, such as magic state factory 120, may supply magic states to magic state factories at upper levels, such as magic state factory 118. Qubits at different levels in the magic state factories and the other blocks may be of different sizes. Operations to resize qubits may be performed in areas such as 190 and 192 to allow qubits to be of the required size before interacting with qubits in another space in the device connected to these resizing spaces. For example, a magic state distilled in the magic state factory 120 may be sent to one of the magic state storage qubits s24, s25, . . ., s35 in the resizing space 190. Once the magic state storage qubit containing the magic state is resized, the magic state may be used by a magic state factory at the upper level, such as magic state factory 118, to distill a newer magic state. Once a newer magic state is distilled in one of the distillation ports D17, D18, D19, D20, the newer magic state may be sent to a magic state storage qubit s21, s22, s23 in the resizing area 192 to be resized before being sent to the magic state storage block 20.

[0093] The at least one magic state factory such as magic state factory 118 in the quantum chip disclosed with respect to FIG. IB may comprise magic state factory data qubits such as Fql3, Fql4, ..., Fq28, magic state factory ancillary qubits such as Fa5, Fa6, ..., Fa8, one or more distilling ports such as DI 7, DI 8, DI 9, D20, and an internal quantum bus 150 comprising a plurality of magic state factory bus qubits that connect the internal qubits. For example, the magic state factory 118 comprises the quantum bus 150 that connects the magic state factory data qubits Fql3, Fql4, Fql5, Fql6, the magic state factory ancillary qubit Fa5, the magic state factory storage qubits Fs5, Fs6, and the distilling port DI 7.

[0094] Still referring to FIG. IB, the magic state storage block 20 may comprise magic state storage qubits sl7, sl8, sl9, s20 and ancillary qubits anl9, an20. The magic state storage block 20 may comprise at least one magic state storage sub-block comprising at least one of the magic state storage qubits. Each of the magic state storage sub-blocks may comprise at least one of the ancillary qubits. Each sub-block may be connected tothe data block and to the magic state factory block through at least one bus qubit from the quantum bus. Two magic state storage sub-blocks are disclosed with respect to FIG. IB. For example, the magic state storage sub-block 170 may comprise magic state storage qubits sl7, si 8 and ancillary qubit anl9. The magic state storage sub-block 170 may be connected to the data block 10 through the bus qubit 180 and to the magic state factory block 30 through the row of bus qubits between them.

[0095] Using a single bus qubit 180 to connect the data block 10 to the magic state storage sub-block 170 may allow the ancilla patch — which is used to connect the at least one of the plurality of data qubits ql29, ql30, . . ., ql44 to one of the magic state storage qubits sl7, s 18 within the magic state storage sub-block 170 — to be generated in two steps.

[0096] Still referring to FIG. IB, each qubit may be represented by at least one tile in the quantum chip. For example, the qubit ql29 is a single-tile qubit, while the ancillary qubit anl7 is a two-tile qubit. A straight line represented as an edge on the border of a qubit may represent an X basis connection, which may allow rotating the qubit in the X basis, while a dashed line represented as an edge on the border of a qubit may represent a Z basis connection, which may allow rotating the qubit in the Z basis. When using the surface code quantum error correction scheme, a quantum operation that requires a qubit rotation in the Y basis may be performed by generating an ancilla patch that may connect both the X and Z bases of the qubit. Therefore, it may be advantageous to couple at least some qubits to at least two bus qubits to allow rotations in all bases to be performed in a single time step. All data qubits ql29, ql30, ..., ql44 and ancillary qubits anl7, anl8 in the data block 10 disclosed with respect to FIG. IB may be coupled to two bus qubits, allowing rotations in all bases to be performed in a single time step.

[0097] Now referring to FIG. 2, there is shown a diagram of the example chip layout disclosed with respect to FIG. IB with many ancilla patches that may be used to connect multiple qubits to perform quantum operations in parallel. All qubits, blocks, areas, and other elements disclosed with respect to FIG. IB are to be understood to both exist in FIG. 2 and have the same labels elsewhere herein. During the compilation of a quantum circuit, the lighter segments of ancilla patches pl, p2, p3, p4 may be determined. However, the darker segments of ancilla patches p3, p4, ..., pl l may be precomputed during compilation time, but the specific patch to be used may be uncertain due to theunpredictability of which magic state storage qubits will hold a magic state during a quantum computation.

[0098] For example, the ancilla patch p3 disclosed with respect to FIG. 2 connecting the data qubit q 142 to the magic state storage qubit si 8 within the magic state storage subblock 170 may be divided into two ancilla patches. The lighter segment in the ancilla patch p3 may connect the data qubit ql42 to the single bus qubit 180 that may connect the data block 10 to the magic state storage sub-block 170. The lighter segment may be determined during the compilation of the quantum circuit. The darker segment in the ancilla patch p3 may connect the single bus qubit 180 to the magic state storage qubit si 8, located within the magic state storage sub-block 170. It may not be possible to determine the darker segment during the compilation of the quantum circuit due to the uncertainty about which of the magic state storage qubits si 7, si 8 will have a magic state stored during a quantum computation. Connecting a magic state storage sub-block to the data block using a single bus qubit may allow the precomputing of all possible ancilla patches to connect the single bus qubit to any of the magic state storage qubits within the subblock; therefore, the retrieval of the required ancilla patch from a classical computer during the quantum computation can be done quickly.

[0099] Referring back to the magic state storage block 20 disclosed with respect to FIG. IB, the qubits in a magic state storage sub-block may be arranged to allow the parallelization of common quantum operations that requires connecting the qubits. For example, considering the magic state storage sub-block 170, a resized magic state in the magic state storage qubit s22 may be sent to a magic state storage qubit sl7 of the magic state storage sub-block 170 using the ancilla patch p7 disclosed with respect to FIG. 2. At the same time step, the ancilla patch p3 disclosed with respect to FIG. 2 may be generated to connect the magic state storage qubit si 8 of the magic state storage sub-block 170 to the data qubit ql42 without violating the quantum hardware’s physical constraints. A third ancilla patch p5 disclosed with respect to FIG. 2 can also be generated at the same time step to connect the magic state storage qubit si 8 to the ancillary qubit an 19 to perform a quantum correction, if necessary, still without violating the quantum hardware’s physical constraints.

[0100] The data block 10 in the quantum chip may comprise a plurality of data qubits ql29, ql30, . . ql44. The data qubits may be coupled to at least two bus qubits from the quantum bus 160. This may allow data qubit rotations in all bases to be performed in a single time step. For example, as disclosed with respect to FIG. 2, the ancilla patch p2 may connect the data qubit ql34 through its X and Z basis connections to the quantum bus, meaning that the ancilla patch p2 may be used for a quantum operation that may require rotating the data qubit ql34 in the Y basis. In the quantum chip disclosed with respect to FIG. IB, all data qubits ql29, ql30, ..., ql44 are set to have this same advantage.

[0101] Different magic state storage sub-blocks may be used to schedule non-Clifford gates in parallel. For example, referring to FIG. 2, the ancilla patches p3 and p4 may be used to perform two non-Clifford gates at the same time step. The ancilla patch p3 may be used to perform a non-Clifford gate that may require rotating the data qubit ql42 in the Z basis. Meanwhile, the ancilla patch p4 may be used to perform another non-Clifford gate that may require rotating the data qubits ql32 and ql40 in the X basis.

[0102] Still referring to FIG. IB, the quantum chip comprises a quantum bus 160 comprising a plurality of bus qubits. The quantum bus 160 may be placed adjacent and operatively coupled to each qubit of the plurality of data qubits ql29, ql30, . . ., ql44 and to each qubit of the plurality of storage qubits sl7, si 8, sl9, s20. Rows of bus qubits may be placed between the magic state factory block and the resizing space 192 to allow multiple magic states to be sent from the distilling ports to the magic state storage subblocks in parallel. If a resizing space is not required, the rows of bus qubits may connect the magic state factory block to the distillation ports in the magic state factories. For example, a row of bus qubits may be placed between the magic state factory block 30 and the magic state storage block 20. Referring to FIG. 2, the ancilla patch p7 may be generated to send a magic state in the magic state storage qubit s22 to the magic storage qubit sl7 using the row of bus qubits. At the same time step, the ancilla patches p8 and p9 may be generated to send magic states in the distillation ports DI 8 and D20, respectively, to the magic state storage qubits s21 and s23, respectively, using another row of bus qubits. If the magic state factory block 30 has multiple magic state distillation levels, other ancilla patches, such as plO and pl 1, may be generated in parallel to allowmagic states to be moved between different distillation levels. The quantum bus 160 may comprise at least one non-contractible sub-bus.

[0103] Still referring to FIG. IB, the quantum chip comprises ancillary qubits anl7, anl8, anl9, an20. Ancillary qubits, such as anl7, anl8, may be placed in a data block to be connected to data qubits when executing TT / 4 rotations. For example, as disclosed with respect to FIG. 2, the ancilla patch pl may connect the ancillary qubit an 17 to the data qubits ql31, ql33, and ql37 to allow for performing a TT / 4 rotation on the data qubits q!31, ql33, and ql37 in the X basis.

[0104] The qubit types may comprise, for example, bus qubits, data qubits, magic state storage qubits, ancillary qubits, distilling ports, magic state factory qubits, magic state factory bus qubits, magic state factory data qubits, magic state factory storage qubits, magic state factory ancillary qubits, etc.

[0105] A quantum chip may have a layout representative of qubit types and an arrangement thereof on the quantum chip. The layout may comprise, for example, tiles, triangles, hexagons, rectangles, etc. The different tile shapes arise from different underlying topological codes, as the connections inherent in these codes create different tileable structures (e.g., the surface code has a square tiling, while the triangular colour code has a triangular tiling).

[0106] Now referring to FIG. 1C, there is shown a diagram of an example quantum chip layout. The quantum chip layout may comprise a triangular colour code and thus have triangular tiling. The quantum chip may comprise at least one magic state factory 220, a plurality of data qubits including the data qubit 230, and a quantum bus 200.

[0107] A quantum chip’s layout may comprise building blocks of tileable subsystems, meaning that multiple modular layouts can be tiled together to create a larger quantum chip, while all qubits on the modular layout remain accessible. For example, FIG. 1A discloses four equal modules, each comprising one of the magic state factories 110, 112, 114, 116, surrounded by a plurality of data qubits and a quantum bus, which may be tiled together to form a larger quantum chip where all qubits remain accessible.

[0108] In some cases, the quantum chip’s layout may comprise two or more magic state factory qubits and one or more distilling ports, together forming a magic state factory and surrounded by two or more qubits of any qubit type, for example, bus qubits, data qubits, magic state storage qubits, and ancillary qubits. The layout may further comprise two or more bus qubits surrounding the two or more qubits of any qubit type, for example, bus qubits, data qubits, magic state storage qubits, and ancillary qubits. In some cases, the quantum chip’s layout may comprise a first block of qubits comprising one or more data qubits surrounded by one or more bus qubits, and one or more ancillary qubits; a second block of qubits adjacent to the first block; and a third block adjacent to the second block. The second block may comprise one or more magic state storage qubits, one or more bus qubits, and one or more ancillary qubits. The third block may comprise at least one magic state factory comprising one or more distilling ports and a plurality of magic state factory qubits.

[0109] The quantum chip’s layout may comprise a qubit lattice corresponding to a topological quantum code. In some cases, the topological quantum code may be a surface code, a rotated surface code, or a colour code (Fowler et al., “Surface codes: Towards practical large-scale quantum computing,” Physical Review A 86, 032324, 2012; and Bombin, “Topological codes,” in Lidar and Brun (Eds.), Quantum Error Correction, pp. 455-481, Cambridge University Press, 2013; each of which is incorporated herein by reference in its entirety). As such, each logical qubit in the chip’s layout may correspond to multiple physical qubits on the underlying physical system, with the logical qubit encoded in the topological quantum code. Further, only some qubit operations may be available to the compiler, and their implementation through lattice surgery may depend on the encoding.

[0110] Now referring to FIG. 3, there is shown a schematic of an example system for optimizing scheduling of quantum circuit operations on a quantum chip comprising at least one magic state factory, a plurality of data qubits, and a quantum bus.[OHl] The system may comprise a digital computer 300 and a quantum computer 304. The digital computer 300 may comprise at least one processing device 306, a display device 308, an input device 310, communication ports 314 and a memory 312 comprising a computer program executable by the processing device 306. The digital computer 300may be of various types, such as any digital computer disclosed elsewhere herein.

[0112] Still referring to FIG. 3, the quantum computer 304 comprises a quantum chip 320 having at least one magic state factory, a plurality of data qubits, and a quantum bus. The quantum chip 320 may be of various types, such as, for example, the quantum chip disclosed herein with respect to FIG. 1A, FIG. IB, or FIG. 1C. The at least one magic state factory may be of various types, such as, for example, the magic state factory described herein with respect to FIG. 1 A, FIG. IB, or FIG. 1C. The data qubits may be of various types, such as, for example, the data qubits described herein with respect to FIG. 1A, FIG. IB, or FIG. 1C. The quantum bus may be of various types, such as, for example, the quantum bus described herein with respect to FIG. 1 A, FIG. IB, or FIG. 1C.

[0113] In some cases, the quantum computer 304 may comprise a readout control system 322 for quantum measurement readouts. The quantum computer 304 may be operatively connected to the digital computer 300 by way of the connection between the readout control system 322 and the communication ports 314. The quantum computer 304 may comprise any quantum computer such as any quantum device disclosed elsewhere herein.

[0114] In some cases, the digital computer 300 may be used for providing instructions to the quantum computer 304 using the communication ports 314 and the readout control system 322.

[0115] Still referring to FIG. 3, the system may comprise a special-purpose computing platform (not shown in FIG. 3) for receiving and executing instructions to use optimization procedures to solve optimization problems to optimize scheduling of quantum circuit operations. The special-purpose computing platform may comprise HPC hardware. The special-purpose computing platform may be operatively coupled to the digital computer 300 or to the quantum computer 304 or to both. The special -purpose computing platform may comprise, for example, a central processing unit (CPU), a field- programmable gate array (FPGA), an application-specific integrated circuit (ASIC), a graphics processing unit (GPU), a tensor processing unit (TPU), a tensor streaming processor (TSP), etc.

[0116] Now referring to FIG. 4, there is shown a flowchart of an example method for optimizing scheduling of quantum circuit operations on a quantum chip comprising at least one magic state factory, a plurality of data qubits, and a quantum bus.

[0117] According to processing operation 402, a quantum circuit and a layout representative of qubit types and an arrangement thereof on a quantum chip are obtained. The quantum chip may comprise at least one magic state factory, a plurality of data qubits, and a quantum bus. The quantum chip may be of various types, such as, for example, the quantum chip disclosed herein with respect to FIG. 1 A, FIG. IB, or FIG. 1C.

[0118] The quantum circuit may comprise one or more quantum operations. The one or more quantum operations may comprise one or more quantum gates. In some cases, the quantum gates may comprise one or more non-Clifford gates. The non-Clifford gates may comprise, for example, a Toffoli gate, a TT / 8 Z-rotation gate (a T-gate), or a quantum rotational gate. Each gate may be implemented through one or more quantum operations.

[0119] In some cases, the qubit types may comprise, for example, bus qubits, data qubits, magic state storage qubits, ancillary qubits, distilling ports, magic state factory qubits, magic state factory bus qubits, magic state factory data qubits, magic state factory storage qubits, magic state factory ancillary qubits, etc.

[0120] In some cases, the layout representative of qubit types and an arrangement thereof on a quantum chip may comprise a qubit lattice corresponding to a topological quantum code. In some cases, the topological quantum code may be a surface code, a rotated surface code, or a colour code (Fowler et al., “Surface codes: Towards practical large- scale quantum computing,” Physical Review A 86, 032324, 2012; and Bombin, “Topological codes,” in Lidar and Brun (Eds.), Quantum Error Correction, pp. 455-481, Cambridge University Press, 2013; each of which is incorporated herein by reference in its entirety). As such, each logical qubit in the chip layout may correspond to multiple physical qubits on the underlying physical system, with the logical qubit encoded in the topological quantum code. Further, only some qubit operations may be available to the compiler, and their implementation through lattice surgery may depend on the encoding.

[0121] In some cases, the quantum chip’s layout may comprise two or more magic state factory qubits and one or more distilling ports, together forming a magic state factory and surrounded by two or more qubits of any qubit type, for example, bus qubits, data qubits, magic state storage qubits, and ancillary qubits. The layout may further comprise two or more bus qubits surrounding the two or more qubits of any qubit type, for example, bus qubits, data qubits, magic state storage qubits, and ancillary qubits. In some cases, the quantum chip’s layout may comprise a first block of qubits comprising one or more data qubits surrounded by one or more bus qubits, and one or more ancillary qubits; a second block of qubits adjacent to the first block; and a third block adjacent to the second block. The second block may comprise one or more magic state storage qubits, one or more bus qubits, and one or more ancillary qubits. The third block may comprise at least one magic state factory comprising one or more distilling ports and a plurality of magic state factory qubits.

[0122] In some cases, the quantum chip’s layout may comprise building blocks of tileable subsystems. The layout representative of qubit types and an arrangement thereof on a quantum chip may comprise, for example, tiles, triangles, hexagons, rectangles, etc. The tileable subsystem may be determined by the underlying topological code used, as the code may determine the underlying connections of the tiles. For example, the surface code utilizes a square lattice, while the triangular colour code utilizes a triangular lattice.

[0123] In some cases, the quantum circuit may be optimized by removing quantum operations comprising a Clifford gate from the quantum circuit. The quantum circuit may be optimized in various ways. In some cases, a tableau representation of Clifford operations may be implemented. The optimization of the quantum circuit may further comprise iterating through the operations of the obtained quantum circuit while keeping a tableau representation of a Clifford operation, and either updating the given operation through conjugation by the kept Clifford operation, or updating the kept Clifford operation and removing the given operation from the quantum circuit.

[0124] Still referring to FIG. 4 and according to processing operation 404, the scheduling of the one or more quantum operations is optimized, wherein the scheduling satisfies the quantum circuit’s logical constraints and the quantum hardware’s physical constraints comprising layout constraints. Optimizing the scheduling of the one or more quantumoperations may be performed to minimize quantum computation time. In some cases, quantum computation time may be reduced when performing quantum operations in the quantum circuit in parallel while adhering to the quantum circuit’s logical constraints and quantum hardware’s physical constraints. Optimizing the scheduling of the one or more quantum operations may comprise solving a vertex-disjoint tree packing problem (also referred to as a “forest packing problem”). In some cases, a vertex-disjoint tree packing problem may be solved to find a set of quantum operations that may be performed in parallel in a time step satisfying the quantum circuit’s logical constraints and the quantum hardware’s physical constraints. In the vertex-disjoint tree packing problem to be solved, the adjacency graph that represents the arrangement of qubits in the quantum chip for a particular time step may be given along with multiple distinct subsets of its vertices, called terminals. Each set of terminals may represent the qubits required to be connected by a quantum operation that may be a candidate to be scheduled in parallel in the time step retrieved from the dependency graph that may represent the precedence constraints of the quantum operations being scheduled. In the case wherein a quantum operation requires connecting more than one qubit, finding a tree that connects the terminals of the quantum operation may be required. This tree may represent an ancilla patch and may be a subgraph of the adjacency graph. The quantum hardware’s physical constraints may impose that all terminals are leaves in their trees. In addition, the trees must be vertex-disjoint, meaning they do not share a vertex corresponding to a bus qubit in the adjacency graph used to generate them. The objective of this optimization problem is to maximize the number of quantum operations that may be scheduled at a time step, where each quantum operation may require a vertex-disjoint tree to be packed into the adjacency graph.

[0125] Still referring to FIG. 4 and according to processing operation 406, an optimized quantum circuit comprising the optimized scheduling of one or more quantum operations is reported. The optimized quantum circuit may be reported in various ways. In some cases, the optimized quantum circuit, which may comprise the order in which each quantum operation is scheduled, which quantum operations can be parallelized, and the ancilla patches required to execute each quantum operation, may be reported to a classical device, such as the digital computer 300 disclosed with respect to FIG. 3. This optimized schedule may then be combined with a quantum error correction schedule of the underlying hardware and translated into a sequence of (parallel) operations on thephysical hardware. This combined sequence may then be sent to the control electronics of a quantum computer, such as the quantum computer 304 disclosed with respect to FIG. 3, which quantum computer may implement the translated set of operations on a quantum device.

[0126] In some case, the optimized quantum circuit may be implemented and executed. In some cases, the optimized quantum circuit may be implemented and executed on a system comprising a quantum computer such as the system disclosed herein with respect to FIG. 3. The quantum computer may be of various types, such as any quantum computer disclosed elsewhere herein.

[0127] Now referring to FIG. 5, there is shown a flowchart of an example procedure for optimizing scheduling of quantum circuit operations on a quantum chip. The procedure may be used by the method disclosed herein with respect to FIG. 4.

[0128] According to processing operation 502, the quantum circuit having one or more quantum operations is translated to a dependency graph. The dependency graph may comprise the precedence constraints of the quantum operations being scheduled. The dependency graph may be represented by a directed acyclic graph, where the vertices represent the quantum operations to schedule, and the directed arcs represent the dependency constraints (i.e., a directed arc connects the quantum operation required to be executed earlier to the quantum operation required to be executed later in the quantum circuit). A dependency constraint may exist between two quantum operations if one of the quantum operations must precede the other quantum operation; therefore, the former must be executed in a prior time step than the latter. For example, a dependency constraint may exist if operations do not commute. Operations commute when they can be applied in any order without affecting the final quantum state. For example, a commutation check may involve checking whether the operations required to be performed with the same qubit requested by different operations are compatible in terms of being able to be performed at the same time step. In some cases, a dependency constraint may be imposed even when operations commute to generate a dependency graph computationally faster, such as by requiring that the same qubit cannot be connected by multiple quantum operations at the same time step. When a dependency constraint is considered, either by non-commutation or by imposition, the dependency graph contains a directed arcconnecting the vertices representing the two quantum operations either directly or indirectly through other vertices. When a dependency constraint does not exist either directly or indirectly between quantum operations, they may be parallelizable. Whether any set of quantum operations may be executed in parallel in practice may depend not only on the quantum circuit’s logical constraints represented in the dependency graph but also on the quantum hardware’s physical constraints.

[0129] Still referring to FIG. 5 and according to processing operation 504, the dependency graph and the layout representative of qubit types and an arrangement thereof on a quantum chip are used to define an optimization problem. In some cases, this layout representative of qubit types and an arrangement thereof on a quantum chip may be represented by an adjacency graph. In some cases, the adjacency graph may be used to verify the quantum hardware’s physical constraints in an encoded quantum error correction scheme, such as a surface code, a rotated surface code, or a triangular colour code, used in the quantum chip. The vertices of this adjacency graph may represent the qubits, and qubits are associated with their respective qubit types. The edges of this adjacency graph may represent a connection between coupled qubits. Vertices or edges may be associated with an X, Y, or Z basis to indicate that an X, Y, or Z basis connection exists between the adjacent qubits, respectively. For example, as disclosed with respect to FIG. IB, the qubit ql29 is connected to two bus qubits. The qubit ql29 is coupled to the bus qubit on its left and there is an X basis connection between them, and to the bus qubit above it and there is a Z basis connection between them. Therefore, an adjacency graph representative of qubit types and an arrangement thereof on the quantum chip layout depicted in FIG. IB contains vertices representing qubits ql29 and the bus qubits coupled to it. The adjacency graph contains an edge associated with the X basis connecting the vertices representing qubits ql29 and the bus qubit on its left, and the adjacency graph may contain another edge associated with the Z basis connecting the vertices representing qubits ql29 and the bus qubit above it. Qubits may only be directly connected to adjacent qubits. If qubits are not adjacent, they may require an ancilla patch to interact.

[0130] In some cases, the optimization problem may comprise a scheduling problem where the quantum operations (commonly called “jobs”) in the quantum circuit are to be scheduled to minimize the quantum computation time, which may be measured by thetotal number of time steps (called the “makespan”) needed to execute them. As defined elsewhere herein, if a job requires connecting more than one terminal, a tree representing an ancilla patch may be generated in the adjacency graph to connect its terminals to schedule the job. For example, as disclosed with respect to an adjacency graph representative of the quantum chip layout depicted in FIG. 2, seven jobs are scheduled in parallel, and each job is represented by a tree in the figure. A tree connecting only two terminals may be called a path. When a job requires only a single terminal, a tree is not required to be generated, but this job may still be scheduled when all constraints are satisfied. Terminals representing data qubits may be predefined, while terminals representing ancillary qubits, magic state storage qubits, and distilling ports may be chosen from among the vertices representing these qubit types when a qubit of that type is required by a job. The tree that connects the terminals may contain intermediate vertices of type “bus qubit.” The terminals are required to be leaves in the tree to be generated. Referring to the previous example disclosed with respect to FIG. 2, tree pl (ancilla patch pl) connects four terminals, where three of them are data qubits and one is an ancillary qubit, and all terminals are leaves in the tree. A different ancillary qubit may have been chosen to be connected to the data qubits to schedule this quantum operation using a different tree. A tree is composed of vertices that are not being used to execute another job, either scheduled in the current or in a previous time step, at the time step that the current job is scheduled.

[0131] The jobs that can be scheduled in a time step are the roots of the dependency graph in the time step. The roots of the dependency graph represent the jobs remaining to be scheduled that have no other job to be scheduled that must precede them. These jobs may be candidates to be scheduled in parallel. A set of jobs may actually be scheduled to be performed in parallel if the trees generated to connect the terminals of each job in the set are vertex-disjoint, meaning that they do not share a vertex corresponding to a bus qubit in the adjacency graph used to generate them. For example, the trees disclosed with respect to FIG. 2 are vertex-disjoint. Generating the trees for candidate jobs to be scheduled in parallel is an optimization problem called the vertex-disjoint tree packing problem contained in the scheduling problem. The scheduling problem is considered solved when all jobs comprising the quantum operations in the quantum circuit are scheduled.

[0132] The jobs of the optimization problem may comprise jobs of various types: qubit measurement, TT / 2 rotation, TT / 4 rotation, TI / Q rotation, magic state store, magic state storage replenishment, qubit tile turn, and magic state factory replenishment. Jobs of type qubit measurement, TT / 2 rotation, TT / 4 rotation, and TT / 8 rotation comprise the quantum operations in the quantum circuit. Jobs of type qubit measurement, TT / 2 rotation, and TT / 4 rotation comprise the Clifford gates, while jobs of type TT / 8 rotation comprise the non-Clifford gates. Jobs of type magic state store comprise the process of storing a distilled magic state from a distilling port into a magic state storage qubit. Jobs of type magic state storage replenishment comprise the process of replenishing magic state storage qubits after the magic state stored in a magic state storage qubit is used by a nonClifford gate. Jobs of type qubit tile turn comprise the turning of a qubit tile that is accessed only by the quantum bus through one of its edges and is required to be turned to have a different edge accessed by the bus such that operations on a different basis (X, Y, or Z) can be performed. Jobs of type magic state factory replenishment comprise the magic state distillation process performed in the magic state factories to distill new magic states in the distilling ports. Other operations that may not involve ancilla patch generation may be considered, such as qubit expansion, qubit contraction, and edges rebasing.

[0133] The jobs to be scheduled may require the generation of an ancilla patch using the quantum bus to connect its terminals, making the qubits represented by these terminals unavailable for the scheduling of new quantum operations for a number of time steps. Jobs of type qubit measurement and TT / 2 rotation require connecting a defined set of data qubits, making all connected qubits unavailable for one time step. Tree p2 (ancilla patch p2) disclosed with respect to FIG. 2 represents a connection made in jobs of type qubit measurement and TT / 2 rotation. Jobs of type TT / 4 rotation require connecting a defined set of data qubits to any ancillary qubit, making all connected qubits unavailable for one time step. Tree pl (ancilla patchpl) disclosed with respect to FIG. 2 represents a connection made in jobs of type TT / 4 rotation. Jobs of type TT / 8 rotation may require up to three steps to be scheduled. The first step connects a defined set of data qubits to any distilling port or magic state storage qubit that contains a magic state, making all connected qubits unavailable for one time step (i.e., they are unavailable only during the time step they are scheduled). Trees p3 and p4 (ancilla patches p3 and p4) disclosed with respect to FIG. 2 represent connections made in the first step described for a job of type TT / 8 rotation. Thesecond step is a quantum correction that may be required after the first step and requires the execution of a job of type TT / 4 rotation described elsewhere herein. The third step is another quantum correction that may be required after the second step and requires the execution of a job of type TT / 2 rotation described elsewhere herein. Jobs of type magic state store require connecting a distilling port to a magic state storage qubit, making the distilling port unavailable for one time step and the magic state storage qubit unavailable for two time steps (i.e., one time step for receiving the magic state and another for preparing its edges’ bases). Trees p5 and p7 disclosed with respect to FIG. 2 represent connections made in jobs of type magic state store. Jobs of type magic state storage replenishment require connecting a magic state storage qubit to an ancillary qubit, making both unavailable for one time step. Tree p6 (ancilla patch p6) disclosed with respect to FIG. 2 represents a connection made in jobs of type magic state storage replenishment. Jobs of type qubit tile turn do not require an ancilla patch, instead requiring using a bus qubit adjacent to the qubit to be turned, making both the qubit being turned and the bus qubit used unavailable for three time steps. The job of type qubit tile turn is not represented in FIG. 2 because no qubit is required to turn when using the layout disclosed with respect to FIG. IB and FIG. 2. Jobs of type magic state factory replenishment make all distilling ports connected to the magic state factory where the magic state distillation protocol will be performed unavailable for a number of time steps depending on the magic state distillation protocol performed in the magic state factory. The job of type magic state storage replenishment is also not represented in FIG. 2 because it does not require the generation of a tree. Since quantum error correction may be performed inside a magic state factory when distilling new magic states, the exact number of time steps required to distill new magic states may be stochastic. A magic state factory replenishing may fail to distill new magic states.

[0134] In some cases, the procedure for generating an ancilla patch to connect the terminals for a job may be done in multiple steps. In each step, a segment of the ancilla patch may be generated. Each segment may connect some of the terminals to an intermediate bus qubit or may connect an intermediate bus qubit to another intermediate bus qubit. The connection of the segments may form a valid ancilla patch that connects all terminals required for a job. Some of these segments may be determined during compilation time. Some of these segments cannot be determined during compilation timedue to uncertainties about which terminals will be available to be chosen during the quantum computation time. In this case, predefined segments may be generated during compilation time and these segments can quickly be retrieved by the quantum computer during the quantum computation time to perform the job. The lighter segments of the trees disclosed with respect to FIG. 2 may be determined during compilation time, while the darker segments of the trees in the figure may be generated during compilation time but require being retrieved by the quantum computer during the quantum computation time following the information revealed about the distillation process during the quantum computation.

[0135] Still referring to FIG. 5 and according to processing operation 506, an optimization procedure is used to solve the optimization problem to optimize the scheduling of the one or more quantum operations of the quantum circuit. The optimization procedure may be of various types. In some cases, the optimization procedure may comprise a routine for solving the scheduling problem and / or subroutines to solve a vertex-disjoint tree packing problem arising from the quantum operations that are candidates for being scheduled in parallel in different time steps. In some cases, the routine used as an optimization procedure may comprise solving problems involved in, for example, integer programming, a maximum independent set, Steiner trees, and topological sorting, among other possible procedures. In the cases wherein the optimization procedure may involve the use of mathematical programming to model the scheduling problem and / or a vertex-disjoint tree packing problem to be solved by any general procedure used to search for the optimal solution, such as branch-and-bound, branch-and-cut, or an interior-point method, among others, the optimization procedure is considered to be an integer programming problem solving procedure. In the cases wherein the optimization procedure involves generating Steiner trees for a packing problem using other procedures than mathematical programming, such as heuristic algorithms, the optimization procedure may be considered to be a Steiner tree problem solving procedure. In the cases wherein the optimization procedure involves using any procedure that generates distinct trees to schedule a set of parallelizable quantum operations using an adjacency graph, then finding the set of vertex-disjoint trees with highest cardinality from a graph built from all trees to solve a packing problem, the optimization procedure may be considered to be a maximum independent set problem solving procedure. In the caseswherein the optimization procedure involves using any procedure that sorts the quantum operations in a dependency graph, and schedule the quantum operations in the sorted order, either deterministically or stochastically using notions of queuing systems or simulation, without directly generating the trees that connect qubits, the optimization procedure may be considered to be a topological sorting problem solving procedure.

[0136] In some cases, the optimization problem may comprise an objective function minimizing the makespan for the quantum computation time subject to the quantum circuit’s logical constraints and the quantum hardware’s physical constraints.

[0137] In some cases, an assignment problem to decide on the available plurality of data qubits to be used may be solved. The optimization problem may comprise assigning the most requested data qubits to the most desirable tiles in the quantum chip first. A tile may be considered to be more desirable if it provides multiple avenues of access to the quantum bus, therefore allowing quantum operations on any basis (X, Y, or Z) to be performed in a single time step. In some cases, the assignment of qubits to tiles with similar desirability may be decided using a procedure that may comprise, for example, random assignment or cluster assignment. The random assignment procedure may comprise randomly sorting tiles to assign to data qubits. The cluster assignment procedure may comprise sorting topological regions of the quantum chip layout that may be used to form clusters of qubits based on request-based metrics, then assigning the clusters of qubits formed to distinct topological regions of the quantum chip’s layout.

[0138] While preferred embodiments of the present invention have been shown and described herein, it will be obvious to those skilled in the art that such embodiments are provided by way of example only. It is not intended that the invention be limited by the specific examples provided within the specification. While the invention has been described with reference to the aforementioned specification, the descriptions and illustrations of the embodiments herein are not meant to be construed in a limiting sense. Numerous variations, changes, and substitutions will now occur to those skilled in the art without departing from the invention. Furthermore, it shall be understood that all aspects of the invention are not limited to the specific depictions, configurations, or relative proportions set forth herein which depend upon a variety of conditions and variables. It should be understood that various alternatives to the embodiments of the inventiondescribed herein may be employed in practicing the invention. It is therefore contemplated that the invention shall also cover any such alternatives, modifications, variations, or equivalents. It is intended that the following claims define the scope of the invention and that methods and structures within the scope of these claims and their equivalents be covered thereby.

Claims

CLAIMS:

1. A quantum chip comprising:(a) at least one magic state factory comprising: a plurality of qubits configured to implement one or more non-Clifford gates and one or more distilling ports;(b) a plurality of data qubits; and(c) a quantum bus comprising bus qubits adjacent and operatively coupled to each of said one or more distilling ports of said at least one magic state factory and to one or more qubits of said plurality of data qubits, wherein said quantum bus is configured to connect said at least one magic state factory with at least one of said plurality of data qubits using said one or more distilling ports.

2. The quantum chip of claim 1, wherein said quantum bus comprises at least one non-contractible sub-bus.

3. The quantum chip of claim 1, wherein said at least one magic state factory comprises two or more magic state factories arranged in multiple distillation levels.

4. The quantum chip of claim 1, further comprising one or more magic state storage qubits.

5. The quantum chip of claim 4, wherein said quantum bus is configured to connect said at least one magic state factory with at least one of said plurality of data qubits using said one or more distilling ports mediated via said magic state storage qubits.

6. The quantum chip of claim 1, further comprising one or more qubit resizing spaces, wherein said one or more qubit resizing spaces are configured to perform one or more qubit resizing quantum operations.

7. The quantum chip of claim 1, wherein said one or more non-Clifford gates comprise at least one member selected from the group consisting of: a Toffoli gate, a TT / 8 Z-rotation gate (T-gate), and a quantum rotational gate.

8. The quantum chip of claim 1, wherein said quantum chip has a layout representative of qubit types and an arrangement thereof on said quantum chip, wherein said layout comprises at least one member selected from the group consisting of: tiles, triangles, hexagons, and rectangles.

9. The quantum chip of claim 1, wherein said quantum chip has a qubit type comprising at least one member selected from the group consisting of: bus qubits, data qubits, magic state storage qubits, ancillary qubits, distilling ports, magic state factory qubits, magic state factory bus qubits, magic state factory data qubits, magic state factory storage qubits, and magic state factory ancillary qubits.

10. The quantum chip of claim 1, wherein said quantum chip has a layout comprising two or more magic state factory qubits surrounded by one or more distilling ports and two or more qubits of any qubit type selected from the group consisting of: bus qubits, data qubits, magic state storage qubit, and ancillary qubits; said layout further comprising two or more bus qubits surrounding said two or more qubits.

11. The quantum chip of claim 1, wherein said quantum chip has a layout comprising: a first block of qubits comprising one or more data qubits surrounded by one or more bus qubits; a second block of qubits adjacent to said first block, said second block comprising one or more magic state storage qubits and one or more bus qubits; and a third block of qubits adjacent to said second block, said third block comprising at least one magic state factory comprising one or more distilling ports and a plurality of magic state factory qubits.

12. The quantum chip of claim 1, wherein said quantum chip has a layout comprising building blocks of tileable subsystems.

13. The quantum chip of claim 1, wherein said quantum chip has a layout comprising one or more blocks of four data qubits placed adjacent to each other in a two-by-two table and surrounded by twelve bus qubits.

14. The quantum chip of claim 1, wherein said quantum chip has a layout comprising a qubit lattice corresponding to a topological quantum code.

15. The quantum chip of claim 14, wherein said topological quantum code is a surface code, a rotated surface code, or a colour code.

16. A method for scheduling quantum circuit operations on a quantum chip comprising at least one magic state factory, a plurality of data qubits, and a quantum bus, the method comprising:(a) obtaining a quantum circuit and a layout, wherein said layout is representative of one or more qubit types and an arrangement of qubits on said quantum chip, wherein said quantum circuit comprises one or more quantum operations;(b) optimizing said scheduling of said one or more quantum operations, wherein said scheduling is subject to one more constraints, wherein said one or more constraints are base at least in part on said layout and by said quantum circuit, and wherein said optimizing comprises solving at least a vertex-disjoint tree packing problem; and(c) reporting an optimized quantum circuit comprising the optimized scheduling of said one or more quantum operations.

17. The method of claim 16, wherein (b) comprises optimizing said quantum circuit by removing at least one of said one or more quantum operations, wherein said at least one of said one or more quantum operations comprises a Clifford gate.

18. The method of claim 16, wherein (b) comprises minimizing computation time of said one or more quantum operations.

19. The method of claim 16, wherein said layout comprises a qubit lattice corresponding to a topological quantum code.

20. The method of claim 19, wherein said topological quantum code is a surface code, a rotated surface code, or a colour code.

21. The method of claim 16, wherein said layout comprises at least one member selected from the group consisting of: tiles, triangles, hexagons, and rectangles.

22. The method of claim 16, wherein said one or more qubit types comprise at least one member of the group consisting of: bus qubits, data qubits, magic state storage qubits, ancillary qubits, distilling ports, magic state factory qubits, magic state factory bus qubits, magic state factory data qubits, magic state factory storage qubits, and magic state factory ancillary qubits.

23. The method of claim 16, wherein said layout comprises two or more magic state factory qubits surrounded by one or more distilling ports and two or more qubits of any qubit type selected from the group consisting of: bus qubits, data qubits, magic state storage qubit, and ancillary qubits; said layout further comprising two or more bus qubits surrounding said two or more qubits.

24. The method of claim 16, wherein said layout comprises: a first block of qubits comprising one or more data qubits surrounded by one or more bus qubits; a second block of qubits adjacent to said first block, said second block comprising one or more magic state storage qubits and one or more bus qubits; and a third block of qubits adjacent to said second block, said third block comprising at least one magic state factory comprising one or more distilling ports and a plurality of magic state factory qubits.

25. The method of claim 16, wherein said arrangement of said qubits comprises building blocks of tileable subsystems.

26. The method of claim 16, wherein said quantum circuit comprises a sequence of quantum operations comprising at least one member selected from the group consisting of: a Toffoli gate, a71 / Q Z-rotation gate, and a quantum rotational gate.

27. The method of claim 16, further comprising implementing and executing said optimized quantum circuit.

28. The method of claim 16, wherein (b) comprises:(bl) translating said quantum circuit comprising said one or more quantum operations to a dependency graph;(b2) using said dependency graph and said layout to define an optimization problem; and52(b3) using an optimization procedure to solve said optimization problem to schedule said one or more quantum operations of said quantum circuit.

29. The method of claim 28, wherein said optimization procedure comprises at least one member of the group consisting of: a maximum independent set, Steiner trees, topological sorting, integer programming, branch-and-bound, branch-and-cut, and an interior-point.

30. The method of claim 28, wherein said optimization problem comprises an objective function minimizing the quantum computation time, quantum circuit’s logical constraints, and quantum hardware’s physical constraints.

31. The method of claim 28, wherein (b3) comprises solving an assignment problem to decide on the available plurality of data qubits to be used.

32. A system for optimizing scheduling of quantum circuit operations on quantum chip comprising at least one magic state factory, a plurality of data qubits, and a quantum bus, the system comprising: a digital computer comprising a memory having instructions which when executed are configured to at least:(i) obtain a quantum circuit and a layout, wherein said layout is representative of one or more qubit types and an arrangement of qubits on said quantum chip, wherein said quantum circuit comprises one or more quantum operations;(ii) optimize said scheduling of said one or more quantum operations, wherein said scheduling is subject to one more constraints, wherein said one or more constraints are based at least in part on said layout and said quantum circuit, and wherein said optimizing comprises solving at least a vertex-disjoint tree packing problem; and(iii) report an optimized quantum circuit comprising the optimized scheduling of said one or more quantum operations; andwherein said digital computer is communicatively coupled to a quantum computer, wherein said quantum computer is configured to implement said scheduled quantum circuit.

33. The system of claim 32, further comprising said quantum computer.

34. The system of claim 33, wherein said quantum computer comprises the quantum chip of any one of claims 1-15.

35. A system for scheduling quantum circuit operations on a quantum chip comprising at least one magic state factory, a plurality of data qubits, and a quantum bus, the system comprising: a quantum computer comprising a quantum chip comprising:(i) at least one magic state factory comprising a plurality of qubits configured to implement one or more non-Clifford gates and one or more distilling ports;(ii) a plurality of data qubits; and(iii) a quantum bus comprising bus qubits adjacent and operatively coupled to each of said one or more distilling ports of said at least one magic state factory and to one or more qubits of said plurality of data qubits; wherein said quantum computer is configured to execute said quantum circuit operations; and wherein said quantum computer is communicatively coupled to a digital computer, wherein said digital computer configured to optimize scheduling of said quantum circuit operations on said quantum chip.

36. The system of claim 35, further comprising said digital computer.

37. The system of claim 36, wherein the digital computer is configured to implement the method of any one of claims 16-31.

38. The system of any one of claims 32-37, further comprising a special-purpose computing platform, wherein said special-purpose computing platform is configured to receive and execute instructions to at least implement an optimization procedure to solve an optimization problem to optimize said quantum circuit operations, wherein said special-purpose computing platform is communicatively coupled to said digital computer or to said quantum computer or both.

39. The system of claim 38, wherein said special-purpose computing platform comprises at least one member of the group consisting of: a central processing unit (CPU), a field-programmable gate array (FPGA), an application-specific integrated circuit (ASIC), a graphics processing unit (GPU), a tensor processing unit (TPU), and a tensor streaming processor (TSP).

Citation Information

Cited By

  • Method for performing logical qubit operations

    GB2703293A