Neutral atom quantum circuit compiling method and system, electronic device, and storage medium

Abstract

This application relates to the field of quantum computing technology, and provides a method and system for compiling neutral atom quantum circuits, an electronic device, and a storage medium. The method includes: mapping the qubits of a preset quantum circuit to neutral atoms in a first optical tweezers array to obtain a two-qubit gate quantum circuit; constructing a two-qubit gate frequency map based on the two-qubit gate quantum circuit; segmenting the two-qubit gate frequency map to obtain at least one group of qubits; mapping the at least one group of qubits to another first optical tweezers array in a preset form to obtain a mapped qubit array; moving at least one qubit in the mapped qubit array to a second optical tweezers array; and moving at least one qubit within a preset position range of a target qubit based on the second optical tweezers array, so that at least one qubit and the target qubit perform a two-qubit gate. This application features low computational resources and short compilation time.

Description

Technical Field

[0001] This application relates to the field of quantum computing technology, and more specifically, to a method and system for compiling neutral atom quantum circuits, an electronic device, and a storage medium. Background Technology

[0002] Neutral atom quantum computing is a quantum computing technology that uses neutral atoms as its basic building blocks. Neutral atom quantum computing uses optical tweezers arrays and laser pulses to encode and manipulate qubits, offering advantages such as long qubit lifetime, controllable interactions, high parallelism, and scalability.

[0003] Neutral atom quantum computing uses neutral atoms bound in an array of optical tweezers as qubits. To enable the high-level algorithms (logic level) described by neutral atom quantum computing to execute on quantum devices (physical level), the neutral atom quantum circuits need to be compiled. This compilation allows the interacting qubits to be interconnected, thus enabling neutral atom quantum computing to meet the constraints of quantum devices.

[0004] Under the constraints of an optical tweezers array, neutral atoms bound in the array can move coherently, thereby allowing the connectivity between qubits to change in real time during quantum computing.

[0005] The inventors of this application have discovered that existing methods for compiling neutral atom quantum circuits suffer from both enormous computational resources and long compilation times. Therefore, developing a fast compilation method for a massive number of qubits based on the characteristics of neutral atom quantum computing systems (such as coherent shift) is of great significance for neutral atom quantum computing. Summary of the Invention

[0006] This application provides a neutral atom quantum circuit compilation method, system, electronic device, and storage medium to solve the problems of huge computational resources and long compilation time in current neutral atom quantum circuit compilation methods.

[0007] According to one aspect of this application, a method for compiling a neutral atom quantum circuit is provided, comprising: mapping the qubits of a preset quantum circuit to neutral atoms in a first optical tweezers array to obtain a two-qubit gate quantum circuit; constructing a two-qubit gate frequency map based on the two-qubit gate quantum circuit; dividing the two-qubit gate frequency map to obtain at least one group of qubits; mapping the at least one group of qubits to another first optical tweezers array in a preset form to obtain a mapped qubit array; moving at least one qubit in the mapped qubit array to a second optical tweezers array; and moving at least one qubit to a preset position range of a target qubit based on the second optical tweezers array, so that at least one qubit and the target qubit perform a two-qubit gate.

[0008] According to some embodiments of this application, segmenting a two-qubit gate frequency diagram to obtain at least one qubit group includes: determining a qubit pool in the two-qubit gate frequency diagram, the qubit pool comprising N qubits, where N is a positive integer greater than 1; determining at least one incoherent qubit with a frequency of zero relative to the first qubit in the qubit pool; determining the first qubit and the at least one incoherent qubit as a first qubit group; removing qubits from the first qubit group from the qubit pool to obtain a qubit pool to be processed; determining a qubit group corresponding to the remaining qubits in the qubit pool to be processed; and continuously removing qubits from the corresponding qubit group from the qubit pool until the qubit pool to be processed is traversed to obtain at least one qubit group.

[0009] According to some embodiments of this application, the first optical tweezers array is an optical tweezers array generated by a spatial light modulator, and the second optical tweezers array is an optical tweezers array generated by an acousto-optic deflector.

[0010] According to another aspect of this application, a neutral atom quantum circuit compilation system is provided. The neutral atom quantum circuit compilation system includes a qubit mapping module, a frequency map construction module, a qubit processing module, and a qubit movement module. The qubit mapping module maps the qubits of a preset quantum circuit to neutral atoms in a first optical tweezers array to obtain a two-qubit gate quantum circuit. The frequency map construction module constructs a two-qubit gate frequency map based on the two-qubit gate quantum circuit. The qubit processing module divides the two-qubit gate frequency map to obtain at least one qubit group, and maps the at least one qubit group to another first optical tweezers array in a preset form to obtain a mapped qubit array. The qubit movement module moves at least one qubit in the mapped qubit array to a second optical tweezers array, and moves at least one qubit within a preset position range of a target qubit based on the second optical tweezers array, so that at least one qubit and the target qubit perform a two-qubit gate.

[0011] According to some embodiments of this application, the qubit processing module determines a qubit pool in a two-qubit gate frequency diagram, the qubit pool comprising N qubits, where N is a positive integer greater than 1; the qubit processing module determines at least one incoherent qubit with a frequency of zero relative to the first qubit in the qubit pool; the qubit processing module determines the first qubit and at least one incoherent qubit as a first qubit group; the qubit processing module removes qubits from the first qubit group from the qubit pool to obtain a qubit pool to be processed; the qubit processing module determines a qubit group corresponding to the remaining qubits in the qubit pool to be processed; the qubit processing module continuously removes qubits from the corresponding qubit group from the qubit pool until the qubit pool to be processed is traversed to obtain at least one qubit group.

[0012] According to some embodiments of this application, the first optical tweezers array is an optical tweezers array generated by a spatial light modulator, and the second optical tweezers array is an optical tweezers array generated by an acousto-optic deflector.

[0013] According to another aspect of this application, an electronic device is also provided. The electronic device includes: one or more processors; and a storage device for storing one or more programs, which, when executed by the one or more processors, enable the one or more processors to implement the neutral atom quantum circuit compilation method described above.

[0014] According to another aspect of this application, a non-volatile computer-readable storage medium is also provided. This storage medium stores a computer program capable of implementing the neutral atom quantum circuit compilation method described above.

[0015] This application constructs a two-qubit gate frequency diagram based on a two-qubit gate quantum circuit, divides the two-qubit gate frequency diagram, and sets the qubits in different optical tweezers arrays based on the corresponding allocation rule. This enables the movement of qubits based on their coherence to perform two-qubit gate operations, thereby achieving fast compilation and solution of qubits. Attached Figure Description

[0016] To more clearly illustrate the technical solutions in the embodiments of this application, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0017] Figure 1 A schematic diagram of an SLM array according to an embodiment of this application is shown;

[0018] Figure 2 A schematic diagram of an AOD array according to an embodiment of this application is shown;

[0019] Figure 3 A flowchart illustrating a compilation method of an example embodiment of this application is shown;

[0020] Figure 4 A schematic diagram of a two-qubit gate quantum circuit according to an embodiment of this application is shown;

[0021] Figure 5 This application shows a two-bit gate frequency diagram according to an embodiment of the present application;

[0022] Figure 6 This diagram illustrates yet another flowchart of the compilation method according to an embodiment of this application;

[0023] Figure 7 A schematic diagram showing the segmentation of a two-bit gate frequency diagram according to an embodiment of this application is provided.

[0024] Figure 8 A schematic diagram of the structure of the compilation system according to an embodiment of this application is shown.

[0025] Explanation of reference numerals in the attached figures:

[0026] Compilation system 1; Quantum bit mapping module 10; Frequency diagram construction module 20; Quantum bit processing module 30; Quantum bit movement module 40. Detailed Implementation

[0027] Exemplary embodiments will now be described more fully with reference to the accompanying drawings. However, these exemplary embodiments can be implemented in many forms and should not be construed as limited to the embodiments set forth herein; rather, they are provided so that this application will be thorough and complete, and will fully convey the concept of the exemplary embodiments to those skilled in the art. The same reference numerals in the drawings denote the same or similar parts, and therefore repeated descriptions of them will be omitted.

[0028] The described features, structures, or characteristics can be combined in any suitable manner in one or more embodiments. Numerous specific details are provided in the following description to give a full understanding of embodiments of this disclosure. However, those skilled in the art will recognize that the technical solutions of this disclosure can be practiced without one or more of these specific details, or other methods, components, materials, devices, etc. In these cases, well-known structures, methods, devices, implementations, materials, or operations will not be shown or described in detail.

[0029] Furthermore, the terms “comprising” and “having”, and any variations thereof, are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or apparatus that includes a series of steps or units is not limited to the steps or units listed, but may optionally include steps or units not listed, or may optionally include other steps or units inherent to such process, method, product, or apparatus.

[0030] The terms "first," "second," etc., in the specification, claims, and accompanying drawings of this application are used to distinguish different objects, rather than to describe a specific order.

[0031] The technical solutions of this application will be clearly and completely described below with reference to the accompanying drawings of the embodiments. Obviously, the described embodiments are only some, not all, of the embodiments of this application. All other embodiments obtained by those skilled in the art based on the embodiments of this application without creative effort are within the scope of protection of this application.

[0032] In a prior art, mobile neutral atom quantum circuits can be compiled using a compiler. For example, prior art utilizes SMT (Satisfiability Modulo Theories) solvers to solve for the mapping and scheduling processes of qubits that satisfy physical constraints.

[0033] However, the inventors discovered that the scalability of the compilation method based on the SMT solver is limited by the SMT solver itself, causing the solution time to increase exponentially with the number of quantum circuits. For example, for a quantum circuit with 90 qubits, it would take at least one day to complete the compilation. Furthermore, the compilation method based on the SMT solver also suffers from the problem of enormous computational resources.

[0034] In another existing technology, mobile neutral atom quantum circuits can be compiled based on the MAX k-Cut algorithm. For example, the mapping of qubits is performed based on the MAX k-Cut algorithm, and the cut qubits are placed in K sets of optical tweezers arrays to remove the limitations of neutral atom quantum computing.

[0035] However, the inventors discovered that the compilation method based on the MAX k-Cut algorithm requires at least K-1 sets of acousto-optic deflectors to confine the qubits, while current neutral atom quantum computing platforms can only limit the use of two sets of acousto-optic deflectors. The deployment of multiple sets of acousto-optic deflectors is difficult to implement in practical applications. Furthermore, the MAX k-Cut algorithm is an NP-hard problem, which also presents challenges for large-scale neutral atom quantum computing, such as the enormous computational resources required and the inability to achieve fast compilation and solution.

[0036] According to an example embodiment, neutral atom quantum computing uses neutral atoms trapped in an optical tweezers array as qubits. An optical tweezers array is a quantum manipulation platform that can capture and manipulate atoms or molecules using a laser beam; the array comprises multiple optical tweezers points.

[0037] Optical tweezers points can be generated by SLM (Spatial Light Modulator) or AOD (Acousto-optic Deflectors). An optical tweezers array formed by optical tweezers points generated by SLM is called an SLM array; an optical tweezers array formed by optical tweezers points generated by AOD is called an AOD array.

[0038] Figure 1 A schematic diagram of an SLM array according to an embodiment of this application is shown; Figure 2 A schematic diagram of an AOD array according to an embodiment of this application is shown.

[0039] like Figure 1 As shown, the optical tweezers points generated by an SLM can be located at any position on a two-dimensional plane, but the optical tweezers points within an SLM array cannot be moved. For example, Figure 1 An SLM array with 7 optical tweezers points is shown, and the positions of the 7 optical tweezers points are arbitrarily distributed.

[0040] like Figure 2 As shown, the optical tweezers points generated by AOD are lattice array structures located on a two-dimensional plane. The AOD array can be moved, but the AOD array needs to be moved row by row or column by column during the movement. For example, as... Figure 2 As shown, row 3 in the AOD array can be moved downwards as a whole.

[0041] According to the example embodiment, neutral atoms can be switched between the SLM array and the AOD array. The optical tweezers points of the SLM array can be individually turned on or off during quantum computing, while the optical tweezers points of the AOD array need to be turned on or off in whole rows or columns during quantum computing.

[0042] During the movement of neutral atoms in an AOD array, the movement can only be performed sequentially. That is, when a row of an AOD array is moved, it can only be moved sequentially according to the row order, and cannot skip intermediate rows. Similarly, when a column of an AOD array is moved, it can only be moved sequentially according to the column order, and cannot skip intermediate columns.

[0043] According to the example embodiment, any single-qubit gate can be individually controlled by a laser. It can be understood here that when the distance between two qubits is within the Rydberg blocking radius r... b When two qubits are simultaneously excited by a laser (such as a Rydberg laser), they can execute a Control-Z gate (a two-qubit quantum logic gate, or simply a two-qubit gate). When two qubits execute a CZ gate, the distance (r) between the two neutral atoms... b No other neutral atoms can exist within it.

[0044] According to one aspect of this application, a method for compiling neutral atom quantum circuits is provided. Figure 3 A flowchart illustrating a compilation method of an example embodiment of this application is shown. Figure 3 As shown, the compilation method includes steps S100-S600.

[0045] For example, the compilation method of the neutral atom quantum circuit can be executed by a compilation system for neutral atom quantum circuits.

[0046] In step S100, the compilation system maps the qubits of the preset quantum circuit to the neutral atoms in the first optical tweezers array to obtain a two-qubit gate quantum circuit.

[0047] Optionally, the first optical tweezers array is an optical tweezers array generated by a spatial light modulator, and is an SLM array.

[0048] According to an example embodiment, the preset quantum circuit can be a quantum circuit task input to the compilation system. The compilation system maps the qubits in the quantum circuit to neutral atoms located in the SLM array one-to-one. As the quantum circuit operates layer by layer, the neutral atom can move to the vicinity of the target neutral atom according to the requirements of the quantum circuit task to execute the two-qubit gate in the quantum circuit task, thereby obtaining a two-qubit gate quantum circuit that only includes two-qubit gates.

[0049] In step S200, the compilation system constructs a two-bit gate frequency diagram based on the two-bit gate quantum circuit in the two-bit gate quantum circuit.

[0050] Figure 4 A schematic diagram of a two-qubit gate quantum circuit according to an embodiment of this application is shown; Figure 5 The diagram shows a two-bit gate frequency diagram according to an embodiment of this application.

[0051] Figure 4 A schematic diagram of a quantum circuit including 5 qubits (q1, q2, q3, q4, q5) is shown. Based on the quantum circuit diagram, the frequency of two-qubit gates in the entire quantum circuit can be counted, and a two-qubit gate frequency diagram can be constructed accordingly (e.g., ...). Figure 5 (As shown).

[0052] In step S300, the compilation system performs a segmentation process on the two-bit gate frequency diagram to obtain at least one group of qubits.

[0053] For example, in a two-bit gate frequency diagram, the compiler system identifies qubits that do not have a two-bit gate operation with a specific qubit, and separates that specific qubit from the qubits that do not have a two-bit gate operation to form a qubit group.

[0054] Thus, by segmenting the two-bit gate frequency diagram, at least one qubit group can be obtained. A qubit group can contain any number of qubits, and there are no two-bit gate operations between qubits within a qubit group; two-bit gate operations only exist between different qubit groups.

[0055] Optionally, in step S300, the compilation system performs a segmentation process on the two-bit gate frequency diagram based on a greedy algorithm to obtain at least one group of qubits.

[0056] Greedy algorithms are a type of algorithm for solving optimization problems. At each decision stage, they choose what appears to be the best option at that moment, making locally optimal decisions in order to obtain the globally optimal solution. Greedy algorithms proceed step-by-step, making the best choice at each step based on the current situation and according to some optimization metric. The greedy algorithm divides the solution process into several steps, each applying the greedy principle to select the best or optimal choice under the current state.

[0057] Figure 6 This is another flowchart illustrating the compilation method of an embodiment of this application. Figure 7 This diagram illustrates the segmentation of a two-bit gate frequency diagram according to an embodiment of this application.

[0058] For example, such as Figure 6 As shown, in step S300, the compilation system performs a segmentation process on the two-bit gate frequency diagram based on a greedy algorithm to obtain at least one group of qubits, which may include steps S310-S360.

[0059] In step S310, the compilation system determines the qubit pool in the two-bit gate frequency diagram. The qubit pool includes N qubits, where N is a positive integer greater than 1.

[0060] For example, such as Figure 7 As shown, the qubit pool in the two-qubit gate frequency diagram includes 5 qubits (q1, q2, q3, q4, q5).

[0061] In step S320, the compilation system determines at least one incoherent qubit with a frequency of zero relative to the first qubit in the qubit pool.

[0062] In step S330, the compilation system determines the first qubit and at least one incoherent qubit as the first qubit group.

[0063] For example, the first qubit is randomly selected from the qubit pool. An incoherent qubit is a qubit with a frequency of 0 relative to the first qubit; that is, the distance between the first qubit and the incoherent qubit is greater than the Rydberg blocking radius r. b Furthermore, two-bit gate operations cannot be performed between the two.

[0064] For example, such as Figure 7 As shown, taking the first qubit as q1 as an example, the incoherent qubits with a frequency of zero (i.e., no connection) to q1 are q4 and q5. That is, the qubit group corresponding to q1 is Q1{q1, q4, q5}.

[0065] In step S340, the compilation system removes qubits from the first qubit group from the qubit pool to obtain the qubit pool to be processed.

[0066] For example, such as Figure 7 As shown, the compilation system removes Q1{q1, q4, q5} from the qubit pool to obtain the remaining (q2, q3) qubit pool to be processed, and updates the two-bit gate frequency diagram accordingly.

[0067] In step S350, the compilation system determines the qubit group corresponding to the remaining qubits in the qubit pool to be processed.

[0068] In step S360, the compilation system continuously removes qubits from the corresponding qubit group in the qubit pool until the qubit pool to be processed is traversed to obtain at least one qubit group.

[0069] For example, such as Figure 7 As shown, the compilation system traverses the remaining qubits (such as q2) in the pool of qubits to be processed, and determines the qubit group corresponding to q2 as Q2{q2, q3}.

[0070] This can be understood as follows: after the compiler removes Q2{q2, q3} from the qubit pool, it obtains a new qubit pool to be processed. The compiler then determines the qubit groups corresponding to the remaining qubits in the new qubit pool to be processed, until the qubit traversal of the qubit pool to be processed is completed.

[0071] For example, such as Figure 7 As shown, after the compilation system traverses all the remaining qubits in the bit pool to be processed, that is, after the two-bit gate frequency diagram is completely cut, two qubit groups, Q1{q1, q4, q5} and Q2{q2, q3}, can be obtained.

[0072] Through the above embodiments, this application uses a greedy algorithm to segment the two-bit gate frequency diagram, which can quickly realize the mapping between logical bits and physical bits in quantum circuits.

[0073] In step S400, the compilation system maps the qubit group to another first optical tweezers array in a preset form to obtain a mapped qubit array.

[0074] According to an example embodiment, the compilation system maps at least one qubit group into another SLM array in the form of rows. For example, each qubit group corresponds to one row of the SLM array, and M qubit groups are mapped to form an SLM array consisting of M rows.

[0075] Alternatively, the compiler can map at least one set of qubits into another SLM array as columns. For example, each set of qubits corresponds to a column of the SLM array, and M sets of qubits can be mapped to form an SLM array with M columns.

[0076] In step S500, the compilation system moves at least one qubit in the mapped qubit array to the second optical tweezers array.

[0077] In step S600, the compilation system moves at least one qubit to a preset position range of the target qubit based on the second optical tweezers array, so that at least one qubit and the target qubit perform a two-bit gate.

[0078] Optionally, the second optical tweezers array is an optical tweezers array generated by an acousto-optic deflector, which is an AOD array.

[0079] For example, the compiler system moves a qubit from a specific SLM row in a mapped qubit array to another AOD array (which has only one row and one column). Based on the AOD array, it moves this qubit to a position near a target qubit in another SLM row. By controlling the laser to turn on or off, a two-qubit gate operation can be performed between this qubit and the target qubit. After the two-qubit gate operation is performed, the compiler system moves the qubit back to its original position based on the AOD array.

[0080] The compilation system repeatedly performs the above-mentioned shift operations on specific qubits, performs two-bit gate operations on specific qubits, and updates the quantum circuit until the entire quantum circuit is compiled.

[0081] This application constructs a two-qubit gate frequency diagram based on a two-qubit gate quantum circuit, divides the two-qubit gate frequency diagram, and sets the qubits in different optical tweezers arrays based on the corresponding allocation rule. This enables the movement of qubits based on their coherence to perform two-qubit gate operations, thereby achieving fast compilation and solution of qubits.

[0082] This application employs a greedy algorithm to segment the two-qubit gate frequency diagram, enabling rapid mapping between logical bits and physical bits in quantum circuits. Furthermore, the compilation process utilizes only one SLM device and one AOD device, allowing for replication in practical applications and demonstrating independence from physical device limitations. Additionally, since the qubits remain within the SLM array when not performing two-qubit gate operations, the maximum number of qubits depends solely on the power of the SLM device, resulting in excellent scalability of the compilation method provided in this application.

[0083] According to another aspect of this application, this application provides a neutral atom quantum circuit compilation system. Figure 8 A schematic diagram of the structure of the compilation system according to an embodiment of this application is shown, such as... Figure 8 As shown, the compilation system 1 includes a qubit mapping module 10, a frequency map construction module 20, a qubit processing module 30, and a qubit movement module 40.

[0084] According to an example embodiment, the quantum bit mapping module 10 maps the quantum bits of a preset quantum circuit to neutral atoms in a first optical tweezers array to obtain a two-bit gate quantum circuit.

[0085] Optionally, the first optical tweezers array is an optical tweezers array generated by a spatial light modulator, and is an SLM array.

[0086] According to an example embodiment, the preset quantum circuit can be a quantum circuit task input to the compilation system. The qubit mapping module 10 maps the qubits in the quantum circuit to neutral atoms located in the SLM array one-to-one. As the quantum circuit operates layer by layer, the neutral atom can move to the vicinity of the target neutral atom according to the needs of the quantum circuit task to execute the two-qubit gate in the quantum circuit task, thereby obtaining a two-qubit gate quantum circuit that only includes two-qubit gates.

[0087] Frequency diagram construction module 20 constructs a two-bit gate frequency diagram based on the two-bit gate quantum circuit in the two-bit gate quantum circuit.

[0088] For example, the frequency diagram construction module 20 can count the number of times a two-bit gate appears in the entire quantum circuit based on the quantum circuit diagram, thereby constructing a two-bit gate frequency diagram.

[0089] The qubit processing module 30 performs segmentation processing on the two-bit gate frequency diagram to obtain at least one qubit group.

[0090] For example, in the two-bit gate frequency diagram, the qubit processing module 30 identifies the qubit that does not have a two-bit gate operation with a certain specific qubit, and separates the specific qubit from the qubit that does not have a two-bit gate operation to form a qubit group.

[0091] Thus, by segmenting the two-bit gate frequency diagram, at least one qubit group can be obtained. A qubit group can contain any number of qubits, and there are no two-bit gate operations between qubits within a qubit group; two-bit gate operations only exist between different qubit groups.

[0092] Optionally, the qubit processing module 30 performs a greedy algorithm to divide the two-bit gate frequency diagram to obtain at least one qubit group.

[0093] Greedy algorithms are a type of algorithm for solving optimization problems. At each decision stage, they choose what appears to be the best option at that moment, making locally optimal decisions in order to obtain the globally optimal solution. Greedy algorithms proceed step-by-step, making the best choice at each step based on the current situation and according to some optimization metric. The greedy algorithm divides the solution process into several steps, each applying the greedy principle to select the best or optimal choice under the current state.

[0094] Optionally, the qubit processing module 30 determines a qubit pool in a two-qubit gate frequency diagram, the qubit pool comprising N qubits, where N is a positive integer greater than 1.

[0095] The qubit processing module 30 identifies at least one incoherent qubit with a frequency of zero that is connected to the first qubit in the qubit pool.

[0096] The qubit processing module 30 identifies the first qubit and at least one incoherent qubit as the first qubit group.

[0097] For example, the first qubit is randomly selected from the qubit pool. An incoherent qubit is a qubit with a frequency of 0 relative to the first qubit; that is, the distance between the first qubit and the incoherent qubit is greater than the Rydberg blocking radius r. b Furthermore, two-bit gate operations cannot be performed between the two.

[0098] The qubit processing module 30 removes qubits from the first qubit group from the qubit pool to obtain the qubit pool to be processed.

[0099] The qubit processing module 30 determines the qubit group corresponding to the remaining qubits in the qubit pool to be processed.

[0100] The qubit processing module 30 continuously removes qubits from the corresponding qubit group in the qubit pool until the qubit pool to be processed is traversed to obtain at least one qubit group.

[0101] The exemplary description of how the qubit processing module 30 divides the two-bit gate frequency diagram based on a greedy algorithm has been described in detail above and will not be repeated here.

[0102] Through the above embodiments, this application uses a greedy algorithm to segment the two-bit gate frequency diagram, which can quickly realize the mapping between logical bits and physical bits in quantum circuits.

[0103] The quantum bit processing module 30 maps the quantum bit group to another first optical tweezers array in a preset form to obtain a mapped quantum bit array.

[0104] According to an example embodiment, the qubit processing module 30 maps at least one qubit group into another SLM array in the form of rows. For example, each qubit group corresponds to one row of the SLM array, and M qubit groups are mapped to form an SLM array comprising M rows.

[0105] Alternatively, the qubit processing module 30 maps at least one qubit group into another SLM array in the form of columns. For example, each qubit group corresponds to one column of the SLM array, and M qubit groups are mapped to form an SLM array consisting of M columns.

[0106] The qubit moving module 40 moves at least one qubit in the mapped qubit array to the second optical tweezers array.

[0107] The qubit moving module 40 moves at least one qubit to a preset position range of the target qubit based on the second optical tweezers array, so that at least one qubit and the target qubit perform a two-bit gate.

[0108] Optionally, the second optical tweezers array is an optical tweezers array generated by an acousto-optic deflector, which is an AOD array.

[0109] For example, the qubit moving module 40 moves a qubit from a certain SLM row in the mapped qubit array to another AOD array (which has only one row and one column), and based on the AOD array, moves the qubit to a position near a target qubit in another SLM row. By controlling the laser to turn on or off, the qubit and the target qubit can perform a two-qubit gate operation. After the two-qubit gate operation is performed, the qubit moving module 40 moves the qubit back to its original position based on the AOD array.

[0110] The qubit shifting module 40 repeatedly performs the above-mentioned shifting operation on a specific qubit, performs a two-bit gate operation on the specific qubit, and updates the quantum circuit until the entire quantum circuit is compiled.

[0111] This application constructs a two-qubit gate frequency diagram based on a two-qubit gate quantum circuit, divides the two-qubit gate frequency diagram, and sets the qubits in different optical tweezers arrays based on the corresponding allocation rule. This enables the movement of qubits based on their coherence to perform two-qubit gate operations, thereby achieving fast compilation and solution of qubits.

[0112] This application employs a greedy algorithm to segment the two-qubit gate frequency diagram, enabling rapid mapping between logical bits and physical bits in quantum circuits. Furthermore, the compilation process utilizes only one SLM device and one AOD device, allowing for replication in practical applications and offering the advantage of being unrestricted by physical equipment. Additionally, since the qubits remain within the SLM array when not performing two-qubit gate operations, the maximum number of qubits depends solely on the power of the SLM device, thus providing the compilation method with good scalability.

[0113] According to another aspect of the present invention, an electronic device is also provided. The electronic device includes: one or more processors; and a storage device for storing one or more programs, which, when executed by the one or more processors, enable the one or more processors to implement the neutral atom quantum circuit compilation method described above.

[0114] According to another aspect of the present invention, a non-volatile computer-readable storage medium is also provided. This storage medium stores a computer program capable of implementing the neutral atom quantum circuit compilation method described above.

[0115] Finally, it should be noted that the above description is merely a preferred embodiment of this application and is not intended to limit this application. Although this application has been described in detail with reference to the foregoing embodiments, those skilled in the art can still modify the technical solutions of the foregoing embodiments or make equivalent substitutions for some of the technical features. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of this application should be included within the protection scope of this application.

Claims

1. A method for compiling neutral atom quantum circuits, characterized in that, include: The qubits of the preset quantum circuit are mapped to neutral atoms in the first optical tweezers array to obtain a two-qubit gate quantum circuit. Construct a two-bit gate frequency diagram based on the two-bit gate quantum circuit in the two-bit gate quantum circuit; The two-bit gate frequency diagram is segmented to obtain at least one group of qubits; The at least one group of qubits is mapped into another first optical tweezers array in a preset form to obtain a mapped qubit array; At least one qubit in the mapped qubit array is moved to the second optical tweezers array; The at least one qubit is moved to a preset position range of the target qubit based on the second optical tweezers array, so that the at least one qubit and the target qubit perform a two-bit gate; The step of segmenting the two-bit gate frequency diagram to obtain at least one group of qubits includes: Determine the qubit pool in the two-bit gate frequency diagram, wherein the qubit pool comprises N qubits, where N is a positive integer greater than 1; Identify at least one incoherent qubit with a frequency of zero that is connected to the first qubit in the qubit pool; The first qubit and the at least one incoherent qubit are defined as the first qubit group; The qubits in the first qubit group are removed from the qubit pool to obtain the qubit pool to be processed; Determine the group of qubits corresponding to the remaining qubits in the pool of qubits to be processed; The qubits in the corresponding qubit group are continuously removed from the qubit pool until the qubit pool to be processed is traversed to obtain the at least one qubit group.

2. The neutral atom quantum circuit compilation method according to claim 1, characterized in that, The first optical tweezers array is an optical tweezers array generated by a spatial light modulator, and the second optical tweezers array is an optical tweezers array generated by an acousto-optic deflector.

3. A neutral atom quantum circuit compilation system, characterized in that, include: The quantum bit mapping module maps the quantum bits of a preset quantum circuit to neutral atoms in the first optical tweezers array to obtain a two-bit gate quantum circuit. The frequency diagram construction module constructs a two-bit gate frequency diagram based on the two-bit gate quantum circuit in the two-bit gate quantum circuit. The quantum bit processing module divides the two-bit gate frequency diagram to obtain at least one quantum bit group, and maps the at least one quantum bit group to another first optical tweezers array in a preset form to obtain a mapped quantum bit array. A qubit moving module moves at least one qubit in the mapped qubit array to a second optical tweezers array, and moves the at least one qubit to a preset position range of a target qubit based on the second optical tweezers array, so that the at least one qubit and the target qubit perform a two-bit gate; The qubit processing module determines the qubit pool in the two-qubit gate frequency diagram, and the qubit pool includes N qubits, where N is a positive integer greater than 1; The qubit processing module determines at least one incoherent qubit with a frequency of zero that is related to the first qubit in the qubit pool; The quantum bit processing module determines the first quantum bit and the at least one incoherent quantum bit as a first quantum bit group; The qubit processing module removes the qubits in the first qubit group from the qubit pool to obtain the qubit pool to be processed. The qubit processing module determines the qubit group corresponding to the remaining qubits in the qubit pool to be processed; The qubit processing module continuously removes qubits from the corresponding qubit group from the qubit pool until the qubit pool to be processed is traversed to obtain the at least one qubit group.

4. The neutral atom quantum circuit compilation system according to claim 3, characterized in that, The first optical tweezers array is an optical tweezers array generated by a spatial light modulator, and the second optical tweezers array is an optical tweezers array generated by an acousto-optic deflector.

5. An electronic device, characterized in that, include: One or more processors; Storage device for storing one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors implement the neutral atom quantum circuit compilation method as described in any one of claims 1-2.

6. A non-volatile computer-readable storage medium having a computer program stored thereon, characterized in that, The computer program implements the neutral atom quantum circuit compilation method as described in any one of claims 1-2.

Images