Quantum computer design
By designing quantum computing components of multiple spin qubits and shuttle channels, combining mathematical models and initial designs, optimizing the building block layout, the problem of insufficient general quantum computer capabilities in the existing technology is solved, and efficient quantum algorithm execution and Hardware performance improvement.
Patent Information
- Application Number
- CN202180105398.3
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2021-12-21
- Publication Date
- 2024-11-05
AI Technical Summary
Existing quantum computers have insufficient capabilities in implementing general quantum computing, especially when designing general quantum computing hardware, it is difficult to implement the 104 logical qubits required for logical qubits with error correction functions.
Using a method to design quantum computing elements, leverage multiple spin qubits and shuttle channels, combine building blocks to create improved designs, specially configured to execute specific quantum algorithms, optimize building blocks and shuttle channels The arrangement is to improve the performance of quantum computing elements.
It realizes specially configured quantum computing elements, can execute quantum algorithms more effectively, improves the performance and reliability of quantum computing hardware, and overcomes the problem of insufficient capabilities of general-purpose quantum computers in the prior art.
Smart Images

Figure CN118901069A_ABST
Abstract
Description
[0001] The invention relates to a method for designing a quantum computing element, a corresponding quantum computing element and a device comprising such a quantum computing element.
[0002] It is well known that, in theory, quantum computers can significantly outperform conventional computers in specific applications. However, the capabilities of existing quantum computers today are limited. In particular, people would like to develop a universal quantum computer. However, according to the quantum computing concepts of the prior art, a useful universal quantum computer would require at least 10 4 Today, this seems difficult or even impossible to achieve.
[0003] From WO 2021 / 052541A1, a quantum computing device with a network of shuttle channels is known. The elements used therein are further described in WO 2021 / 052531A1 (shuttle channels), WO 2021 / 052539A1 (junction points), WO 2021 / 052538A1 (loading terminals), WO 2021 / 052537A1 (manipulation regions) and WO 2021 / 052536A1 (readout terminals). Although the quantum computing devices described in these documents are already promising, there is still room for improvement, especially in achieving universal quantum computing.
[0004] Given the limited capabilities of existing technology quantum computing concepts, it is desirable to use application-specific quantum computing hardware. That is, given the challenges of general-purpose quantum computing, it is desirable to design quantum computing hardware specifically for a certain desired quantum algorithm. However, there are no existing technology concepts for systematically obtaining such quantum computing hardware.
[0005] The purpose of the present invention is to provide a concept for systematically designing quantum computing hardware that is specifically configured to execute a given quantum algorithm.
[0006] This object is achieved with a method, a quantum computing element and a device according to the independent claims. Advantageous refinements are set forth in the dependent claims. The features described in the claims and in the description can be combined with one another in any technically reasonable manner.
[0007] According to the present invention, a method for designing a quantum computing element for executing a quantum algorithm is proposed, wherein the quantum computing element is configured to operate with a plurality of spin qubits and has a plurality of shuttle channels, the shuttle channels having a plurality of building blocks, and wherein the method comprises:
[0008] a) provide a corresponding mathematical model for each of the building blocks,
[0009] b) provide an initial design of quantum computing components,
[0010] c) creating a mathematical model of the initial design by combining mathematical models of building blocks according to the initial design,
[0011] d) obtaining an improved design of the quantum computing element using the mathematical model of the initial design created in step c) and taking into account the quantum algorithm to be executed by the quantum computing element.
[0012] The method aims to design a quantum computing element. A quantum computing element is a piece of hardware. A quantum computing element can be a quantum computer or part of a quantum computer. A quantum computing element can be connected to additional quantum computing hardware and / or additional conventional hardware.
[0013] The designed quantum computing element as a result of the method is configured to execute a quantum algorithm. Among them, the method aims to design a quantum computing element so as to be specifically configured for the quantum algorithm. That is, the purpose of the method is to find a quantum computing element suitable for being designed for a quantum algorithm. Therefore, the details of the quantum algorithm and / or the problem to be solved can be used as input to the method. In addition, a class of problems can be defined and used as input to the method. In addition, the details of the conventional algorithm that should be used in combination with the quantum algorithm can be used as input to the method. In addition, the availability of the building blocks and / or qubit types that should be used can be used as input to the method.
[0014] The quantum computing element uses a spin qubit. A spin qubit is a two-level quantum system. Preferably, the spin qubit is implemented as an electron spin qubit or a hole spin qubit. An electron spin qubit can be implemented with one electron. However, an electron spin qubit can also be implemented with a group of electrons (e.g., two or three electrons). In fact, the method can be performed using any conceivable type of spin qubit. If the electron spin has entered a known state, the electron can be used as a qubit. To this end, the electron can be initialized to become the implementation of a spin qubit. Typically, a qubit remains implemented by the same electron throughout the quantum algorithm. However, it is also possible that a qubit is initialized with a first electron and implemented by a second electron after the operation. There are even some operations after which it is impossible to determine whether the qubit is still implemented by the first electron or by a different second electron. This is not a problem for executing quantum algorithms, because it is sufficient to implement the qubit in some way at any time. The discussion of electrons in this paragraph also applies to holes with necessary modifications. That is, the quantum computing element can operate using any conceivable type of hole spin qubit.
[0015] The quantum computing element is preferably based on semiconductor technology. That is, the quantum computing element is preferably made of semiconductor material, particularly preferably made of silicon (Si). Preferably, the semiconductor material is silicon germanium (SiGe), in particular undoped silicon germanium. In addition to semiconductor materials, the quantum computing element may also include other materials, in particular metal contacts. The quantum computing element can be described as a semiconductor heterostructure. Preferably, the quantum computing element includes a semiconductor substrate, preferably a SiGe substrate or a Si substrate. The substrate is preferably undoped. The advantage of using semiconductor materials is that these materials are relatively easy to handle and inexpensive. This is particularly applicable to silicon. In addition, there is a mature technology for using silicon in computing hardware. Two-dimensional electron gas (2DEG) or two-dimensional hole gas (2DHG) can be confined in the substrate. The potential can be manipulated using a gate electrode so as to obtain a quantum well or even a quantum dot in a 2DEG or 2DHG. Among them, electrons or holes can be captured respectively so that their spins can be used as the realization of a spin qubit. Moving the potential can move quantum wells and quantum dots, which can lead to the movement of charge carriers, thereby leading to the movement of qubits.
[0016] The quantum computing element has a shuttle channel. The spin qubit can shuttle, i.e. move, along the shuttle channel. This should be understood as, for example, causing the electrons or holes that realize the corresponding spin qubit to shuttle along the shuttle channel. The shuttle channel is a path configured to actively move the spin qubit. Specifically, a plurality of gate electrodes can be used to realize the shuttle channel. By changing the potential of the gate, the electron or hole can be moved. If the potential of the gate along the shuttle channel changes in a continuous manner, the electron or hole can move along the shuttle channel. Preferably, the shuttle channel is arranged on the surface of the substrate of the quantum computing element. The shuttle channel is preferably straight. That is, the electrons or holes moving along the shuttle channel do not have to follow a winding or curved path, and following a winding or curved path will be more difficult to achieve.
[0017] The shuttle channel includes a plurality of building blocks. A building block can be any device capable of influencing a spin qubit in a corresponding shuttle channel. Wherein, "influencing a spin qubit" can mean moving a spin qubit, changing the movement direction of a spin qubit, and / or changing the spin state of a spin qubit.
[0018] Preferably, the shuttle channels are arranged so as to form a shuttle channel network with a plurality of junctions. The junction is an example of a building block. It can affect the spin qubit within the shuttle channel until the direction of movement of the spin qubit can be changed at the junction. The junction is preferably a T-junction. That is, the end of the first shuttle channel is connected to the second shuttle channel at a point spaced apart from the end of the second shuttle channel. In addition, an X-junction is also conceivable. Among them, the two shuttle channels meet at a point spaced apart from the ends of the two shuttle channels. For practical reasons, the X-junction can be more easily realized by a pair of T-junctions. Unless the two shuttle channels cross each other so that both form a straight line at least near the X-junction, the X-junction is considered to be realized by a pair of T-junctions. However, if one of the two intersecting shuttle channels is offset at the junction, the junction is considered to be realized by a pair of T-junctions.
[0019] In addition, the quantum computing element preferably includes a manipulation region. The manipulation region is an example of a building block. In the manipulation region, the state of the spin qubit can be changed. Thereby, a quantum operation can be performed. In the manipulation region, a single qubit can be manipulated. The corresponding operation can be called a single-qubit operation. In addition, multiple qubits can be manipulated together in the same manipulation region. Specifically, this can be done with two qubits. The corresponding operation can be called a multi-qubit operation, in particular a double-qubit operation.
[0020] Preferably, the quantum computing element is configured to be operated by an operation method, the operation method comprising, for a plurality of spin qubits respectively:
[0021] A) Initialize the qubits,
[0022] B) manipulating a qubit in at least one manipulation region of a plurality of manipulation regions,
[0023] C) Reading out the qubit.
[0024] For each qubit, steps A) to C are performed separately. For each qubit, the corresponding steps A) to C are preferably performed in the order described. During steps A) to C), the spin qubit should remain stable. That is, the qubit state should not be changed unintentionally or in an arbitrary manner. However, in particular due to decoherence, the spin qubit may lose its state. This unavoidable influence can lead to errors, which can be handled by error correction. In addition, decoherence losses can be minimized by making the distance that the spin qubit travels as short as possible. The coherence time of the spin qubit implemented in a semiconductor depends on the temperature. Therefore, it is preferred to place the quantum computing element in a refrigerator at a temperature below 4K, preferably below 1K to perform the method. In experiments, particularly good results were achieved at 30mK.
[0025] The method for designing a quantum computing element comprises steps a) to d). These steps are preferably performed in the order described. However, in particular, steps a) and b) may also be performed in any different order.
[0026] In step a), a corresponding mathematical model is provided for each building block. The mathematical model is a description of the corresponding building block using mathematical expressions and formulas. The mathematical model reflects at least some properties of the corresponding building block related to the execution of a quantum algorithm with a quantum computing element. That is, the mathematical model does not have to reflect every detail of the corresponding building block. It is sufficient for the mathematical model to be a simplified representation of the corresponding building block. For example, the mathematical model may include information about electric potential and magnetic field, but ignore all other physical effects. Preferably, the mathematical model is a dynamic model. That is, the mathematical model covers a certain time period. This can be achieved by considering certain time points within the time period. Preferably, these time points are equally spaced from each other. For example, the mathematical model may include information about the time evolution of the electric potential and magnetic field. Using the mathematical model, it is possible to calculate how charge carriers (e.g., electrons) will move through the quantum computing element and / or how the spin of the charge carriers will evolve. In addition, the mathematical model can provide information such as fidelity.
[0027] A mathematical model of a certain building block can be considered as a digital twin of that building block. That is, before actually manufacturing a quantum computing element or any of its components, it is possible to predict, for example, how charge carriers (e.g., electrons) will move through the corresponding building blocks and / or how the spins of charge carriers will be affected within the building blocks. Alternatively or additionally, the fidelity can be predicted for a certain operation performed with the building block. Having such a digital twin can facilitate the design of quantum computing elements. In particular, the use of digital twins can significantly reduce the design effort, since trial and error is possible before determining the final design, without having to manufacture any quantum computing elements or their building blocks.
[0028] Preferably, the mathematical model of the respective building block has as input a respective value for each electrical signal which would be input into the building block if the building block were actually used. The input is preferably time dependent. That is, if the operating region is operated, for example, by applying certain electrical control voltages, the mathematical model of the operating region preferably has as input a respective value for each electrical control voltage at each point in time within a certain time period.
[0029] Preferably, the mathematical model of the respective building block has as output respective information about the position of the charge carriers and / or respective values of their spin states. The information about the position of the charge carriers may be one-dimensional information, two-dimensional information or three-dimensional information. That is, one value, two values or three values may be provided. Preferably, two dimensions are used. The output is preferably time dependent. A coordinate system may be used to describe the position. Preferably, the same coordinate system is used for all building blocks. That is, the same coordinate system may be used to describe the entire quantum computing element.
[0030] Preferably, in step a), a mathematical model of the shuttle channel is also provided. To this end, shuttling in the shuttle channel can be included in predicting the behavior of the quantum computing element.
[0031] These models may be provided in step a) by generating mathematical models as part of the method. Alternatively, mathematical models may be provided in step a) by selecting to use previously generated mathematical models.
[0032] In step b), an initial design of a quantum computing element is provided. In general, the initial design can be any design. That is, in theory, starting from any initial design, the method can provide suitable results. Although the initial design is preferably capable of executing a quantum algorithm, this is not even necessary. However, it is advantageous to use an initial design that is as close to the optimal design as possible. The less the initial design is modified by the method, the shorter the calculation time for executing the method is generally. In addition, the result of the method is not necessarily the optimal design, but only a design that is improved compared to the initial design. In general, it can be expected that the improved design obtained by the method will be closer to the optimal design and closer to the optimal design than the initial design.
[0033] Therefore, it is recommended to use the design that is considered to be the best design as the initial design in step b). Generally speaking, it is recommended that the initial design is the design that would be used to manufacture the quantum computing device if the method is not performed. That is, any prior art method for designing a quantum computing element can be used to obtain the initial design. Generally, the method will systematically provide further improvements to the initial design.
[0034] In step c), a mathematical model of the initial design is created by combining the mathematical models of the building blocks according to the initial design. That is, a digital twin of the quantum computing element is obtained. The mathematical model of the initial design can take as input the input of the mathematical models of the building blocks involved in the initial design. Among them, several inputs of the building blocks can be summarized as a joint input. For example, if in an actual quantum computing element, the same voltage is applied to the gate electrodes of several building blocks, this can be expressed as the mathematical model of the initial design having only one input value for these gate electrodes. In addition, the output of the mathematical model of the first building block can be used as the input of the mathematical model of the second building block. That is, when processing the second building block, the mathematical model of the quantum computing element can use the value of the first building block obtained internally. To this end, the mathematical model of the initial design can have a number of inputs that is less than the sum of the number of inputs of the mathematical models of the building blocks.
[0035] Preferably, the mathematical model of the initial design has as output corresponding information about the position of the charge carriers and / or corresponding values of the spin states of the charge carriers. The information about the position of the charge carriers can be one-dimensional information, two-dimensional information or three-dimensional information. That is, one value, two values or three values can be provided. Preferably, two dimensions are used. The output is preferably time-dependent. A coordinate system can be used to describe the position. Preferably, the same coordinate system is used for all building blocks. That is, the same coordinate system can be used to describe the entire quantum computing element. Additionally or alternatively, the mathematical model of the initial design can have as output information such as fidelity.
[0036] In step d), an improved design of the quantum computing element is obtained using the mathematical model of the initial design created in step c) and taking into account the quantum algorithm to be executed by the quantum computing element. Compared with the initial design, the improved design can be improved in various aspects. For example, the improved design can be different from the initial design in terms of the number and arrangement of building blocks and / or shuttle channels. Specifically, the improved design can be improved by shortening the shuttle distance of the quantum bit and thus improving the fidelity. In addition, the improved design can be different from the initial design in terms of the configuration of one or more building blocks. For example, in the improved design, the number, arrangement or size of the gate electrodes of the building blocks (e.g., the manipulation region) can be different from the initial design.
[0037] An improved design can be obtained by defining one or more variation parameters. Such variation parameters can be, for example, geometric parameters, such as the position of a building block, the length of a shuttle channel, or the spacing of gate electrodes of a building block or a shuttle channel. In addition, the number of building blocks, junctions, or shuttle channels can be used as variation parameters. Generally, any aspect of the design of a quantum computing element, as long as it can be expressed as a parameter and may have an impact on the performance of the quantum computing element, can be used as a variation parameter to obtain an improved design in step d). Specifically, any input to a mathematical model can be used as such a variation parameter. Generally, the more variation parameters used, the better the improved design obtained. However, the number of variation parameters is usually limited by the available computing power. That is, if too many variation parameters are used, the mathematical model cannot be actually processed and / or the calculation time of step d) will be unacceptably long.
[0038] For the variation parameters used in step d), corresponding boundary conditions can be provided. For example, a limit can be given, i.e., the gate electrode must not be smaller than the size that can be achieved by the available manufacturing method, and must not be larger than the size that is considered reasonable. In addition, a limit can be given, i.e., the voltage must not be greater than the output voltage that can be provided by the available voltage source. However, it is usually not necessary to define corresponding boundaries for each variation parameter.
[0039] Initially, the variation parameters are set to values that make the mathematical model reflect the initial design. That is, the starting values of the variation parameters correspond to the initial design.
[0040] Improved designs can be obtained by varying the variation parameters within given limits. Thus, one or more result values can be calculated, which are measures of the suitability of the quantum computing element for the quantum algorithm. For example, such result values can be measures of fidelity, manufacturing difficulty, yield, temperature, error rate, or computation time. A mathematical model can be used to obtain the result values from the variation values. Specifically, an objective function can be defined and solved, for example numerically.
[0041] The improved design is essentially obtained by solving mathematical equations. In theory, this can be done manually. However, for practical reasons, it is preferred to use a computer to perform step d). Preferably, the computer solves the equations numerically. In particular, it is preferred that the improved design in step d) is obtained by computer simulation. For example, commercially available software such as COMSOL Using such software, the initial design can be generated as a three-dimensional computer model, to which material properties and other parameters can be assigned. In addition, electric potentials and magnetic fields can be defined, so that applying a voltage to a door or placing a magnet in a certain position can be simulated. In general, it is preferred to make the three-dimensional model as detailed as possible and define as many physical parameters as possible, such as material properties. However, the more detailed the computer model is, the more difficult it is to process. Therefore, in practice, it is recommended to choose the level of detail according to the available computing power. By defining one or more variation parameters and specifying the corresponding range of one or more variation parameters, the software can be used to obtain the numerical value of the objective function. From the objective function, the value of the variation parameter to be used in the improved design can be obtained. In the simplest case, this is done by finding the minimum or maximum value of the objective function.
[0042] The output of the method may include information about, in particular, the expected performance, the design of logic blocks of conventional and / or quantum algorithms, the physical implementation of these blocks and potential overhead, in particular information about chip layout, control electronics, processes and control signals.
[0043] In addition to improving the design of the quantum computing element, the additional electronic devices may also be improved. The additional electronic devices may be connected to the quantum computing element to control the quantum computing element. The additional electronic devices may be configured as cryogenic electronic devices.
[0044] Typically, using the described approach, a combination of hardware and software can be used to solve the problem, since the hardware is specifically designed for the software to be used. Thus, a hybrid solution involving both hardware and software can be achieved. This can be achieved through co-design, which can involve chip layout, electronics, process, control, building block sets, and optional calibration and / or robustness capabilities.
[0045] In a preferred embodiment of the method, at least in an improved design, the building blocks are arranged into a plurality of groups, wherein each group is configured to execute a respective quantum sub-algorithm.
[0046] Grouping building blocks can facilitate finding improved designs. For example, for well-known quantum algorithms, corresponding groups can be defined. Such well-known quantum algorithms may include Grover's algorithm or Shore's algorithm. If the quantum algorithm to which the method is applied includes a sub-algorithm for which a set of building blocks has been defined, the group can be used in the improved design to replace the building blocks used in the initial design for the sub-algorithm. Each group of building blocks can be implemented on a corresponding portion of the surface of the quantum computing element. That is, in this embodiment, the optimized quantum algorithm has at least one designated area in which the corresponding sub-algorithm can be executed. Preferably, each group is configured to execute a different quantum sub-algorithm.
[0047] In the example, the method can be performed using the following steps:
[0048] i) identify the specific problem to be solved,
[0049] ii) choose a quantum algorithm that is appropriate for the problem to be solved,
[0050] iii) Divide the quantum algorithm into sub-algorithms,
[0051] iv) designing a corresponding set of building blocks for each sub-algorithm,
[0052] v) optionally optimizing the group of building blocks,
[0053] vi) optimizing the entire building block at least by determining the interconnections between groups of the building block,
[0054] vii) optimizing the interconnections between groups of building blocks,
[0055] Therein steps i) to vii) are iterated until the desired target criteria are met.
[0056] Often, it is found to be advantageous to group the building blocks, where each group is configured for a certain sub-algorithm.
[0057] In another preferred embodiment of the method, in an initial design the building blocks are arranged into a plurality of groups, wherein each group is configured to execute a respective quantum sub-algorithm, and wherein in step d) it is determined how to interconnect the individual groups to each other to obtain an improved design.
[0058] In this embodiment, the building blocks have been grouped in an initial design. The initial design does not necessarily have to be able to execute a quantum algorithm. By determining the interconnections between the groups, an improved design can be obtained. With these interconnections, the improved design is able to execute a quantum algorithm.
[0059] The way in which the groups of building blocks are connected to each other can be reflected using one or more variation parameters. Thus, by varying the variation parameters within given limits, various different ways in which the groups of building blocks are connected to each other can be compared. Thus, an improved design can be found.
[0060] The interconnection can be realized in the form of shuttle channels.
[0061] In another preferred embodiment of the method, the initial design provided in step b) is a generic design, wherein the shuttle channels form a network with a plurality of identical network units.
[0062] In this embodiment, the method starts with a general design. That is, the effort in step b) is as low as possible. For this purpose, an improved design can be found in a particularly systematic manner.
[0063] In a general initial design, the shuttle channel network is preferably configured to have a pattern that repeats itself. Preferably, the shuttle channel network is configured as a grid. Adjacent rows of the grid are preferably offset from each other so that the grid contains only T-junctions and not X-junctions, which would be more difficult to achieve. However, the network unit does not necessarily have to have a rectangular shape. The network unit may also have, for example, a hexagonal shape.
[0064] In a common initial design, the shuttle channel network has a plurality of network units. Each network unit has the same shuttle channel and building block arrangement. Preferably, each network unit includes a corresponding manipulation area as a building block.
[0065] The network cells are identical to each other. That is, each network cell has the same arrangement of shuttle channels and building blocks. Therefore, the network cells can be considered as copies of the unitary cell. The copies of the unitary cell can be arranged next to each other in rows and columns. In this way, a two-dimensional network of shuttle channels can be obtained. At its edges, the network may deviate from the described structure based on the unit cell. That is, at its edges, the network may have incomplete copies of the unitary cell or only have shuttle channels that are not part of the copies of the unit cell.
[0066] In addition to the same network unit, the network may also have other elements. For example, the network unit does not include any loading terminal and / or any readout terminal, while the network includes one or more loading terminals and / or one or more readout terminals, which is possible, and therefore includes other elements in addition to the same network unit. It is sufficient for the network to have only a single loading terminal and a single readout terminal. A small number of loading terminals and readout terminals can facilitate manufacturing. In addition, spacing the loading terminals and readout terminals from the qubits during operation can improve performance. However, providing more loading terminals and readout terminals can improve loading and readout efficiency and reduce the distance that the qubits must travel. In view of this, it is reasonable to find that the network has one loading terminal for every 5 to 20 junctions and / or one readout terminal for every 5 to 20 junctions. This is a reasonable definition because the number of junctions is a measure of the number of copies of the unit cell. The junction can be in particular a T-junction or an X-junction. A T-junction counts as one junction, and an X-junction counts as one junction. However, if an X-junction is realized by a pair of T-junctions, such an X-junction counts as two junctions. However, it is also conceivable that each copy of the unit cell includes a corresponding load terminal. In any case, it is sufficient if each copy of the unit cell has at most one load terminal.
[0067] It is particularly preferred to have as few loading terminals and readout terminals as possible. This is because both the loading terminals and the readout terminals cause heat to enter the quantum computing element, which reduces the coherence time of the qubits. Ideally, the quantum computing element has only one loading and readout terminal for loading and reading out all qubits. However, it is already advantageous if the number of loading terminals, the number of readout terminals and the sum of the number of loading and readout terminals are smaller than the number of network units, in particular at least 10 times smaller, more particularly even at least 100 times smaller. Since the number of junctions is a measure of the number of network units, it is preferred that the number of loading terminals, the number of readout terminals and the sum of the number of loading and readout terminals are smaller than the number of junctions, in particular at least 10 times smaller, more particularly even at least 100 times smaller.
[0068] It is conceivable that the number of load terminals is equal to the number of read terminals. For example, the ratio of the number of load terminals to the number of read terminals may be in the range of 0.5 to 2. However, it is also conceivable that each copy of the unit cell includes a corresponding read terminal. In any case, it is sufficient if each copy of the unit cell has at most one read terminal.
[0069] In another preferred embodiment of the method, the improved design in step d) is obtained from the initial design by omitting at least one part of the initial design.
[0070] In this embodiment, the improved design has a smaller number of building blocks. This can facilitate manufacturing and reduce costs. In addition, having fewer building blocks on a quantum computing element can reduce the risk of errors. This is due to the fact that densely packed building blocks are more likely to have defects and are more susceptible to crosstalk.
[0071] It is particularly preferred to start from the above-described general initial design and obtain an improved design by omitting at least one building block of the initial design.
[0072] In a further preferred embodiment of the method, in step d) it is evaluated for each building block whether the respective building block is necessary.
[0073] Reducing the number of building blocks can be achieved by determining whether each building block is necessary. For example, using a mathematical model of the initial design, one can count for each building block how many times the corresponding building block is used in the quantum algorithm. Candidates for improved designs can be obtained from the initial design by omitting the building blocks that are typically least used. Instead of using that building block, the improved design can be configured so that a different building block is used an additional number of times.
[0074] In another preferred embodiment of the method, in step d), the arrangement of the building blocks is modified according to the initial design to obtain an improved design.
[0075] In this embodiment, the building blocks of the improved design are arranged so that the qubits must travel a shorter distance than in the initial design. This can be achieved by calculating the shuttling distance of the initial design and comparing it to various candidates for the improved design.
[0076] The arrangement of building blocks can be expressed as variation parameters. For example, the position of a certain building block can be described by two coordinates, which can be used as variation parameters. By varying these variation parameters within given limits, an improved design can be found, where the building blocks are usually arranged in different positions than in the initial design.
[0077] In another preferred embodiment of the method, step d) comprises optimization.
[0078] Varying the variation parameters within given limits provides various result values. Ideally, the values of one or more variation parameters corresponding to the best result values are selected to determine the improved design. This is what is done in the present embodiment. However, once one or more values of one or more variation parameters corresponding to result values that are better than the initial design are selected, the design has been improved over the initial design. That is, in alternative step d), no optimization is involved, but only improvement.
[0079] In another preferred embodiment of the method, initial instructions for operating the quantum computing element are further provided in step b), wherein improved instructions for operating the quantum computing element are further obtained in step d).
[0080] The instructions for operating a quantum computing element may include information about the shuttle path of at least one qubit. That is, using the method it is possible to determine how the qubit should be shuttled along the shuttle channel. Improvements may be achieved, for example, by reducing the shuttle distance.
[0081] The instructions are preferably expressed in terms of varying parameters. For example, an applied voltage may be used as a varying parameter. In addition, the path of a qubit may be expressed in terms of varying parameters, for example, the position of a qubit may be expressed in terms of two coordinates at each time point within a certain time period.
[0082] In an example, an instruction can be improved in which the shuttle direction of a qubit is reversed several times so that the qubit passes through the manipulation region several times. The configuration of a quantum computing element with a shuttle channel is particularly suitable for such an improvement. Among them, static parameters and dynamic parameters can be improved.
[0083] In another preferred embodiment of the method, the building blocks include a loading terminal, a manipulation region, a readout terminal, and a junction of a shuttling channel.
[0084] As another aspect of the present invention, a quantum computing element designed for a specific quantum algorithm is proposed, which includes a plurality of shuttle channels, the shuttle channels having a plurality of building blocks arranged into a plurality of groups, wherein each group is configured to execute a corresponding quantum sub-algorithm, and wherein the groups of building blocks are interconnected so that the quantum sub-algorithms together constitute a quantum algorithm.
[0085] The advantages and features of the method are transferable to a quantum computing element and vice versa. A quantum computing element is preferably obtained using the method.
[0086] In a preferred embodiment of the quantum computing element, the quantum sub-algorithms differ from each other.
[0087] As another aspect of the present invention, a device is proposed, which includes a quantum computing element configured as described and a conventional computer hardware element connected to the quantum computing element.
[0088] Advantages and features of the method and quantum computing element are transferable to the device, and vice versa.
[0089] The invention will now be described with reference to the accompanying drawings. The drawings show preferred embodiments, but the invention is not limited thereto. The drawings and the dimensions shown therein are only schematic. The drawings show:
[0090] Figure 1a : Initial design of quantum computing components,
[0091] Figure 1b : an improved design of a quantum computing element, the improved design being obtained from an initial design by a method according to the invention,
[0092] Figure 1c : Description of an alternative method of obtaining an improved design by the method according to the invention,
[0093] Figure 2 : According to the device of the present invention,
[0094] Figure 3 : Figure 1a and Figure 1b The quantum computing element is part of the shuttle channel,
[0095] Figure 4 : Figure 3 The cross section of the shuttle channel,
[0096] Figure 5 : Figure 1a and Figure 1b The T-junction of the quantum computing element,
[0097] Figure 6 : Figure 5A cross section of a T-junction, where the sequence shows the potential development within the T-junction,
[0098] Figure 7 : Figure 1a and Figure 1b The manipulation area of the quantum computing element,
[0099] Figure 8 : Figure 7 A cross section of the manipulation region of FIG. 1 , wherein the sequence shows the potential development in the manipulation region during single-qubit operation,
[0100] Fig. 9 : Figure 7 A cross section of the manipulation region, where the sequence shows the potential development in the manipulation region during a two-qubit operation,
[0101] Fig.10 : Figure 1a and Figure 1b The loading terminal of the quantum computing element,
[0102] Fig.11 : Fig.10 A cross section of a loading terminal, wherein the sequence shows the development of the potential within the loading terminal during loading,
[0103] Fig.12 : Figure 1a and Figure 1b The readout terminal of the quantum computing element,
[0104] Fig.13 : Fig.12 Cross-section of a readout terminal, where the sequence shows the development of the potential within the readout terminal during readout.
[0105] Figure 1a An initial design of a quantum computing element 1 is shown. The quantum computing element 1 has a network 2 of shuttle channels 4, which network 2 of shuttle channels 4 has four network units 3. The network 2 is implemented on a surface 19 of a substrate 10. The extension of the network unit 3 is in the order of 10 μm [micrometers]. The shuttle channels 4 are interconnected by junctions 5. Each network unit 3 has a corresponding loading terminal 6, a corresponding manipulation area 7 and a corresponding readout terminal 8. The junctions 5, the loading terminals 6, the manipulation areas 7 and the readout terminals 8 constitute a building block 13. The quantum computing element 1 is configured for a method, which comprises, respectively, for a plurality of spin qubits 9 (indicated only by the reference numerals assigned to the shuttle channels 4, since the qubits 9 can be at any position in the shuttle channels 4):
[0106] A) initializing the qubit 9 by loading the corresponding electron or hole into the network 2 of the shuttle channel 4 using one of the loading terminals 6,
[0107] B) manipulating a qubit 9 in at least one manipulation region 7,
[0108] C) Reading out the qubit 9 using one of the readout terminals 8 .
[0109] Steps A) to C) may be performed simultaneously for at least some of the qubits 9. In particular, the method may comprise a plurality of adjacent time intervals, wherein in each time interval steps A) to C) are performed for a corresponding group of qubits 9.
[0110] The qubits 9 may be manipulated in various ways in the respective manipulation regions 7. For example, at least some of the qubits 9 may be shuttled through the respective manipulation regions 7 at which they were manipulated in step b), and / or at least some of the qubits 9 may have a shuttling direction that is reversed at the respective manipulation regions 7 at which they were manipulated in step b).
[0111] Some or all qubits 9 may be manipulated successively in a plurality of manipulation regions 7. The qubits 9 are shuttled between the manipulation regions 7. For at least some qubits 9, the manipulation in the respective step b) may be entanglement with at least one further qubit 9.
[0112] This method can be an implementation of the surface code.
[0113] Figure 1b The design of a quantum computing element 1 is shown. Figure 1a To this end, Figure 1b Results of a method of designing a quantum computing element 1 for executing a quantum algorithm are shown, wherein the quantum computing element 1 is configured to operate using a plurality of spin qubits 9 and has a plurality of shuttle channels 4 having a plurality of building blocks 13, and wherein the method comprises:
[0114] a) providing a corresponding mathematical model for each building block 13,
[0115] b) According to Figure 1a providing an initial design of a quantum computing element 1,
[0116] c) creating a mathematical model of the initial design by combining the mathematical models of the building blocks 13 according to the initial design,
[0117] d) Obtaining an improved design of the quantum computing element 1 using the mathematical model of the initial design created in step c) and taking into account the quantum algorithm to be executed by the quantum computing element 1 .
[0118] Figure 1bThe improved design shown in differs from the initial design in that one loading terminal 6 and one readout terminal 8 are omitted, and some of the shuttle channels 4 have been expanded. These differences should only be used to exemplify how the improved design differs from the initial design. Depending on the actual quantum algorithm, various other differences between the initial design and the improved design may constitute an improvement from the initial design to the improved design.
[0119] Figure 1c Another method of how to obtain an improved design is shown. Therein, the initial design comprises two groups 14 of building blocks 13 (not shown in detail here). Each group 14 is configured to execute a corresponding quantum sub-algorithm. The improved design is obtained by determining how the groups 14 should be connected to each other. This is shown by the dotted arrows.
[0120] Figure 2 An apparatus 11 is shown comprising a quantum computing element 1 designed for a particular quantum algorithm, the quantum computing element 1 comprising a plurality of shuttle channels 4 having a plurality of building blocks 13 arranged in a plurality of groups 14, wherein each group 14 is configured to execute a corresponding quantum sub-algorithm, and wherein the groups 14 of building blocks 13 are interconnected such that the quantum sub-algorithms together constitute the quantum algorithm. The quantum computing element 1 may be as Figure 1b Furthermore, the device 11 includes conventional computing hardware elements 12 .
[0121] Figure 3 and Figure 4 Shows how this can be achieved Figure 1a and Figure 1b The shuttle channel 4 of the quantum computing element 1. Therefore, Figure 3 Schematically shows Figure 1a and Figure 1b FIG. 1 is a top view of a portion of a semiconductor substrate 10 of a quantum computing element 1. Figure 3 The portion of the semiconductor substrate 10 shown in FIG. 1 comprises one of the shuttle channels 4 extending between the first side 100 and the second side 101. Thus, three layers of gate electrode arrays 102, 103, 104 are provided, which are separated from each other by insulating layers 108, 109. One or more voltage sources (not shown) may be used to apply corresponding voltages to the gate electrode arrays 102, 103, 104. Thus, the gate electrode arrays 102, 103, 104 have corresponding electrical terminals 105, 106, 107.
[0122] The first gate electrode array 102 is located on the surface 19 of the substrate 10. Behind the first gate electrode array 102 is an insulating layer 108, on which the second gate electrode array 103 is arranged. An insulating layer 109 is arranged on top of the second gate electrode array 103, and the insulating layer 109 electrically isolates the second gate electrode array 103 from the third and uppermost gate electrode array 104.
[0123] Figure 4 Shows Figure 3 1 is a cross-section of a portion of the substrate 10 shown in . Therein, the gate electrode 115 of the first gate electrode array 102 can be seen. The gate electrode 115 extends longitudinally on the surface 19 of the substrate 10 and is separated from the second gate electrode array 103 by the first insulating layer 108. The electrode fingers 110, 111 of the second gate electrode array 103 are partially shown. The second gate electrode array 103 is separated from the third gate electrode array 104 by the second insulating layer 109. Only the electrode fingers 112, 113 of the third gate electrode array 104 are shown. In this view, it can be clearly seen how the electrode fingers 110, 111, 112, 113 alternate.
[0124] A potential well 116 is created by applying a sinusoidal voltage to the gate electrode array 102, 103, 104. A quantum dot 117 trapped in this potential well 116 can move through the substrate 10. The potential well 116 is moved longitudinally through the substrate 10 by driving the electrode fingers 110, 111, 112, 113 with a sinusoidal voltage without changing the quantum mechanical properties of the quantum dot 117. The movement of the quantum dot 117 in the direction of the arrow 118 is indicated by the dashed line 119. The quantum mechanical state is indicated by the small arrow 114 of the quantum dot 117.
[0125] Voltage is applied to the gate electrode arrays 102, 103, 104 so that the electrode fingers 110, 111, 112, 113 form a movable potential well 116 in the substrate 10. By controlling the gate electrode arrays 102, 103, 104, the potential well 116 can be moved through the substrate 10 along the shuttle channel 4. The second gate electrode array 103 and the third gate electrode array 104 are provided with a sinusoidal voltage.
[0126] Figure 5 and Figure 6 Shows Figure 1a and Figure 1b How can the junction 5 of the quantum computing element 1 be realized? Figure 5 Shows Figure 1a and Figure 1b A portion of a semiconductor substrate 10 of a quantum computing element 1. Figure 5 The portion of the semiconductor substrate 10 shown in FIG. 1 includes one of the T-junctions 5 .
[0127] The quantum computing device 1 is configured such that a two-dimensional electron gas (2DEG) is contained within a substrate 10. Gate electrode arrays 201, 202, 203 are disposed on a surface 19 of the substrate 10. The gate electrode arrays 201, 202, 203 help define the shuttle channel 4 because the gate electrode arrays 201, 202, 203 manipulate the potential within the substrate 10 so that electrons of the 2DEG can move in a controlled manner.
[0128] The gate electrode arrays 201, 202, 203 each include two corresponding gate electrodes 204, 205, 206, 207. The gate electrodes 204, 205, 206, 207 are electrically separated from each other by an insulating layer 208. To this end, the gate electrode arrays 201, 202, 203 are constructed in the form of layers, and the insulating layer 208 is arranged between the gate electrodes 204, 205, 206, 207. The gate electrodes 204, 205, 206, 207 also include electrode fingers 209, 210, 211, 212. The electrode fingers 209, 210, 211, 212 of a certain gate electrode 204, 205, 206, 207 are arranged parallel to each other on the surface 19 of the substrate 10.
[0129] The gate electrode arrays 201, 202, 203 can be supplied with voltage via electrical connections (not shown in detail). By applying a sinusoidal voltage to the gate electrodes 204, 205, 206, 207 of the gate electrode arrays 201, 202, a potential well can be generated in the substrate 10. Thus, quantum dots trapped in the potential well can move through the substrate 10. By applying a sinusoidal voltage to the electrode fingers 209, 210, 211, 212, the potential well can be moved longitudinally through the substrate 10.
[0130] In a quantum dot, a single electron can be trapped. If the quantum dot is moved, the electron will move with it. The spin of this trapped electron can be used as a spin qubit 9. For this purpose, the qubit 9 can be shuttled through a shuttle channel 4 with a junction 5. Therein, the electron moves together with the quantum dot in which the electron is trapped. The process is continuous because the electron stays in the same quantum dot throughout the journey through the junction 5. The electron does not have to tunnel into a different quantum dot to change direction at the junction 5.
[0131] The gate electrode array 202 branches from the gate electrode array 201 in the intersection region 213. The gate electrode arrangement 203 is arranged in the intersection region 213. The gate electrode array 203 includes two barrier gate electrodes 214, 215. When the moving potential well with quantum dots is located in the intersection region 213, the barrier gate electrodes 214, 215 can be turned on. By turning on the barrier gate electrodes 214, 215, the potential well with quantum dots is maintained in the intersection region 213. The pump gate electrode 216 of the gate electrode array 203 can cause the potential well with quantum dots to change direction toward the gate electrode array 202.
[0132] Assuming that the potential well with the quantum dot does not change direction, the barrier gate electrode 217 of the gate electrode array 203 is activated. The other two barrier gate electrodes 214, 215 are turned off. Therefore, the barrier gate electrode 217 blocks access to the gate electrode array 202. Therefore, there is no reason for the quantum dot in the mobile potential well to change direction. For this reason, a T-junction 5 is realized through which the qubit 9 can move. Depending on the applied voltage, it can be determined through which branch of the junction 5 the qubit 9 leaves the junction 5.
[0133] Figure 6 Shows Figure 5 1 is a cross section of a portion of a semiconductor substrate 10. For clarity, only electrode fingers 211, 212, barrier gate electrode 217 and pump gate electrode 216 are shown. A sequence A to C is shown below, which illustrates the movement of a potential well 218 with a quantum dot 219.
[0134] The electrode fingers 211, 212 of the gate electrode array 202 form a moving potential well 218. The movement of the potential well 218 is achieved by interconnecting the electrode fingers 211, 212. To this end, the electrode fingers 211, 212 of the gate electrode array 201 are periodically interconnected in an alternating manner, which causes the potential well 218 to move almost continuously through the substrate 10. Figure 6 2, it is shown how a potential well 218 with a quantum dot 219 branches out from the intersection region 213. The moving potential well 218 is located in the direction of the gate electrode array 202. An arrow 220 indicates the moving direction 219 of the potential well 218 with the quantum dot.
[0135] exist Figure 7 It is shown in Figure 1a and Figure 1b The gate electrode arrays 300, 301, 314 are arranged on the surface 19 of the substrate 10. The gate electrode arrays 300, 301 each include two gate electrodes 302, 303, 304, 305. The respective gate electrodes 302, 303, 304, 305 are electrically isolated from each other by an insulating layer 306. The gate electrode arrays 300, 301 are provided in the form of layers, wherein an insulating layer 306 is provided between each gate electrode 302, 303, 304, 305 of the gate electrode arrays 300, 301. The gate electrodes 302, 303, 304, 305 also include electrode fingers 307, 308, 309, 310 arranged parallel to each other on the surface 19 of the substrate 10.
[0136] The manipulation region 7 is formed in a region 311 in which the gate electrode arrays 300, 301 are adjacent to each other. A manipulator 313 including a gate electrode array 314 is located in the manipulation region 7. The gate electrode array 314 includes barrier gate electrodes 315, 316, 317 forming at least one static potential well. The gate electrode array 314 also includes pump gate electrodes 318, 319, each of which can cause the quantum dots or charge carriers to move or oscillate.
[0137] Voltage is applied to the gate electrode arrays 300, 301, 314 through electrical connections. By applying a sinusoidal voltage to the gate electrodes 302, 303, 304, 305 of the gate electrode arrays 300, 301, a potential well is created in the substrate 10. Quantum dots or charge carriers trapped in this potential well can move through the substrate 10. By appropriately driving the electrode fingers 307, 308, 309, 310 with a sinusoidal voltage, the potential well moves longitudinally through the substrate 10.
[0138] Figure 8 The sequence of manipulating the charge carriers in the quantum dots 320, 321 in the manipulation region 7 for single qubit operation is shown. Therefore, a cross-sectional view of the manipulation region 7 is shown, in which only the electrode fingers 307, 308, 309, 310, the barrier gate electrodes 315, 316, 317 and the pump gate electrodes 318, 319 are shown. Below is the sequence A to F of the propagation of the potential wells 322, 323 in the substrate 10. Although Figure 8 A single qubit operation is shown, but two quantum dots 320, 321 are shown trapped in quantum wells 322, 323. The single qubit operation is performed using quantum dot 321 within the manipulation region 7, while the other quantum dot 320 "wait" outside the manipulation region 7. This is useful because after the single qubit operation, a two qubit operation involving the two quantum dots 320, 321 can be performed.
[0139] The electrode fingers 307, 30, 32, 34 of the gate electrode arrays 300, 301 form potential wells 322 and 323. The movement of the potential wells 322, 323 is achieved by appropriately interconnecting the electrode fingers 307, 308, 309, 310. To this end, the electrode fingers 307, 308, 309, 310 of the gate electrode arrays 300, 301 are periodically interconnected in an alternating manner, which results in the potential wells 322, 323 moving almost continuously through the substrate 10.
[0140] A static double well 324 is formed in the manipulation region 7. The static double well 324 is created by barrier gate electrodes 315, 316, 317. First, the quantum dot 321 is brought into the static double potential well 324 in the manipulation region 7 together with the movable potential well 323. This is indicated by a horizontal arrow 325. The manipulator 313, such as a gradient magnetic field, allows the quantum dot 321 to assume a defined quantum mechanical state. Another quantum dot 320 is waiting outside the manipulation region 7. By moving in the magnetic field gradient of the manipulator 313, the defined quantum state of the quantum dot 321 is achieved. Now, the quantum dot 321 can assume a defined quantum state by delocalizing in the double well (E) or moving quickly back and forth in the magnetic field gradient (F). When guided out of the manipulation region 7, the quantum dot 321 therefore has a defined quantum mechanical state.
[0141] Fig. 9 The sequence of manipulation in the manipulation region 7 of the two-qubit operation is shown. In which, a static double well 324 is formed in the manipulation region 7 by barrier gate electrodes 315, 316, 317, and quantum dots 320, 321 are moved to the static double potential well 324 in the manipulation region 7 by movable potential wells 322, 323, and are each introduced into the double potential well 324. The manipulator 313, such as a gradient magnetic field, allows the quantum dots 320, 321 to assume a defined quantum mechanical state. Two-qubit operations can be performed between the quantum dots 320, 321 through exchange interaction, as indicated by the horizontal double arrow 326. Therefore, the quantum dots 320, 321 that move out of the manipulation region 312 obtain a defined quantum mechanical state.
[0142] exist Fig.10 It is shown in Figure 1a and Figure 1b The gate electrode array 400 and 401 are arranged on the surface 19 of the substrate 10. The gate electrode array 400 has two gate electrodes 402 and 403. The respective gate electrodes 402 and 403 are electrically isolated from each other by an insulating layer 404. To this end, the gate electrodes 402 and 403 of the gate electrode array 400 are provided in the form of a layer, and the insulating layer 404 is arranged between each gate electrode 402 and 403 of the gate electrode array 400. The gate electrodes 402 and 403 also include electrode fingers 405 and 406 arranged parallel to each other on the surface 19 of the substrate 10.
[0143] Voltage is applied to the gate electrode arrays 400, 401 through electrical connections. By applying a sinusoidal voltage to the gate electrodes 402, 403 of the gate electrode array 400, a movable potential well is created in the substrate 10. Thus, quantum dots 408 or charge carriers trapped in the potential well can move through the substrate 10. By driving the electrode fingers 405, 406 of the gate electrodes 402, 403 with a sinusoidal voltage, the potential well moves longitudinally through the substrate 10.
[0144] The gate electrode array 401 forms a static double potential well. To this end, the gate electrode array 401 includes barrier gate electrodes 410, 412, 414, a pump gate electrode 416 and another pump gate electrode 418, which can make the quantum dots or charge carriers move or oscillate. The pump gate electrodes 416, 418 are alternately arranged between the barrier gate electrodes 410, 412 and 414. The gate electrodes 410, 412, 414, 416, 418 each have an electrode finger 411, 413, 415, 417, 419 (in Fig.11 Connected to the barrier gate electrodes 410, 412, 414 of the gate electrode array 401 is a storage 422 for introducing a charge change.
[0145] Fig.11 A sequence A to F of charging charge carriers is shown. The electrode fingers 405, 406 of the gate electrode array 400 form a potential well 407, which can move through the substrate 10. The movement of the potential well 407 is thereby achieved by appropriate interconnection of the electrode fingers 405, 406. To this end, the electrode fingers 405, 406 of the gate electrode array 400 are interconnected periodically in an alternating manner, which results in an almost continuous movement of the potential well 407 through the substrate 10.
[0146] The loading terminal 6 is based on the Pauli principle, according to which an electron energy level is never occupied by electrons of the same spin. On the one hand, a static double potential well 409 is generated by gate electrodes 410, 412, 414 and 416, 418, and on the other hand, a movable potential well 407 is generated by gate electrodes 402, 403. Two charge carriers 421 from a reservoir 422 are introduced into a first potential well 420 in the static double potential well 409. The charge carriers 421 are separated and aligned with an actuator 424, for example using a gradient magnetic field and pump gate electrodes 416, 418. The separated charge carriers 423 tunnel into the second static potential well 425 of the double potential well 409, which is indicated by arrows 426. Only one charge carrier 427 remains in the first static potential well 420. The quantum states of the quantum dots 423, 427 in the potential wells 420, 421 can be known by the orientation of the applied gradient magnetic field.
[0147] Through the movable potential well 407, another quantum dot 408 is brought to the second static potential well 425 in the double potential well 409 at the same energy level. The quantum mechanical state of the quantum dot 408 is unknown. Arrow 428 indicates the translation direction of the quantum dot 408 along the moving potential well 407. Through the tunneling effect, the quantum dot 423 of the second static potential well 425 is exchanged with the quantum dot 408 of the moving potential well 407. The known quantum mechanical state of the quantum dot 423 is now located in the moving potential well 407 and initializes, for example, a qubit.
[0148] If the quantum dot 408 has the same spin as the quantum dot 423 that has now moved away to initialize, the quantum dot 408 tunnels back into the first static potential well 420 in the double potential well 409. Therefore, the sensor element not shown here does not detect any charge change. If the quantum mechanical states of the quantum dots 423 and 408 are different, a charge change can be detected. The exchange by tunneling is represented by arrow 429.
[0149] exist Fig.12 It is shown in Figure 1a and Figure 1b The readout terminal 8 of the quantum computing element 1 is shown. Therein, gate electrode arrays 500, 501 are shown, each of which includes two gate electrodes 502, 503. The respective gate electrodes 502, 503 are electrically isolated from each other by an insulating layer 504. To this end, the gate electrode arrays 500, 501 are provided in the form of layers, and the insulating layer 504 is arranged between each gate electrode 502, 503. The gate electrodes 502, 503 also include electrode fingers 505, 506 arranged parallel to each other on the surface 19 of the substrate 10.
[0150] A suitable voltage is applied to the gate electrode arrays 500, 501 through electrical connections. By applying a sinusoidal voltage to the gate electrodes 502, 503 of the gate electrode array 500, a potential well is formed in the substrate 10. Thus, quantum dots or charge carriers trapped in the potential well can move through the substrate 10. By driving the electrode fingers 505, 506 with a sinusoidal voltage, the potential well moves longitudinally through the substrate 10.
[0151] The gate electrode array 500 forms an area in which the quantum dots can move through the potential well. In contrast, the gate electrode array 501 forms a static potential well. To this end, the gate electrode array 501 includes barrier gate electrodes 507, 508 and pump gate electrodes 509, which can make the quantum dots or charge carriers move or oscillate. The pump gate electrode 509 is arranged between the barrier gate electrodes 507, 508. The gate electrodes 507, 508 and 509 are also each separated by an insulating layer 504.
[0152] Connected to the barrier gate electrode array 501 is a sensor element 510 for detecting charge changes. The sensor element 510 detects the charge present in the static potential well. The potential well is generated by the gate electrode array 501.
[0153] Fig.13 A sequence for reading out the quantum state of a qubit in a quantum dot 513 is shown. The figure shows the readout terminal 8 in a simplified manner so that only the electrode fingers 505, 506, the barrier gate electrodes 507, 508 and the pump gate electrode 509 are visible. A sequence from A to C of the routes of the potential wells 515, 516 is shown below. The electrode fingers 505, 506 of the gate electrode array 500 form a mobile potential well 515. Thus, the movement of the quantum dot 513 in the potential well 515 is achieved by suitable interconnection of the electrode fingers 505, 506. To this end, the electrode fingers 505, 506 of the gate electrode array 500 are periodically interconnected in an alternating manner, which causes the quantum dot 513 in the potential well 515 to move almost continuously through the substrate 10.
[0154] The readout terminal is based on the Pauli principle. On the one hand, a static potential well 516 is generated with the help of gate electrodes 507, 508, and on the other hand, a movable potential well 515 is generated with the help of gate electrodes 505, 506. A quantum dot 513 is introduced into the static potential well 516, and the quantum mechanical state of the quantum dot 513 at an energy level (spin in the case of electrons) is known. The quantum dot 513 is aligned with the pump gate electrode 508, for example, with the spin up, as shown in the figure. With the help of the movable potential well 515, another quantum dot 514 is brought to the static potential well 516 at the same energy level. Arrow 517 indicates the direction of movement of the quantum dot 514 with the movable potential well 515. If the quantum mechanical states are different, the energy level is now filled. The filling can be done by tunneling, represented by arrow 518.
[0155] With the addition of the quantum dot, the sensor element 510 detects a change in charge at this energy level. If the quantum mechanical states of the quantum dots 513, 514 are the same, this energy level cannot accept another charge carrier. Therefore, the quantum mechanical state does not change at this energy level. Therefore, it is possible to determine which quantum mechanical state the approaching quantum dot 513 has.
[0156] Reference numerals list
[0157] 1 quantum computing element 112 electrode fingers (third layer)
[0158] 2 network 113 electrode finger (third layer)
[0159] 3 Network Unit 114 Arrow
[0160] 4 Shuttle channel 115 gate electrode (first layer)
[0161] 5 junctions 116 potential wells
[0162] 6 loading terminals 117 quantum dots
[0163] 7 Operation area 118 Arrow direction
[0164] 8 Readout terminal 119 dotted line
[0165] 9-spin qubit
[0166] 10 substrate 201 gate electrode array
[0167] 11 device 202 gate electrode array
[0168] 12 Conventional Computer 203 Gate Electrode Array
[0169] Hardware component 204 gate electrode
[0170] 13 building blocks 205 gate electrode
[0171] 14 groups of 206 gate electrodes
[0172] 19 surface 207 gate electrode
[0173] 208 insulation layer
[0174] 100 first side 209 electrode finger
[0175] 101 second side 210 electrode finger
[0176] 102 first gate electrode array 211 electrode finger
[0177] 103 second gate electrode array 212 electrode fingers
[0178] 104 The third gate electrode array 213 cross region
[0179] 105 electrical terminal 214 barrier gate electrode
[0180] 106 electrical terminal 215 barrier gate electrode
[0181] 107 electrical terminal 216 pump gate electrode
[0182] 108 first isolation layer 217 barrier gate electrode
[0183] 109 second isolation layer 218 mobile potential well
[0184] 110 electrode fingers (second layer) 219 quantum dots
[0185] 111 electrode finger (second layer) 220 arrow
[0186] 405 electrode finger
[0187] 300 gate electrode array 406 electrode fingers
[0188] 301 gate electrode array 407 potential well
[0189] 302 gate electrode 408 quantum dot
[0190] 303 gate electrode 409 static double potential well
[0191] 304 gate electrode 410 barrier gate electrode
[0192] 305 gate electrode 411 electrode finger
[0193] 306 insulating layer 412 barrier gate electrode
[0194] 307 electrode fingers 413 electrode fingers
[0195] 308 electrode finger 414 barrier gate electrode
[0196] 309 electrode fingers 415 electrode fingers
[0197] 310 electrode finger 416 pump gate electrode
[0198] 311 area 417 electrode fingers
[0199] 313 manipulator 418 pump gate electrode
[0200] 314 gate electrode array 419 electrode finger
[0201] 315 potential barrier gate electrode 420 first static potential well
[0202] 316 barrier gate electrode 421 charge carrier
[0203] 317 barrier gate electrode 422 storage
[0204] 318 Pump gate electrode 423 Separated quantum dots
[0205] 319 pump gate electrode 424 actuator
[0206] 320 quantum dots 425 second static potential well
[0207] 321 quantum dots 426 arrows (tunneling)
[0208] 322 mobile potential well 427 remaining quantum dots
[0209] 323 moving potential well 428 arrow (translation)
[0210] 324 static double well 429 arrows (exchange interaction)
[0211] 325 horizontal arrow
[0212] 326 horizontal double arrows 500 gate electrode array
[0213] 400 gate electrode array 501 gate electrode array
[0214] 401 gate electrode array 502 gate electrode
[0215] 402 gate electrode 503 gate electrode
[0216] 403 gate electrode 504 insulation layer
[0217] 404 insulation layer 505 electrode finger
[0218] 506 electrodes refer to 514 quantum dots
[0219] 507 potential barrier gate electrode 515 moving potential well
[0220] 508 potential barrier gate electrode 516 static potential well
[0221] 508 pump gate electrode 517 arrow (translation)
[0222] 510 sensor element 518 arrow (tunneling)
[0223] 513 quantum dots.
Claims
1. A method for designing a quantum computing element (1) for executing a quantum algorithm, wherein the quantum computing element (1) is configured to operate with a plurality of spin qubits (9) and has a plurality of shuttle channels (4), the shuttle channels (4) having a plurality of building blocks (13), and wherein the method comprises: a) providing a corresponding mathematical model for each of the building blocks (13), b) providing an initial design of the quantum computing element (1), c) creating a mathematical model of said initial design by combining said mathematical models of said building blocks (13) according to said initial design, d) obtaining an improved design of the quantum computing element (1) using the mathematical model of the initial design created in step c) and taking into account the quantum algorithm to be executed by the quantum computing element (1).
2. The method according to claim 1, wherein at least in the improved design, the building blocks (13) are arranged into groups (14), and wherein each of the groups (14) is configured to execute a corresponding quantum sub-algorithm.
3. The method according to any of the preceding claims, wherein in the initial design the building blocks (13) are arranged into groups (14), wherein each of the groups (14) is configured to execute a respective quantum sub-algorithm, and wherein in step d) it is determined how to connect the groups (14) to each other to obtain the improved design.
4. The method according to any of the preceding claims, wherein the initial design provided in step b) is a generic design, wherein the shuttle channels (4) form a network (2) with a plurality of identical network units (3).
5. The method according to claim 4, wherein the improved design in step d) is obtained from the initial design by omitting at least a part of the initial design.
6. The method according to any of the preceding claims, wherein in step d) it is evaluated for each of the building blocks (13) whether the respective building block (13) is necessary.
7. The method according to any of the preceding claims, wherein in step d) the arrangement of the building blocks (13) according to the initial design is modified to obtain the improved design.
8. The method according to any of the preceding claims, wherein step d) comprises optimization.
9. The method according to any of the preceding claims, wherein in step b) initial instructions for operating the quantum computing element (1) are further provided, and wherein in step d) improved instructions for operating the quantum computing element (1) are further obtained.
10. The method according to any of the preceding claims, wherein the building block (13) comprises a loading terminal (6), a manipulation area (7), a readout terminal (8) and a junction (5) of the shuttling channel (4).
11. A quantum computing element (1) designed for a specific quantum algorithm, comprising a plurality of shuttle channels (4), the shuttle channels (4) having a plurality of building blocks (13) arranged in groups (14), wherein each of the groups (14) is configured to execute a corresponding quantum sub-algorithm, and wherein the groups (14) of the building blocks (13) are interconnected so that the quantum sub-algorithms together constitute the quantum algorithm.
12. The quantum computing element (1) according to claim 11, wherein the quantum sub-algorithms are different from each other.
13. Apparatus (11) comprising a quantum computing element (1) according to claim 11 or 12 and a conventional computer hardware element (12) connected to the quantum computing element (1).
Citation Information
Patent Citations
Part having a band assembly for individual electron movement over a long distance
WO2021052531A1
Component for reading out the states of qubits in quantum dots
WO2021052536A1
Manipulation zone for qubits in quantum dots
WO2021052537A1
Component for initialising a quantum dot
WO2021052538A1
Connection component for a branch for individual electron motion
WO2021052539A1
