Quantum random access memory architecture, quantum computer operating system, and quantum computer

By introducing binary tree modules and parallel operations of quantum logic gates into quantum random access memory (QRAM), the parallel architecture problem of QRAM is solved, enabling parallel data reading, improving data processing speed and reducing error rate.

CN118607650BActive Publication Date: 2026-11-17ORIGIN QUANTUM COMPUTING TECH (HEFEI) CO LTD
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202310198104.7
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-02-28
Publication Date
2026-11-17
Estimated Expiration
2043-02-28

AI Technical Summary

Technical Problem

In the current technology, the parallel architecture of quantum random access memory (QRAM) is not yet mature, resulting in low efficiency of parallel data reading, slow data processing speed, and high execution error rate.

Method used

It employs pre-built binary tree modules, address routing modules, data extraction modules, and address switching modules, which are executed in parallel. It utilizes preset addressing methods and quantum circuits to achieve parallel data reading, including operations of quantum logic gates such as H gates, CNOT gates, controlled Z gates, and SWAP gates.

Benefits of technology

It accelerates data processing speed, optimizes time complexity, and reduces the execution error rate of the QRAM architecture.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118607650B_ABST
    Figure CN118607650B_ABST
Patent Text Reader

Abstract

This invention discloses a quantum random access memory (QRAM) architecture, a quantum computer operating system, and a quantum computer. The QRAM includes a pre-constructed binary tree module, an address routing module, a data extraction module, and an address swapping module. The address routing module determines the path corresponding to the address based on the address and using a preset addressing method. The data extraction module copies each bit of binary data from the current target layer subtree node to the root node according to the path and then reads it. The address swapping module swaps one bit of binary data between the address bit and the data bit using a preset quantum circuit. Furthermore, the address routing module, data extraction module, and address swapping module execute in parallel. By proposing a parallel quantum random access memory architecture, this invention provides a foundation for subsequent implementation of parallel data reading methods based on QRAM, accelerating data processing speed and reducing the execution error rate of the QRAM architecture.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention belongs to the field of quantum computing technology, specifically a quantum random access memory architecture, a quantum computer operating system, and a quantum computer. Background Technology

[0002] Quantum Random Access Memory (QRAM) is a storage technology that utilizes the principles of quantum physics. Unlike traditional computer memory, QRAM allows information to be stored in parallel at multiple locations and allows multiple pieces of information to be read simultaneously. This gives QRAM a significant advantage in processing large amounts of data. Theoretically, QRAM has a much higher storage density than traditional memory technologies, and because it can use quantum encryption algorithms, it offers stronger security.

[0003] Although QRAM is a technology with great potential, it is still in the research and development stage and is not currently a mainstream technology in the market. Furthermore, how to explore a parallel architecture for implementing QRAM to achieve parallel data reading and accelerate data processing speed remains a problem that urgently needs to be solved. Summary of the Invention

[0004] The purpose of this invention is to provide a quantum random access memory (QRAM) architecture, a quantum computer operating system, and a quantum computer to address the shortcomings of existing technologies. By proposing a parallel QRAM architecture, it lays the foundation for subsequent implementation of parallel data reading methods based on QRAM, thereby accelerating data processing speed, optimizing time complexity, and reducing the execution error rate of the QRAM architecture.

[0005] One embodiment of this application provides a quantum random access memory architecture, characterized in that it includes:

[0006] A pre-constructed binary tree module, the binary tree module includes a root node of 1 level and N-1 subtree nodes, each level of the binary tree module includes an address bit and a data bit, and N is the address length;

[0007] The address routing module is used to determine the path corresponding to the address based on the address and using a preset addressing method;

[0008] The data extraction module is used to copy each bit of binary data of the address from the current target layer subtree node to the root node according to the path, and then read it.

[0009] The address switching module is used to exchange one bit of binary data on the address bit and the data bit using a preset quantum circuit;

[0010] The address routing module, the data extraction module, and the address switching module are executed in parallel, which includes reading a preset word length of data at a time within a preset time sequence.

[0011] Optionally, the binary tree module includes a first submodule and a second submodule, wherein the address bits of each layer of the first submodule are constructed from a first type of qubit, and the address bits of each layer of the second submodule are constructed from a second type of qubit.

[0012] Optionally, the address routing module includes:

[0013] The root node routing unit is used to sequentially transfer each bit of the read address to the data bits of the corresponding target layer subtree node, starting from the root node.

[0014] The subtree node routing unit is used to swap one address bit of the data bit read from the current target layer subtree node to the address bit of the current target layer subtree node, until the path corresponding to the address is generated.

[0015] Optionally, the preset quantum circuit includes an H gate, a CNOT gate, a controlled Z gate, a SWAP gate, and a controlled SWAP gate.

[0016] Optionally, the preset addressing mode includes:

[0017] The first preset addressing is achieved by the following formula:

[0018]

[0019] Among them, R b This indicates the first preset addressing mode where the address bits are constructed from first-type qubits. |0> and |1> represent the two states of the first-type qubits, respectively. SWAP |0> This represents the SWAP gate controlled by |0>. |1> This indicates a SWAP gate controlled by |1>.

[0020] Alternatively, a second preset addressing can be achieved through the following formula:

[0021]

[0022] Among them, R t The second preset addressing mode is indicated by the address bits being constructed from second-type qubits. |W>, |L>, and |R> represent the three states of the second-type qubits, respectively, and I is the identity matrix.

[0023] Optionally, the quantum random access memory architecture further includes:

[0024] The inversion calculation module is used to perform inversion calculation on the quantum random access memory architecture to restore the quantum random access memory architecture to its initial state.

[0025] Another embodiment of this application provides a storage medium storing a computer program, wherein the computer program is configured to implement the quantum random access memory architecture described in any of the preceding claims when running.

[0026] Another embodiment of this application provides an electronic device including a memory and a processor, wherein the memory stores a computer program and the processor is configured to run the computer program to implement the quantum random access memory architecture described in any of the preceding claims.

[0027] Another embodiment of this application provides a quantum computer operating system, which includes a quantum random access memory architecture as described in any of the preceding claims.

[0028] Another embodiment of this application provides a quantum computer, which includes a quantum computer operating system as described above.

[0029] Compared with existing technologies, this invention discloses a quantum random access memory (QRAM) architecture, including a pre-constructed binary tree module, an address routing module, a data extraction module, and an address swapping module. The address routing module determines the path corresponding to the address based on the address and using a preset addressing method. The data extraction module copies each bit of binary data from the current target layer subtree node to the root node according to the path and reads it. The address swapping module swaps one bit of binary data between the address bit and the data bit using a preset quantum circuit. Furthermore, the address routing module, data extraction module, and address swapping module are executed in parallel. By proposing a parallel quantum random access memory architecture, this invention provides a foundation for subsequent implementation of parallel data reading methods based on QRAM, accelerating data processing speed, optimizing time complexity, and reducing the execution error rate of the QRAM architecture. Attached Figure Description

[0030] Figure 1 This is a system network block diagram of a quantum random access memory architecture provided by an embodiment of the present invention;

[0031] Figure 2 This is a schematic diagram of a quantum random access memory architecture provided in an embodiment of the present invention;

[0032] Figure 3 This is a schematic diagram of a binary tree module structure of a quantum random access memory provided in an embodiment of the present invention;

[0033] Figure 4 This is a schematic diagram of a quantum circuit for implementing data copying provided in an embodiment of the present invention;

[0034] Figure 5 This is a schematic diagram of another quantum circuit for implementing data copying provided in an embodiment of the present invention;

[0035] Figure 6 This is a schematic diagram of a quantum circuit for implementing address bus input provided by an embodiment of the present invention;

[0036] Figure 7 This is a schematic diagram of a quantum circuit for implementing data bus input provided by an embodiment of the present invention;

[0037] Figure 8 This is a schematic diagram of a quantum circuit for implementing data routing provided in an embodiment of the present invention;

[0038] Figure 9 This is a schematic diagram of another quantum circuit for implementing data routing provided in an embodiment of the present invention;

[0039] Figure 10 This is a schematic diagram of another quantum random access memory architecture provided in an embodiment of the present invention. Detailed Implementation

[0040] The embodiments described below with reference to the accompanying drawings are exemplary and are only used to explain the present invention, and should not be construed as limiting the present invention.

[0041] The present invention first provides a quantum random access memory architecture, which can be applied to electronic devices, such as computer terminals, specifically ordinary computers, quantum computers, etc.

[0042] The following detailed explanation uses a computer terminal as an example. Figure 1 This is a system network block diagram of a quantum random access memory architecture provided by an embodiment of the present invention. The system applied to the quantum random access memory architecture may include a network 110, a server 120, a wireless device 130, a client 140, a storage unit 150, a classical processing system 160, a quantum processing system 170, and may also include additional memory, classical processor, quantum processor and other devices not shown.

[0043] Network 110 is a medium that provides communication links between various devices and computers connected together in a system network used in quantum random access memory architecture, including but not limited to the Internet, corporate intranets, local area networks, mobile communication networks and combinations thereof, and the connection method can be wired, wireless communication links or fiber optic cables, etc.

[0044] Server 120 and client 140 are conventional data processing systems that may contain data and applications or software tools that perform conventional computational processes. Client 140 may be a personal computer or a network computer, so the data may also be provided by server 120. Wireless device 130 may be a smartphone, tablet, laptop, smart wearable device, etc. Storage unit 150 may include database 151, which can be configured to store data such as qubit parameters, quantum logic gate parameters, quantum circuits, and quantum programs.

[0045] The classical processing system 160 (quantum processing system 170) may include a classical processor 161 (quantum processor 171) for processing classical data (quantum data) and a memory 163 (memory 172) for storing classical data (quantum data). The classical data (quantum data) may be a boot file, an operating system image, and an application program 162 (application program 173). The application program 162 (application program 173) may be used to implement a quantum algorithm compiled according to a quantum random access memory architecture provided in an embodiment of the present invention.

[0046] Any data or information stored or generated in the classical processing system 160 (quantum processing system 170) can also be configured to be stored or generated in another classical (quantum) processing system in a similar manner, and any application executed therein can also be configured to be executed in another classical (quantum) processing system in a similar manner.

[0047] It should be noted that a true quantum computer has a hybrid structure, which includes at least... Figure 1 The system consists of two main parts: the classical processing system 160, which is responsible for performing classical calculations and control; and the quantum processing system 170, which is responsible for running quantum programs and thus realizing quantum computing.

[0048] The aforementioned classical processing system 160 and quantum processing system 170 can be integrated into a single device or distributed across two different devices. For example, the first device, including the classical processing system 160, runs a classical computer operating system that provides quantum application development tools and services, as well as the storage and network services required for quantum applications. Users develop quantum applications using the quantum application development tools and services on the second device and send the quantum program to the second device, including the quantum processing system 170, via the network services. The second device runs a quantum computer operating system, which parses the code of the quantum program and compiles it into instructions that can be recognized and executed by the quantum computer control system. The quantum processor 170 then implements the quantum algorithm corresponding to the quantum program based on these instructions.

[0049] In the classic silicon-based processing system 160, the units of the classic processor 161 are CMOS transistors. These computing units are not limited by time or coherence; that is, they are available at any time without time constraints. Furthermore, the number of these computing units in a silicon chip is sufficient; currently, a classic processor contains tens of thousands of computing units. The sufficient number of computing units and the fixed selectable computing logic of the CMOS transistors, such as AND logic, allow for computational efficiency through a combination of numerous CMOS transistors and limited logic functions.

[0050] Unlike the logic units in the classical processing system 160, the basic computational unit of the quantum processor 171 in the quantum processing system 170 is the qubit. The input of a qubit is limited by coherence and coherence time; that is, a qubit is limited by its available usage time and is not always readily available. Making full use of qubits within their available usage time is a key challenge in quantum computing. Furthermore, the number of qubits in a quantum computer is one of the representative indicators of its performance. Each qubit performs computational functions through on-demand configured logic functions. Given the limited number of qubits and the diverse logic functions available in quantum computing, such as Hadamard gates (H gates), Pauli-X gates (X gates), Pauli-Y gates (Y gates), Pauli-Z gates (Z gates), X gates, RY gates, RZ gates, CNOT gates, CR gates, iSWAP gates, Tofoli gates, etc., quantum computing requires combining a limited number of qubits with diverse combinations of logic functions to achieve computational effects.

[0051] Based on these differences, the design of logical functions applied to qubits (including the design of whether qubits are used and the design of the efficiency of each qubit) is crucial to improving the computational performance of quantum computers and requires special design. The aforementioned design considerations for qubits are technical problems that ordinary computing devices do not need to address. Therefore, this invention proposes a quantum random access memory architecture, a quantum computer operating system, and a quantum computer to address the shortcomings of existing technologies. By proposing a parallel quantum random access memory architecture, it lays the foundation for subsequent methods of parallel data reading based on QRAM, accelerating data processing speed, optimizing time complexity, and reducing the execution error rate of the QRAM architecture.

[0052] See Figure 2 , Figure 2This is a schematic diagram of a quantum random access memory (QRAM) architecture provided in an embodiment of the present invention. The QRAM architecture 20 may include a pre-constructed binary tree module 201, which includes one root node and N-1 subtree nodes. Each layer of the binary tree module 201 includes one address bit and one data bit, where N is the address length. An address routing module 202 is used to determine the path corresponding to the address based on the address and using a preset addressing method. A data extraction module 203 is used to copy each bit of binary data from the current target layer subtree node to the root node according to the path and then read it. An address exchange module 204 is used to exchange one bit of binary data between the address bit and the data bit using a preset quantum circuit. The address routing module 202, the data extraction module 203, and the address exchange module 204 are executed in parallel, meaning that the parallelism involves reading a preset word length of data at a time within a preset time sequence.

[0053] Specifically, the binary tree module 201 includes a first submodule and a second submodule, wherein the address bits of each layer of the first submodule are constructed from a first type of qubit, and the address bits of each layer of the second submodule are constructed from a second type of qubit.

[0054] In quantum computing, the first type of qubit can be a two-level qubit, and the second type can be a three-level qutrit. In classical computing, the bit is the most basic unit of information. In classical computing, a bit can only be in two states: 0 and 1. In quantum computing, a qubit can be in both |0> and |1> states simultaneously. Similarly, a qutrit can be in a superposition of three states, representing three possible states. Therefore, a qutrit can be understood as a qubit with three energy levels.

[0055] Specifically, the address routing module 202 may include: a root node routing unit, used to start from the root node and sequentially transfer each bit of the read address to the data bit of the corresponding target layer subtree node; and a subtree node routing unit, used to swap the address bit read from the data bit of the current target layer subtree node to the address bit of the current target layer subtree node, until the path corresponding to the address is generated.

[0056] For example, see Figure 3 , Figure 3 This is a schematic diagram of a binary tree module structure for a quantum random access memory provided in an embodiment of the present invention. Figure 3As shown, taking an address length of 3 as an example, a continuous vertical sequence of A (Address Qubit) and D (Data Qubit) forms a group called a node, which is the basic unit in a binary tree. All nodes constitute a binary tree. In the diagram, (0,0) represents the 0th node at level 0, i.e., the root node; (1,0) represents the 0th node at level 1, i.e., the 0th subtree node at level 1, and so on. Further details are omitted here.

[0057] It should be noted that each bit of the address can be read sequentially through the address register, and a preset quantum circuit can be used to perform a transfer operation on each bit of the address read from the address register. The preset quantum circuit includes H-gates, CNOT gates, controlled Z-gates, SWAP gates, and controlled SWAP gates. The transfer operation includes one or more of the following: data copying, data routing, and data exchange. The qubits of the preset quantum circuit include qubits corresponding to the bus, which includes an address bus and a data bus. The functions of the bus include inputting address information and inputting each data bit of a preset word length.

[0058] In one alternative implementation, the overall workflow of the quantum random access memory architecture is divided into two main parts: preset addressing and data loading. These two parts can be summarized into the following steps: data copying, address bus input, data bus input, data routing, and data exchange between address bits and data bits.

[0059] For example, see Figure 4 , Figure 4 This is a schematic diagram of a quantum circuit for implementing data copying according to an embodiment of the present invention. The address bits of the nodes in the diagram are a. l,p The data bits are d l,p By using a controlled Z-gate, one bit of data is stored in the corresponding qubit m in the memory pool. 2p In, and if address bit a l,p The address in the memory is 0, and the corresponding quantum bit m is stored in the memory pool. 2p If address bit a l,p If the address in the memory is 1, then the corresponding memory is stored in the memory pool m. 2p+1 The corresponding qubit.

[0060] It should be noted that data copying, or data replication, is a controlled operation that copies classical data from address bits to data bits. Because the Toffoli gate cannot be used to encode the quantum state |0> during the data input phase... Quantum state |1> is encoded as Therefore, a controlled Z-gate can be used to phase-encode data qubits to complete the data copying operation.

[0061] See Figure 5 , Figure 5 This is a schematic diagram of another quantum circuit for implementing data copying provided by an embodiment of the present invention. In the diagram, the |W> state within the dashed box represents no operation, and |L> and |R> represent quantum states |1> and |2>, respectively. That is, through a controlled CNOT gate, one bit of data is stored in the corresponding qubit m in the memory pool. 2p Or store in memory pool m 2p+1 In the corresponding qubits.

[0062] See Figure 6 , Figure 6 This is a schematic diagram of a quantum circuit for implementing address bus input according to an embodiment of the present invention. Figure A i Let d be the address of the i-th bit. 0,0 This represents the data bits of the root node. The address bus input copies the i-th binary bit of the address bus to the root node, which can be done using a CNOT gate. For example, copying the first bit of the address to the data bits of the root node, and then subsequently transferring the first bit of the address to the address bits of the root node, can be achieved using a SWAP gate or other quantum logic gates to exchange data between the data bits and address bits of a node.

[0063] See Figure 7 , Figure 7 This is a schematic diagram of a quantum circuit for implementing data bus input according to an embodiment of the present invention. Data bus input involves transmitting the i-th binary bit of the data bus to the data bit of the root node. For example, the H gate and SWAP gate shown in the diagram can be used. The H gate enables phase encoding during data copying operations, thereby distinguishing between the |0> state of the data bit and the |0> state of non-data bits; that is, encoding the |0> state into... State, |1> state encoding

[0064] In one alternative implementation, the address writing process involves determining the access path in the QRAM. Writing the first address bit differs from writing the other address bits, as the first address is written to the root node, while the other address bits are written to subtree nodes. Specifically, writing the first address involves copying it from the bus to the root node, and then copying it to the data bits of the root node. Writing other address bits requires downward addressing, routing to the corresponding subtree node. Routing can be implemented using controlled SWAP gates. A detailed quantum circuit diagram can be found in [reference needed]. Figure 8 , Figure 8This is a schematic diagram of a quantum circuit for implementing data routing according to an embodiment of the present invention. As shown in the diagram, the layer to which the data is routed is determined by the address of the previous bit. For example, if the address in the p-th address bit of the l-th layer is 0, then the current target bit is routed from the data bit of the p-th node in the l-th layer to the data bit of the 2-th node in the (l+1)-th layer. If the address in the p-th address bit of the l-th layer is 1, then the current target bit is routed from the data bit of the p-th node in the l-th layer to the data bit of the (l+1)-th (2+1)-th node in the (l+1)-th layer.

[0065] See Figure 9 , Figure 9 This is a schematic diagram of another quantum circuit for implementing data routing provided in an embodiment of the present invention. Based on essentially the same principles and methods, Figure 8 and Figure 9 The difference lies in the fact that the different address bits result in different preset addressing methods.

[0066] Figure 8 It can correspond to the first preset addressing, and the first preset addressing can be achieved by the following formula:

[0067]

[0068] Among them, R b This indicates the first preset addressing mode where the address bits are constructed from first-type qubits. |0> and |1> represent the two states of the first-type qubits, respectively. SWAP |0> This represents the SWAP gate controlled by |0>. |1> This indicates a SWAP gate controlled by |1>.

[0069] Figure 9 It can correspond to the second preset addressing, and the second preset addressing can be achieved by the following formula:

[0070]

[0071] Among them, R t The second preset addressing mode is indicated by the address bits being constructed from second-type qubits. |W>, |L>, and |R> represent the three states of the second-type qubits, respectively, and I is the identity matrix.

[0072] It should be noted that the data routing, data copying, and internal exchange operations described above can all be performed in a hierarchical manner. This means that these operations can be applied to the entire layer of a binary tree architecture simultaneously. This parallelism is the foundation for using QRAM to accelerate data processing.

[0073] In one alternative implementation, see [link to implementation details]. Figure 10 , Figure 10This is a schematic diagram of another quantum random access memory architecture provided in an embodiment of the present invention. The quantum random access memory architecture 20 further includes an inversion calculation module 205, which is used to perform inversion calculation on the quantum random access memory architecture to restore the quantum random access memory architecture to its initial state.

[0074] In one alternative implementation, a quantum random access memory (QRAM) architecture typically includes the following components: quantum storage units, quantum control units, quantum error correction units, and transmission interface units. The quantum storage units are the core of the QRAM, typically using qubits or qutrits to store information. The quantum control units are responsible for reading and writing to the quantum storage units. The quantum error correction units implement quantum error correction mechanisms to ensure data integrity. The transmission interface units facilitate data exchange with other computer systems, typically using quantum communication technology. In summary, a quantum random access memory architecture requires efficient quantum control capabilities and a robust quantum error correction mechanism to ensure data integrity and security.

[0075] As can be seen, this invention discloses a quantum random access memory (QRAM) architecture, including a pre-constructed binary tree module, an address routing module, a data extraction module, and an address swapping module. The address routing module determines the path corresponding to the address based on the address and using a preset addressing method. The data extraction module copies each bit of binary data from the current target layer subtree node to the root node according to the path and reads it. The address swapping module swaps one bit of binary data between the address bit and the data bit using a preset quantum circuit. Furthermore, the address routing module, data extraction module, and address swapping module are executed in parallel. By proposing a parallel quantum random access memory architecture, this invention provides a foundation for subsequent implementation of parallel data reading methods based on QRAM, accelerating data processing speed, optimizing time complexity, and reducing the execution error rate of the QRAM architecture.

[0076] This invention also provides a storage medium storing a computer program, wherein the computer program is configured to implement the quantum random access memory architecture described in any of the preceding embodiments when it runs.

[0077] Specifically, in this embodiment, the storage medium may include, but is not limited to, USB flash drives, read-only memory (ROM), random access memory (RAM), portable hard drives, magnetic disks, or optical disks, and other media capable of storing computer programs.

[0078] This invention also provides an electronic device including a memory and a processor, wherein the memory stores a computer program and the processor is configured to run the computer program to implement the quantum random access memory architecture described in any of the preceding embodiments.

[0079] Specifically, the aforementioned electronic device may further include a transmission device and an input / output device, wherein the transmission device is connected to the aforementioned processor, and the input / output device is connected to the aforementioned processor.

[0080] Another embodiment of the present invention provides a quantum computer operating system, the quantum computer operating system including the quantum random access memory architecture as described in any of the preceding claims.

[0081] Another embodiment of the present invention provides a quantum computer, the quantum computer including a quantum computer operating system as described above.

[0082] Specifically, the quantum computer mentioned above may also include a quantum processing unit (QPU) and a quantum random access memory (QRAM). The QPU in the quantum computer is connected to the QRAM via a bus and transmits the state of the address bits and data bits to the root node of the QRAM.

[0083] The above description, based on the embodiments shown in the figures, details the structure, features, and effects of the present invention. The above description is only a preferred embodiment of the present invention, but the present invention is not limited to the scope of implementation shown in the figures. Any changes made in accordance with the concept of the present invention, or equivalent embodiments modified to have equivalent changes, that do not exceed the spirit covered by the specification and figures, should be within the protection scope of the present invention.

Claims

1. A quantum random access memory, characterized by, include: A pre-constructed binary tree module, the binary tree module includes a root node of 1 level and subtree nodes of N-1 levels, each level of the binary tree module includes an address bit and a data bit, and N is the address length; The address routing module includes: a root node routing unit, which starts from the root node and sequentially transfers each bit of the read address to the data bit of the corresponding target layer subtree node; and a subtree node routing unit, which swaps the address bit read from the data bit of the current target layer subtree node to the address bit of the current target layer subtree node, until the path corresponding to the address is generated. The data extraction module is used to copy each bit of binary data of the address from the current target layer subtree node to the root node according to the path, and then read it. The address switching module is used to exchange one bit of binary data on the address bit and the data bit using a preset quantum circuit; The address routing module, the data extraction module, and the address switching module are executed in parallel, and the parallel execution includes reading data of a preset word length once within a preset time sequence. The inversion calculation module is used to perform inversion calculation on the quantum random access memory to restore the quantum random access memory to its initial state.

2. The quantum random access memory of claim 1, wherein, The binary tree module includes a first submodule and a second submodule, wherein the address bits of each layer of the first submodule are constructed from a first type of qubit, and the address bits of each layer of the second submodule are constructed from a second type of qubit.

3. The quantum random access memory of claim 1, wherein, The preset quantum circuit includes H gate, CNOT gate, controlled Z gate, SWAP gate, and controlled SWAP gate.

4. The quantum random access memory according to claim 3, characterized in that, The address routing module also includes: The first preset addressing is achieved by the following formula: in, This indicates a first preset addressing mode where the address bits are constructed from first-type qubits. , These represent the two states of a first-type qubit. express Controlled SWAP door, express Controlled SWAP door; Alternatively, a second preset addressing can be achieved through the following formula: in, This indicates a second preset addressing mode where the address bits are constructed from second-type qubits. These represent the three states of a second-type qubit. It is an identity matrix.

5. A storage medium, characterized in that, The storage medium stores a computer program, wherein the computer program is configured to implement the quantum random access memory as described in any one of claims 1 to 4 when it is run.

6. An electronic device comprising a memory and a processor, characterized in that, The memory stores a computer program, and the processor is configured to run the computer program to implement the quantum random access memory as described in any one of claims 1 to 4.

7. A quantum computer operating system, characterized in that, The quantum computer operating system includes a quantum random access memory as described in any one of claims 1 to 4.

8. A quantum computer, characterized in that, The quantum computer includes a quantum computer operating system as described in claim 7.

Citation Information

Patent Citations

  • Method and device for constructing quantum circuit for QRAM (Quantum Random Access Memory) architecture

    CN114638368A

  • QRAM architecture quantum circuit construction method and apparatus, and quantum address data analysis method and apparatus

    WO2022110705A1