CN118153701A - Method and device for constructing quantum data structure - Google Patents
Method and device for constructing quantum data structure Download PDFInfo
- Publication number
- CN118153701A CN118153701A CN202211510897.3A CN202211510897A CN118153701A CN 118153701 A CN118153701 A CN 118153701A CN 202211510897 A CN202211510897 A CN 202211510897A CN 118153701 A CN118153701 A CN 118153701A
- Authority
- CN
- China
- Prior art keywords
- address
- quantum
- data structure
- target
- constructing
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 39
- 238000002360 preparation method Methods 0.000 claims abstract description 17
- 230000008520 organization Effects 0.000 claims abstract description 13
- 238000013507 mapping Methods 0.000 claims description 46
- 238000004422 calculation algorithm Methods 0.000 claims description 18
- 238000004590 computer program Methods 0.000 claims description 15
- 238000010276 construction Methods 0.000 claims description 15
- 238000003860 storage Methods 0.000 claims description 9
- 239000002096 quantum dot Substances 0.000 description 13
- 239000011159 matrix material Substances 0.000 description 11
- 239000013598 vector Substances 0.000 description 11
- 230000006870 function Effects 0.000 description 9
- 230000005540 biological transmission Effects 0.000 description 6
- 238000010586 diagram Methods 0.000 description 6
- 238000005259 measurement Methods 0.000 description 6
- 238000012545 processing Methods 0.000 description 6
- 238000013461 design Methods 0.000 description 5
- 238000004088 simulation Methods 0.000 description 5
- 238000004364 calculation method Methods 0.000 description 4
- 230000000694 effects Effects 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 230000005610 quantum mechanics Effects 0.000 description 3
- XUIMIQQOPSSXEZ-UHFFFAOYSA-N Silicon Chemical compound [Si] XUIMIQQOPSSXEZ-UHFFFAOYSA-N 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 229910052710 silicon Inorganic materials 0.000 description 2
- 239000010703 silicon Substances 0.000 description 2
- 230000008859 change Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000013401 experimental design Methods 0.000 description 1
- 239000002184 metal Substances 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
- 238000005303 weighing Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N10/00—Quantum computing, i.e. information processing based on quantum-mechanical phenomena
- G06N10/60—Quantum algorithms, e.g. based on quantum optimisation, quantum Fourier or Hadamard transforms
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N10/00—Quantum computing, i.e. information processing based on quantum-mechanical phenomena
- G06N10/20—Models of quantum computing, e.g. quantum circuits or universal quantum computers
Landscapes
- Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Mathematical Analysis (AREA)
- Data Mining & Analysis (AREA)
- Evolutionary Computation (AREA)
- Condensed Matter Physics & Semiconductors (AREA)
- Computational Mathematics (AREA)
- Mathematical Optimization (AREA)
- Pure & Applied Mathematics (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Artificial Intelligence (AREA)
- Memory System (AREA)
Abstract
The invention discloses a method and a device for constructing a quantum data structure, wherein the method comprises the following steps: firstly, determining an original data structure of a target object, wherein each target object comprises a plurality of elements, respectively determining a first address corresponding to each element in the target object, respectively acquiring a target quantum state corresponding to each element by using a QRAM-based quantum state preparation method according to each element in the target object and the first address corresponding to each element, and constructing a quantum data structure with the same organization form as the original data structure according to all the target quantum states.
Description
Technical Field
The invention belongs to the technical field of quantum computing, and particularly relates to a method and a device for constructing a quantum data structure.
Background
The quantum computing simulation is a simulation computation which simulates and follows the law of quantum mechanics by means of numerical computation and computer science, and is taken as a simulation program, and the high-speed computing capability of a computer is utilized to characterize the space-time evolution of the quantum state according to the basic law of quantum bits of the quantum mechanics.
Along with the continuous perfection of quantum computing theory, the quantum computer may become an important tool for scientific researchers to explain scientific phenomena, predict simulation results and guide experimental design in the future. The importance of RAM for hardware in analog classical computer architectures is generalized to quantum computers, and a similar architecture to RAM is also required, so QRAM has evolved.
Currently, in research work simulating the QRAM architecture, how to realize loading and storing data based on the QRAM architecture on a computer and convert a classical data structure into a quantum data structure is considered to be a problem to be solved urgently.
Disclosure of Invention
The invention aims to provide a method and a device for constructing a quantum data structure, which solve the defects in the prior art, and the method converts classical data into quantum data by providing a novel method for constructing the quantum data structure, thereby providing key support for subsequent processing of large-scale, high-dimensional and unstructured data and realization of a quantum algorithm.
One embodiment of the present application provides a method for constructing a quantum data structure, the method comprising:
Determining an original data structure of target objects, wherein each target object comprises a plurality of elements;
Respectively determining a first address corresponding to each element in the target object;
According to each element in the target object and the first address corresponding to each element, respectively acquiring a target quantum state corresponding to each element by using a quantum state preparation method based on QRAM;
and constructing a quantum data structure with the same organization form as the original data structure according to all the target quantum states.
Optionally, the obtaining, according to each element in the target object and the first address corresponding to each element, the target quantum state corresponding to each element by using a QRAM-based quantum state preparation method includes:
Obtaining a mapping relation between each element and each element target quantum state;
Constructing a second address corresponding to the first address under the current mapping relation based on the first address corresponding to each element and the mapping relation;
And according to the second address, respectively accessing the original data structure to obtain the target quantum state corresponding to each element.
Optionally, the constructing, based on the first address corresponding to each element and the mapping relationship, a second address corresponding to the first address in the current mapping relationship includes:
Determining a preset addressing algorithm according to the mapping relation;
and constructing a second address corresponding to the first address under the current mapping relation by utilizing the preset addressing algorithm.
Optionally, the constructing a second address corresponding to the first address under the current mapping relationship includes:
Constructing a second address corresponding to the first address under the current mapping relation by the following method:
Where i represents a first address, i ′ represents a second address, and x represents an element contained in the target object.
Optionally, accessing the original data structure according to the second address to obtain the target quantum state corresponding to each element includes:
the target quantum state corresponding to each element is obtained by the following steps:
|i′>|x>→|i′>|di>
Where d i represents the original data structure accessed according to the second address, |d i > represents the target quantum state for each element.
Yet another embodiment of the present application provides an apparatus for constructing a quantum data structure, the apparatus including:
The first acquisition module is used for determining an original data structure of target objects, wherein each target object comprises a plurality of elements;
the determining module is used for respectively determining a first address corresponding to each element in the target object;
The second acquisition module is used for respectively acquiring the target quantum state corresponding to each element by utilizing a quantum state preparation method based on QRAM according to each element in the target object and the first address corresponding to each element;
And the construction module is used for constructing a quantum data structure with the same organization form as the original data structure according to all the target quantum states.
Optionally, the second obtaining module includes:
an obtaining unit, configured to obtain a mapping relationship between each element and the target quantum state of each element;
The construction unit is used for constructing a second address corresponding to the first address under the current mapping relation based on the first address corresponding to each element and the mapping relation;
And the access unit is used for respectively accessing the original data structure according to the second address to obtain the target quantum state corresponding to each element.
Optionally, the construction unit includes:
a determining subunit, configured to determine a preset addressing algorithm according to the mapping relationship;
And the construction subunit is used for constructing a second address corresponding to the first address under the current mapping relation by utilizing the preset addressing algorithm.
A further embodiment of the application provides a storage medium having a computer program stored therein, wherein the computer program is arranged to implement the method of any of the preceding claims when run.
Yet another embodiment of the application provides an electronic device comprising a memory having a computer program stored therein and a processor configured to run the computer program to implement the method described in any of the above.
Compared with the prior art, the method comprises the steps of firstly determining the original data structure of target objects, respectively determining the first address corresponding to each element in the target objects, respectively obtaining the target quantum state corresponding to each element by using a QRAM-based quantum state preparation method according to each element in the target objects and the first address corresponding to each element, respectively constructing a quantum data structure with the same organization form as the original data structure according to all the target quantum states, and converting classical data into quantum data by providing a new quantum data structure construction method so as to provide key support for subsequent processing of large-scale, high-dimensional and unstructured data and realization of quantum algorithms.
Drawings
Fig. 1 is a hardware block diagram of a computer terminal according to a method for constructing a quantum data structure according to an embodiment of the present invention;
fig. 2 is a flow chart of a method for constructing a quantum data structure according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a binary tree structure corresponding to a target object according to an embodiment of the present invention;
Fig. 4 is a schematic structural diagram of a device for constructing a quantum data structure according to an embodiment of the present invention.
Detailed Description
The embodiments described below by referring to the drawings are illustrative only and are not to be construed as limiting the invention.
The embodiment of the invention firstly provides a method for constructing a quantum data structure, which can be applied to electronic equipment such as a computer terminal, in particular to a common computer, a quantum computer and the like.
The following describes the operation of the computer terminal in detail by taking it as an example. Fig. 1 is a hardware block diagram of a computer terminal according to a method for constructing a quantum data structure according to an embodiment of the present invention. As shown in fig. 1, the computer terminal may include one or more (only one is shown in fig. 1) processors 102 (the processor 102 may include, but is not limited to, a microprocessor MCU or a processing device such as a programmable logic device FPGA) and a memory 104 for storing data, and optionally, a transmission device 106 for communication functions and an input-output device 108. It will be appreciated by those skilled in the art that the configuration shown in fig. 1 is merely illustrative and is not intended to limit the configuration of the computer terminal described above. For example, the computer terminal may also include more or fewer components than shown in FIG. 1, or have a different configuration than shown in FIG. 1.
The memory 104 may be used to store software programs and modules of application software, such as program instructions/modules corresponding to the method for constructing a quantum data structure in the embodiment of the present application, and the processor 102 executes the software programs and modules stored in the memory 104, thereby performing various functional applications and data processing, that is, implementing the method described above. Memory 104 may include high-speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, the memory 104 may further include memory remotely located relative to the processor 102, which may be connected to the computer terminal via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The transmission means 106 is arranged to receive or transmit data via a network. Specific examples of the network described above may include a wireless network provided by a communication provider of a computer terminal. In one example, the transmission device 106 includes a network adapter (Network Interface Controller, NIC) that can connect to other network devices through a base station to communicate with the internet. In one example, the transmission device 106 may be a Radio Frequency (RF) module for communicating with the internet wirelessly.
It should be noted that a real quantum computer is a hybrid structure, which includes two major parts: part of the computers are classical computers and are responsible for performing classical computation and control; the other part is quantum equipment, which is responsible for running quantum programs so as to realize quantum computation. The quantum program is a series of instruction sequences written in a quantum language such as QRunes language and capable of running on a quantum computer, so that the support of quantum logic gate operation is realized, and finally, quantum computing is realized. Specifically, the quantum program is a series of instruction sequences for operating the quantum logic gate according to a certain time sequence.
In practical applications, quantum computing simulations are often required to verify quantum algorithms, quantum applications, etc., due to the development of quantum device hardware. Quantum computing simulation is a process of realizing simulated operation of a quantum program corresponding to a specific problem by means of a virtual architecture (namely a quantum virtual machine) built by resources of a common computer. In general, it is necessary to construct a quantum program corresponding to a specific problem. The quantum program, namely the program for representing the quantum bit and the evolution thereof written in the classical language, wherein the quantum bit, the quantum logic gate and the like related to quantum computation are all represented by corresponding classical codes.
Quantum circuits, which are one embodiment of quantum programs, also weigh sub-logic circuits, are the most commonly used general quantum computing models, representing circuits that operate on qubits under an abstract concept, the composition of which includes qubits, circuits (timelines), and various quantum logic gates, and finally the results often need to be read out by quantum measurement operations.
Unlike conventional circuits, which are connected by metal lines to carry voltage or current signals, in a quantum circuit, the circuit can be seen as being connected by time, i.e., the state of the qubit naturally evolves over time, as indicated by the hamiltonian operator, during which it is operated until a logic gate is encountered.
One quantum program is corresponding to one total quantum circuit, and the quantum program refers to the total quantum circuit, wherein the total number of quantum bits in the total quantum circuit is the same as the total number of quantum bits of the quantum program. It can be understood that: one quantum program may consist of a quantum circuit, a measurement operation for the quantum bits in the quantum circuit, a register to hold the measurement results, and a control flow node (jump instruction), and one quantum circuit may contain several tens to hundreds or even thousands of quantum logic gate operations. The execution process of the quantum program is a process of executing all quantum logic gates according to a certain time sequence. Note that the timing is the time sequence in which a single quantum logic gate is executed.
It should also be noted that the present invention relates to a quantum computer, in which the unit of the processing chip is a CMOS tube in a common computing device based on a silicon chip, such a computing unit is not limited by time and dryness, i.e. such a computing unit is not limited by the length of time of use, and is ready to use. Furthermore, currently, the number of such calculation units in a silicon chip is sufficient, i.e. the number of calculation units in one chip is thousands of at present. The number of computational cells is sufficient and the CMOS transistor selectable computational logic is fixed, for example: and AND logic. When the CMOS tube is used for operation, a large number of CMOS tubes are combined with limited logic functions, so that the operation effect is realized.
Unlike such logic units in conventional computing devices, in current quantum computers the basic computing unit is a qubit, the input of which is limited by coherence and also by coherence time, i.e. the qubit is limited in terms of time of use and is not readily available. Full use of qubits within the usable lifetime of the qubits is a critical challenge for quantum computing. Furthermore, the number of qubits in a quantum computer is a critical challenge for quantum computing. Furthermore, the number of qubits in a quantum computer is one of the representative indicators of the performance of the quantum computer, each of the qubits realizes a calculation function by a logic function configured as needed, whereas the logic function in the field of quantum calculation is diversified in view of the limited number of qubits, for example: hadamard gates (Hadamard gates, H gates), brix-gates (X gates), brix-Y gates (Y gates), brix-Z gates (Z gates), RX gates, RY gates, RZ gates, CNOT gates, CR gates, iSWAP gates, toffoli gates, and the like. Quantum logic gates are typically represented using unitary matrices, which are not only in matrix form, but also an operation and transformation. The effect of a general quantum logic gate on a quantum state is calculated by multiplying the unitary matrix by the matrix corresponding to the right vector of the quantum state. During quantum computation, the operation effect is realized by combining limited quantum bits with various logic function combinations.
Based on these differences of the quantum computer, the design of the logic function on the quantum bits (including the design of whether the quantum bits are used or not and the design of the use efficiency of each quantum bit) is a key for improving the operation performance of the quantum computer, and special design is required. The above design for qubits is a technical problem that is not considered nor faced by common computing devices.
It will be appreciated by those skilled in the art that in classical computers, the basic unit of information is a bit, one bit having two states, 0 and 1, the most common physical implementation being to represent both states by the level of high and low. In quantum computing, the basic unit of information is a qubit, and one qubit has two states of 0 and 1, namely |0 > and |1 >, but can be in a superposition state of the two states of 0 and 1, and can be expressed asWhere a, b are complex numbers representing the amplitude (probability amplitude) of the 0 state and 1 state, which is not possessed by the classical bit. After measurement, the state of the qubit collapses to a certain state (eigenstate, here |0 > state, |1 > state), where the probability of collapsing to |0 > is |a| 2 and the probability of collapsing to |1 > is |b| 2,|a|2+|b|2 =1, | > is the dirac symbol.
Quantum states, i.e., states of qubits, generally require the use of a set of orthographically complete basis vector descriptions, the computational basis typically used for which is represented in binary in a quantum algorithm (or weighing subroutine). For example, a group of qubits q0, q1, q2, representing the 0 th, 1 st, and 2 nd qubits, ordered from high order to low order as q2q1q0, the quantum state of the group of qubits being the superposition of 2 3 computation bases, the 8 computation bases referring to: each computation basis corresponds to a qubit, i.e., in the state of i 000> and q2q1q0 from high to low, i.e., in the state of i 000> and i 001 and i 010 and i 011 and i 100 and i 101 and i 110 and i 111. In short, a quantum state is an overlapped state composed of basis vectors, when the probability amplitude of other basis is 0, that is, at one of the determined basis vectors.
In quantum mechanics, all measurable mechanical quantities can be described by a hermite matrix, which is defined as the transposed conjugate of the matrix, i.e. the matrix itself, i.e. there is: Such a matrix is generally called a measurement operator, and the non-zero operator will have at least one eigenvalue λ other than 0 and its corresponding eigenvalue |ψ >, satisfying h|ψ=λ|ψ >, and if the eigenvalue of the operator H corresponds to the energy level of a certain system, such an operator may also be called Hamiltonian (Hamiltonian).
According to the schrodinger equation, the evolution from one state |ψ (t=0) > to another state |ψ (t=t) > is completed by using a unitary operator, namely U (0, T) |ψ (t=0) > = |ψ (t=t) >, wherein the relationship between the hamiltonian and the unitary operator is that if one quantum state naturally evolves under a certain system, the energy of the system, i.e. the hamiltonian, is described, the unitary operator can be written by the hamiltonian:
When the system starts at time 0 and the hamiltonian does not change over time, the unitary operator, i.e., u=exp (-iHt). In quantum computing in a closed system, all quantum operations, except for measurements, can be described by a unitary matrix, which is defined as the transposed conjugate of the matrix, i.e., the inverse of the matrix, i.e., there is: In general, unitary operators are also known as quantum logic gates in quantum computing.
Referring to fig. 2, fig. 2 is a flow chart of a method for constructing a quantum data structure according to an embodiment of the present invention, which may include the following steps:
s201: an original data structure of target objects is determined, wherein each target object contains a plurality of elements.
In particular, a data structure is a collection of data elements that have a certain logical relationship, apply a certain storage structure in a computer, and encapsulate a corresponding operation. It may contain the contents of three aspects, logical relationships, storage relationships, and operations. The problem to be solved corresponding to the original data structure in the embodiment of the present invention may be a specific linear or nonlinear equation set to be solved, a quantum approximation optimization algorithm problem, or other system problems to be solved, which is not limited herein.
For example, a problem to be solved may be first obtained, and an original data structure corresponding to a target object in the problem to be solved may be determined, and each target object may include a plurality of elements. For example, the problem to be solved is to solve a linear equation set ax=b, and the target object is a matrix a and a vector b, which is illustrated in further step by taking the vector b as an example, where the vector b may include 16 elements, for example, a vector b= [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15].
It should be noted that after determining the original data structure of the target object, the method may further include: according to the obtained target object and a plurality of elements of the target object, the memory layout corresponding to the QRAM architecture model can be determined.
The first address, the memory layout and the data type of the QRAM architecture model can be determined according to the data size of the target object. The first address is understood to be the address of the first unit in the storage area occupied by the variable, the memory layout includes determining address bits and data bits, and the data type may be complex data type, int or double, etc.
In the above example, the vector b to be solved contains 16 elements, so if at least 4 quantum bits are needed to prepare the quantum states corresponding to the 16 elements, [ q 0,q1,q2,q3 ] respectively, q 0 and q 1 may be designated as address bits, q 2 and q 3 may be designated as address bits, q 0 and q 2 may be designated as address bits, and q 1 and q 3 may be designated as data bits, which is not limited herein.
Therefore, a QRAM architecture model can be initialized through the first address and the memory layout and the corresponding data types, wherein the first address and the memory layout mainly determine each corresponding physical qubit when the QRAM architecture model is simulated, and the corresponding data types mainly describe elements in a target object to be subjected to quantum state preparation.
S202: and respectively determining a first address corresponding to each element in the target object.
In an alternative embodiment, determining the first address corresponding to each element in the target object may include:
1. and constructing a binary tree corresponding to the target object according to the target object.
Specifically, a binary tree is an important nonlinear data structure, and is characterized in that each node has at most two back nodes, and the subtrees of the binary tree have left and right branches.
Constructing a binary tree structure corresponding to a target object in the present application can be understood as an inverted binary tree structure, wherein the node of each tree includes a qubit and a qutrit, and qutrit is used to indicate a path, which is called a first address (router); the qubit is used to store data, called data.
2. And distributing branches to the target object based on the binary tree so as to obtain a first address corresponding to each element in the target object.
Referring to fig. 3, an exemplary schematic diagram of a binary tree structure corresponding to a target object according to an embodiment of the present invention includes 16 leaf nodes, which may respectively correspond to the vectors including 16 elements, and obtain a path of the target object and a first address thereof with a root node as a starting point, by way of example, the path corresponding to element 0 in the above vector b= [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15] may be represented as 0→0→0→0, so the first address corresponding to element 0 is [0000], according to the same method and principle, the first addresses corresponding to the other target objects can be obtained, which will not be described herein.
S203: and respectively acquiring the target quantum state corresponding to each element by using a quantum state preparation method based on QRAM according to each element in the target object and the first address corresponding to each element.
Specifically, according to each element in the target object and the first address corresponding to each element, respectively obtaining the target quantum state corresponding to each element by using a QRAM-based quantum state preparation method, may include:
Step 1: and obtaining the mapping relation between each element and the target quantum state of each element.
Step 2: and constructing a second address corresponding to the first address under the current mapping relation based on the first address corresponding to each element and the mapping relation.
Specifically, constructing, based on the first address corresponding to each element and the mapping relationship, a second address corresponding to the first address under the current mapping relationship may include: determining a preset addressing algorithm according to the mapping relation; and constructing a second address corresponding to the first address under the current mapping relation by utilizing the preset addressing algorithm.
For example, the mapping relationship between each element in the target object and the target quantum state of each element is mod 2 addition, the first address corresponding to one element in the target object is [0011], the first two bits [00] of the first address memory layout are address bits, the second two bits [11] are data bits, and the first two bits are represented as: And obtaining a second address [1111] corresponding to the first address [0011] under the current mapping relation.
In an optional implementation manner, the constructing a second address corresponding to the first address in the current mapping relationship may include: constructing a second address corresponding to the first address under the current mapping relation by the following method:
Where i represents a first address, i ′ represents a second address, and x represents an element contained in the target object.
It should be noted that, the main function of the mapping manner is to combine the QRAM architecture model with the quantum virtual machine, so that the QRAM architecture model function can be integrated into the quantum software related to quantum computing. As for mapping, simply stated, it is the correspondence between two isomorphic sets.
Step 3: and according to the second address, respectively accessing the original data structure to obtain the target quantum state corresponding to each element.
Specifically, according to the second address, accessing the original data structure respectively to obtain the target quantum state corresponding to each element may include: determining a path corresponding to the second address based on the second address; and according to the path corresponding to the second address, respectively accessing and obtaining an original data structure corresponding to the path to generate a target quantum state corresponding to each element.
In an optional implementation manner, the accessing the original data structure according to the second address to obtain the target quantum state corresponding to each element may include:
the target quantum state corresponding to each element is obtained by the following steps:
|i′〉|x〉→|i′〉|di〉
Where d i represents the original data structure accessed according to the second address, |d i > represents the target quantum state for each element.
For example, referring to fig. 3, firstly, a path corresponding to the second address may be obtained according to the second address [1111], and then marked or lightened (Route), secondly, the corresponding element to be accessed is copied (DATA FETCH), that is, the element [15] is copied and obtained according to the path corresponding to the second address, then the corresponding target quantum state |1111 > is obtained, and finally, the whole system may be restored and restored to be convenient for performing the next quantum state preparation operation.
S204: and constructing a quantum data structure with the same organization form as the original data structure according to all the target quantum states.
Specifically, by the steps S201 to S203, superposition state addressing of data is realized, and corresponding target objects are accessed, so that corresponding elements (similar to load operation in a classical computer instruction system) can be loaded, a group of classical-control non operations are completed through a classical controller, so that conversion work from classical data to quantum data is completed, finally, quantum state construction is realized, and a quantum data structure with the same organization form as an original data structure is constructed according to all target quantum states.
It can be seen that the present invention firstly determines the original data structure of the target objects, each target object includes several elements, respectively determines the first address corresponding to each element in the target object, and according to each element in the target object and the first address corresponding to each element, respectively obtains the target quantum state corresponding to each element by using the QRAM-based quantum state preparation method, and constructs the quantum data structure with the same organization form as the original data structure according to all the target quantum states.
Referring to fig. 4, fig. 4 is a schematic structural diagram of a device for constructing a quantum data structure according to an embodiment of the present invention, which corresponds to the flow shown in fig. 2, and may include:
yet another embodiment of the present application provides an apparatus for constructing a quantum data structure, the apparatus including:
A first obtaining module 401, configured to determine an original data structure of a target object, where each target object includes a plurality of elements;
a determining module 402, configured to determine a first address corresponding to each element in the target object;
a second obtaining module 403, configured to obtain, according to each element in the target object and a first address corresponding to each element, a target quantum state corresponding to each element by using a QRAM-based quantum state preparation method;
A construction module 404, configured to construct a quantum data structure with the same organization form as the original data structure according to all the target quantum states.
Specifically, the second obtaining module includes:
an obtaining unit, configured to obtain a mapping relationship between each element and the target quantum state of each element;
The construction unit is used for constructing a second address corresponding to the first address under the current mapping relation based on the first address corresponding to each element and the mapping relation;
And the access unit is used for respectively accessing the original data structure according to the second address to obtain the target quantum state corresponding to each element.
Specifically, the construction unit includes:
a determining subunit, configured to determine a preset addressing algorithm according to the mapping relationship;
And the construction subunit is used for constructing a second address corresponding to the first address under the current mapping relation by utilizing the preset addressing algorithm.
Compared with the prior art, the method comprises the steps of firstly determining the original data structure of target objects, respectively determining the first address corresponding to each element in the target objects, respectively obtaining the target quantum state corresponding to each element by using a QRAM-based quantum state preparation method according to each element in the target objects and the first address corresponding to each element, respectively constructing a quantum data structure with the same organization form as the original data structure according to all the target quantum states, and converting classical data into quantum data by providing a new quantum data structure construction method so as to provide key support for subsequent processing of large-scale, high-dimensional and unstructured data and realization of quantum algorithms.
The embodiment of the invention also provides a storage medium in which a computer program is stored, wherein the computer program is configured to implement the steps of the method embodiment of any one of the above when run.
Specifically, in the present embodiment, the above-described storage medium may be configured to store a computer program for realizing the steps of:
s201: determining an original data structure of target objects, wherein each target object comprises a plurality of elements;
S202: respectively determining a first address corresponding to each element in the target object;
S203: according to each element in the target object and the first address corresponding to each element, respectively acquiring a target quantum state corresponding to each element by using a quantum state preparation method based on QRAM;
S204: and constructing a quantum data structure with the same organization form as the original data structure according to all the target quantum states.
Specifically, in the present embodiment, the storage medium may include, but is not limited to: a usb disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory RAM), a removable hard disk, a magnetic disk, or an optical disk, or other various media capable of storing a computer program.
An embodiment of the invention also provides an electronic device comprising a memory having stored therein a computer program and a processor arranged to run the computer program to implement the steps of the method embodiment of any of the above.
Specifically, the electronic apparatus may further include a transmission device and an input/output device, where the transmission device is connected to the processor, and the input/output device is connected to the processor.
Specifically, in this embodiment, the above-mentioned processor may be configured to implement the following steps by a computer program:
s201: determining an original data structure of target objects, wherein each target object comprises a plurality of elements;
S202: respectively determining a first address corresponding to each element in the target object;
S203: according to each element in the target object and the first address corresponding to each element, respectively acquiring a target quantum state corresponding to each element by using a quantum state preparation method based on QRAM;
S204: and constructing a quantum data structure with the same organization form as the original data structure according to all the target quantum states.
While the foregoing is directed to embodiments of the present invention, other and further embodiments of the invention may be devised without departing from the basic scope thereof, and the scope thereof is determined by the claims that follow.
Claims (10)
1. A method of constructing a quantum data structure, the method comprising:
Determining an original data structure of target objects, wherein each target object comprises a plurality of elements;
Respectively determining a first address corresponding to each element in the target object;
According to each element in the target object and the first address corresponding to each element, respectively acquiring a target quantum state corresponding to each element by using a quantum state preparation method based on QRAM;
and constructing a quantum data structure with the same organization form as the original data structure according to all the target quantum states.
2. The method according to claim 1, wherein the obtaining, according to each element in the target object and the first address corresponding to each element, the target quantum state corresponding to each element by using a QRAM-based quantum state preparation method includes:
Obtaining a mapping relation between each element and each element target quantum state;
Constructing a second address corresponding to the first address under the current mapping relation based on the first address corresponding to each element and the mapping relation;
And according to the second address, respectively accessing the original data structure to obtain the target quantum state corresponding to each element.
3. The method according to claim 2, wherein constructing a second address corresponding to the first address in the current mapping relationship based on the first address corresponding to each element and the mapping relationship, includes:
Determining a preset addressing algorithm according to the mapping relation;
and constructing a second address corresponding to the first address under the current mapping relation by utilizing the preset addressing algorithm.
4. A method according to claim 3, wherein said constructing a second address corresponding to said first address in said mapping at present comprises:
Constructing a second address corresponding to the first address under the current mapping relation by the following method:
Where i represents a first address, i ′ represents a second address, and x represents an element contained in the target object.
5. The method according to claim 2, wherein accessing the original data structure according to the second address, respectively, to obtain the target quantum state corresponding to each element, includes:
the target quantum state corresponding to each element is obtained by the following steps:
|i′>|x>→|i′>|i>
Where d i represents the original data structure accessed according to the second address, | i > represents the target quantum state for each element.
6. A device for building a quantum data structure, the device comprising:
The first acquisition module is used for determining an original data structure of target objects, wherein each target object comprises a plurality of elements;
the determining module is used for respectively determining a first address corresponding to each element in the target object;
The second acquisition module is used for respectively acquiring the target quantum state corresponding to each element by utilizing a quantum state preparation method based on QRAM according to each element in the target object and the first address corresponding to each element;
And the construction module is used for constructing a quantum data structure with the same organization form as the original data structure according to all the target quantum states.
7. The apparatus of claim 6, wherein the second acquisition module comprises:
an obtaining unit, configured to obtain a mapping relationship between each element and the target quantum state of each element;
The construction unit is used for constructing a second address corresponding to the first address under the current mapping relation based on the first address corresponding to each element and the mapping relation;
And the access unit is used for respectively accessing the original data structure according to the second address to obtain the target quantum state corresponding to each element.
8. The apparatus of claim 6, wherein the construction unit comprises:
a determining subunit, configured to determine a preset addressing algorithm according to the mapping relationship;
And the construction subunit is used for constructing a second address corresponding to the first address under the current mapping relation by utilizing the preset addressing algorithm.
9. A storage medium having a computer program stored therein, wherein the computer program is arranged to implement the method of any of claims 1 to 5 when run.
10. An electronic device comprising a memory and a processor, characterized in that the memory has stored therein a computer program, the processor being arranged to run the computer program to implement the method of any of the claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211510897.3A CN118153701A (en) | 2022-11-29 | 2022-11-29 | Method and device for constructing quantum data structure |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211510897.3A CN118153701A (en) | 2022-11-29 | 2022-11-29 | Method and device for constructing quantum data structure |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN118153701A true CN118153701A (en) | 2024-06-07 |
Family
ID=91287295
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211510897.3A Pending CN118153701A (en) | 2022-11-29 | 2022-11-29 | Method and device for constructing quantum data structure |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN118153701A (en) |
-
2022
- 2022-11-29 CN CN202211510897.3A patent/CN118153701A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110825375B (en) | Quantum program conversion method and device, storage medium and electronic device | |
| CN112114776B (en) | Quantum multiplication method, device, electronic device and storage medium | |
| CN110826719A (en) | Quantum program processing method and device, storage medium and electronic device | |
| CN113222155B (en) | Quantum circuit construction method and device, electronic device and storage medium | |
| CN111461335A (en) | Noise-containing single-quantum logic gate implementation method and device based on MPI (Multi-processor interface) multi-process | |
| CN114511094B (en) | Quantum algorithm optimization method and device, storage medium and electronic device | |
| CN116090568B (en) | Method and device for determining size relation between quantum data and classical floating point data | |
| CN115879562B (en) | Quantum program initial mapping determination method and device and quantum computer | |
| CN113222157A (en) | Quantum simulation method and device, electronic device and storage medium | |
| CN116011681A (en) | Meteorological data prediction method and device, storage medium and electronic device | |
| CN118153701A (en) | Method and device for constructing quantum data structure | |
| CN114881238A (en) | Method and apparatus for constructing quantum discriminator, medium, and electronic apparatus | |
| CN114881239A (en) | Method and apparatus for constructing quantum generator, medium, and electronic apparatus | |
| CN118153695A (en) | Quantum state preparation method and device | |
| CN114512193A (en) | Method for preparing system test state based on spin symmetry and equivalent particle characteristics | |
| CN115114569A (en) | Nonlinear partial differential equation solving method and device based on quantum line | |
| CN115700572B (en) | Quantum solving method and device for grid equation and physical equation iteration | |
| CN116050528B (en) | Method and device for constructing amplitude amplification circuit, medium and electronic device | |
| CN115713122B (en) | Method and device for determining size relation between quantum data and classical data | |
| CN115879558B (en) | Method and device for comparing sizes of multiple quantum states | |
| CN115879557B (en) | Quantum circuit-based data size comparison method and device and quantum computer | |
| CN114638366B (en) | Quantum address data analysis method and device, storage medium and electronic device | |
| CN115907016B (en) | Quantum-based method for calculating search target range value and related device | |
| CN117669757A (en) | Hamiltonian volume construction method and device | |
| CN115879560B (en) | Equivalent relation judging method and device for quantum data and classical data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |