CN112132614A

CN112132614A - Method and device for performing preference prediction demonstration by using quantum circuit

Info

Publication number: CN112132614A
Application number: CN202010990195.4A
Authority: CN
Inventors: 李蕾; 方圆; 窦猛汉
Original assignee: Origin Quantum Computing Technology Co Ltd
Current assignee: Origin Quantum Computing Technology Co Ltd
Priority date: 2020-09-18
Filing date: 2020-09-18
Publication date: 2020-12-25
Anticipated expiration: 2040-09-18
Also published as: CN112132614B

Abstract

The invention discloses a method and a device for performing preference prediction demonstration by using a quantum circuit, wherein the method comprises the following steps: acquiring transaction data corresponding to the data type, and displaying the transaction data in a first display area of a terminal interface; acquiring transaction data marked by the marking instruction as preference data of a user, and performing differential display on the preference data; constructing and operating a first quantum circuit which is encoded with transaction indexes, transaction data and preference data to be inquired, outputting a quantum state containing each transaction index and a first amplitude corresponding to the quantum state, and determining an item set containing the preference data in a transaction database and probability distribution corresponding to the rest transaction data in the item set according to the quantum state and the first amplitude corresponding to the quantum state; and finally, determining a preference prediction result of the user from the item set and displaying the preference prediction result on a terminal interface, and solving the defects of more time consumption and lower efficiency in preference prediction demonstration in the prior art by utilizing the parallel characteristic of a quantum algorithm.

Description

Method and device for performing preference prediction demonstration by using quantum circuit

Technical Field

The invention belongs to the technical field of quantum computing, and particularly relates to a method and a device for performing preference prediction demonstration by using a quantum circuit.

Background

Quantum computers are physical devices that perform high-speed mathematical and logical operations, store and process quantum information in compliance with the laws of quantum mechanics. When a device processes and calculates quantum information and runs quantum algorithms, the device is a quantum computer. Quantum computers are a key technology under study because they have the ability to handle mathematical problems more efficiently than ordinary computers, for example, they can speed up the time to break RSA keys from hundreds of years to hours.

The quantum computation simulation is a simulation computation which simulates and follows the law of quantum mechanics by means of numerical computation and computer science, and is used as a simulation program which describes the space-time evolution of quantum states by utilizing the high-speed computing capability of a computer according to the basic law of quantum bits of the quantum mechanics.

Association rule mining is used to describe the association between things and to mine the relevance between things, it is to search the transaction database for explicit or implicit relationships that exist between two items, facilitating management and decision making. The core of the method is to obtain a frequent item set through statistical data items, and the method is widely applied to the fields of classification design, bundled sales, warehouse storage and inventory configuration and the like and is a research hotspot for analyzing and processing current big data.

In real life, the association rule reflects the interdependency and association between one thing and other things, and is commonly used in a recommendation system of an entity store or an online e-commerce: the method aims to find the inherent commonalities of the purchasing habits of the customer groups, such as the probability of purchasing the product A and the product B, through carrying out association rule mining on the purchasing transaction database of the customer, and according to the mining result, the layout and display of the goods shelf are adjusted, and a sales promotion combination scheme is designed, so that the sales volume is improved.

In the prior art, an item set meeting preference data selected by a user is searched in a large number of transaction databases to predict and display possible preference selections of the user, the databases need to be completely scanned once for each search through an iterative method, the traditional serial mode has very low efficiency and processing capacity which can generate a bottleneck, and much time is consumed when the user triggers the operation of predicting results.

Based on this, it is necessary to construct a quantum line by using the parallel characteristic of the quantum algorithm to solve the disadvantages of the prior art that the preference prediction demonstration is time-consuming and low in efficiency.

Disclosure of Invention

The invention aims to provide a method and a device for performing preference prediction demonstration by using a quantum circuit, which are used for solving the defects in the prior art, can realize the design of the quantum circuit in the field of quantum computation, and are used for solving the defects of more time consumption and lower efficiency in performing the preference prediction demonstration in the prior art.

One embodiment of the present application provides a method for preference prediction demonstration using quantum wires, the method comprising:

when a selection instruction aiming at a transaction data type triggered by a user is received, acquiring transaction data corresponding to the data type, and displaying the transaction data in a first display area of a terminal interface;

when a marking instruction of the transaction data triggered by a user is received, acquiring the transaction data marked by the marking instruction as preference data of the user, and performing differential display on the preference data;

when a preference prediction instruction triggered by a user is received, acquiring a transaction database containing a transaction index and transaction data corresponding to the transaction index, and constructing a first quantum circuit encoded with the transaction index, the transaction data and the preference data to be inquired; the first quantum circuit is used for inquiring a transaction index corresponding to the preference data;

operating the first quantum circuit, outputting a quantum state containing each transaction index and a corresponding first amplitude, and determining an item set containing the preference data in the transaction database and probability distribution corresponding to other transaction data in the item set according to the quantum state and the corresponding first amplitude;

and determining a preference prediction result of the user from the item set according to the probability distribution and displaying the preference prediction result on the terminal interface.

Optionally, the determining, according to the quantum state and the corresponding first amplitude, an item set including the preference data in the transaction database and a probability distribution corresponding to each of the rest transaction data in the item set includes:

determining a column index where the preference data are located, and judging whether the preference data exist in each transaction data corresponding to the column index according to the probability corresponding to the quantum state containing the column index;

if the preference data exist, determining a transaction item set where a row index corresponding to the preference data is located and a transaction item set simultaneously containing each preference data;

and calculating the probability corresponding to the quantum state corresponding to the other transaction data except the preference data in the transaction item set simultaneously containing the preference data.

Optionally, the determining a preference prediction result of the user from the item set according to the probability distribution includes:

calculating the sum of the probabilities corresponding to the rest transaction data in the transaction item set simultaneously containing the preference data;

and determining the transaction data corresponding to the maximum value in the sum of the probabilities as the preference prediction result of the user.

Optionally, after constructing a first quantum wire encoded with the transaction index, the transaction data, and the preference data to be queried, the method further comprises:

adding the first quantum circuit to a first preset quantum bit position in a first preset quantum circuit according to a first preset time sequence to obtain a second quantum circuit at least used for amplitude updating;

the operating the first quantum circuit, outputting a quantum state including each transaction index and a corresponding first amplitude, and determining an item set including the preference data in the transaction database and a probability distribution corresponding to each of the rest transaction data in the item set according to the quantum state and the corresponding first amplitude, includes:

and operating a second quantum circuit, outputting a quantum state containing the binary value of each transaction index and a corresponding second amplitude, and determining an item set containing the preference data in the transaction database and a probability distribution corresponding to the rest transaction data in the item set according to the probability corresponding to each second amplitude, wherein the second amplitude is the amplitude obtained by updating the first amplitude once.

Optionally, after the first quantum wire is added to a first preset qubit position in a first preset quantum wire according to a first preset timing sequence to obtain a second quantum wire at least used for amplitude updating, the method further includes:

adding a plurality of second quantum wires to second preset quantum bit positions in second preset quantum wires in sequence according to a second preset time sequence to obtain a third quantum wire at least used for iteratively updating the amplitude for multiple times;

the operating a second quantum circuit, outputting a quantum state containing a binary value of each transaction index and a corresponding second amplitude, and determining an item set containing the preference data in the transaction database and a probability distribution corresponding to each of the rest transaction data in the item set according to a probability magnitude corresponding to each of the second amplitudes, includes:

and operating a third quantum circuit, outputting a quantum state containing the binary value of each transaction index and a third amplitude corresponding to the quantum state, and determining an item set containing the preference data in the transaction database and a probability distribution corresponding to the rest transaction data in the item set according to the probability corresponding to each third amplitude, wherein the third amplitude is the amplitude obtained by updating the first amplitude through multiple iterations.

Optionally, the constructing a first quantum wire encoded with the transaction index, the transaction data, and the preference data to be queried includes:

acquiring a group of quantum bits according to the transaction index and the binary digit number of the transaction data;

coding a transaction index binary value and a transaction data binary value corresponding to each item of transaction data in the transaction database to a first quantum bit in sequence to construct a first sub-quantum circuit; wherein a binary bit corresponds to the first qubit;

coding the binary value of the preference data to be inquired to a quantum bit corresponding to the transaction data, and adding a preset quantum logic gate to the second quantum bit to construct a second sub-quantum circuit; wherein the preset quantum logic gate comprises a Pagli-X gate;

adding a controlled U1 quantum logic gate operation to the second quantum bit to construct a third sub-quantum circuit;

sequentially adding the transposition conjugation operation corresponding to the second sub-quantum circuit and the transposition conjugation operation corresponding to the first sub-quantum circuit to construct a fourth sub-quantum circuit;

and sequentially forming the first sub-quantum line, the second sub-quantum line, the third sub-quantum line and the fourth sub-quantum line into a quantum line with binary values of the transaction index, the transaction data and the preference data to be inquired according to a preset quantum bit corresponding relation among the sub-quantum lines.

Yet another embodiment of the present application provides an apparatus for preference prediction demonstration using quantum wires, the apparatus comprising:

the system comprises a first display module, a second display module and a third display module, wherein the first display module is used for acquiring transaction data corresponding to a data type when a selection instruction aiming at the transaction data type triggered by a user is received, and displaying the transaction data in a first display area of a terminal interface;

the acquisition module is used for acquiring the transaction data marked by the marking instruction as preference data of the user and performing differential display on the preference data when the marking instruction of the transaction data triggered by the user is received;

the system comprises a construction module, a query module and a query module, wherein the construction module is used for acquiring a transaction database containing a transaction index and transaction data corresponding to the transaction index when a preference prediction instruction triggered by a user is received, and constructing a first quantum circuit encoded with the transaction index, the transaction data and the preference data to be queried; the first quantum circuit is used for inquiring a transaction index corresponding to the preference data;

the output module is used for operating the first quantum circuit, outputting a quantum state containing each transaction index and a corresponding first amplitude, and determining an item set containing the preference data in the transaction database and probability distribution corresponding to other transaction data in the item set according to the quantum state and the corresponding first amplitude;

and the second display module is used for determining a preference prediction result of the user from the item set according to the probability distribution and displaying the preference prediction result on the terminal interface.

Optionally, the output module includes:

the first determining unit is used for determining a column index where the preference data are located, and judging whether the preference data exist in each transaction data corresponding to the column index according to the probability corresponding to the quantum state containing the column index;

the second determining unit is used for determining a transaction item set where a row index corresponding to the preference data is located and a transaction item set which simultaneously contains the preference data if the preference data exists;

and the first calculation unit is used for calculating the probability corresponding to the quantum state corresponding to the other transaction data except the preference data in the transaction item set simultaneously containing the preference data.

Optionally, the second display module includes:

the second calculation unit is used for calculating the sum of the probabilities corresponding to the rest transaction data in the transaction item set simultaneously containing the preference data;

and the third determining unit is used for determining the transaction data corresponding to the maximum value in the sum of the probabilities as the preference prediction result of the user.

Optionally, after the building block, the apparatus further includes:

the first adding module is used for adding the first quantum wire to a first preset quantum bit position in a first preset quantum wire according to a first preset time sequence to obtain a second quantum wire at least used for amplitude updating;

the output module includes:

and the output unit is used for operating a second quantum circuit, outputting a quantum state containing a binary value of each transaction index and a corresponding second amplitude, and determining an item set containing the preference data in the transaction database and a probability distribution corresponding to other transaction data in the item set according to the probability corresponding to each second amplitude, wherein the second amplitude is the amplitude obtained by updating the first amplitude once.

Optionally, after the first adding module, the apparatus further includes:

the second adding module is used for sequentially adding the plurality of second quantum wires to second preset quantum bit positions in the second preset quantum wires according to a second preset time sequence to obtain a third quantum wire at least used for iteratively updating the amplitude for multiple times;

the output unit includes:

and the determining unit is used for operating a third quantum circuit, outputting a quantum state containing a binary value of each transaction index and a third amplitude corresponding to the quantum state, and determining an item set containing the preference data in the transaction database and a probability distribution corresponding to other transaction data in the item set according to the probability magnitude corresponding to each third amplitude, wherein the third amplitude is the amplitude obtained by repeatedly updating the first amplitude for multiple times.

Optionally, the building module includes:

the acquisition unit is used for acquiring a group of quantum bits according to the transaction index and the binary digit number of the transaction data;

the first encoding unit is used for sequentially encoding a transaction index binary value and a transaction data binary value corresponding to each item of transaction data in the transaction database to a first quantum bit to construct a first sub-quantum circuit; wherein a binary bit corresponds to the first qubit;

the second encoding unit is used for encoding the binary value of the preference data to be inquired to the quantum bit corresponding to the transaction data, adding a preset quantum logic gate to the second quantum bit and constructing a second sub-quantum circuit; wherein the preset quantum logic gate comprises a Pagli-X gate;

a first constructing unit, configured to add a controlled U1 quantum logic gate operation to the second qubit to construct a third sub-quantum line;

a second constructing unit, configured to add a transpose conjugate operation corresponding to the second sub-quantum line and a transpose conjugate operation corresponding to the first sub-quantum line in sequence, and construct a fourth sub-quantum line;

and the third construction unit is used for sequentially forming the first sub-quantum line, the second sub-quantum line, the third sub-quantum line and the fourth sub-quantum line into a quantum line which is encoded with binary values of the transaction index, the transaction data and the preference data to be inquired according to a preset quantum bit corresponding relation among the sub-quantum lines.

A further embodiment of the application provides a storage medium having a computer program stored thereon, wherein the computer program is arranged to perform the method of any of the above when executed.

Yet another embodiment of the present application provides an electronic device comprising a memory having a computer program stored therein and a processor configured to execute the computer program to perform the method of any of the above.

Compared with the prior art, the method for performing preference prediction demonstration by using the quantum circuit, provided by the invention, comprises the steps of firstly obtaining transaction data corresponding to a data type, and displaying the transaction data in a first display area of a terminal interface; secondly, acquiring transaction data marked by the marking instruction as preference data of the user, and performing differential display on the preference data; then constructing and operating a first quantum circuit which is encoded with transaction indexes, transaction data and preference data to be inquired, outputting a quantum state containing each transaction index and a first amplitude corresponding to the quantum state, and determining an item set containing the preference data in a transaction database and probability distribution corresponding to the rest transaction data in the item set according to the quantum state and the first amplitude corresponding to the quantum state; according to probability distribution, the preference prediction result of the user is determined from the item set and displayed on a terminal interface, so that a quantum circuit is designed in the field of quantum computing, the defects of more time consumption and lower efficiency in preference prediction demonstration in the prior art are overcome by using the parallel characteristic of a quantum algorithm, and the efficiency of preference prediction demonstration is improved.

Drawings

Fig. 1 is a block diagram of a hardware structure of a computer terminal of a method for performing a preference prediction demonstration by using quantum wires according to an embodiment of the present invention;

fig. 2 is a flowchart illustrating a method for performing a preference prediction demonstration using quantum wires according to an embodiment of the present invention;

fig. 3 is a schematic diagram of a first sub-quantum wire according to an embodiment of the present invention;

fig. 4 is a schematic diagram of a second sub-quantum wire according to an embodiment of the present invention;

fig. 5 is a schematic diagram of a third sub-quantum wire according to an embodiment of the present invention;

fig. 6 is a schematic diagram of a fourth sub-quantum wire according to an embodiment of the present invention;

fig. 7 is a schematic diagram of a first quantum wire according to an embodiment of the present invention;

fig. 8 is a schematic diagram of a first predetermined quantum wire according to an embodiment of the present invention;

fig. 9 is a schematic diagram of a second quantum wire according to an embodiment of the present invention;

fig. 10 is a schematic diagram of a third quantum wire according to an embodiment of the present invention;

fig. 11 is a schematic structural diagram of a device for performing preference prediction by using quantum wires according to an embodiment of the present invention.

Detailed Description

The embodiments described below with reference to the drawings are illustrative only and should not be construed as limiting the invention.

It is noted that the terms "first," "second," and the like in the description and in the claims of the present invention are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order.

The user behavior prediction can enable people to discover the relationship between items (item and item) from a data set, the relationship has a plurality of application scenarios in our lives, and shopping basket analysis is a common scenario which can find out the association relationship between commodities from a consumer transaction record, so that more sales are brought by the way of commodity bundle sales or related recommendation. Therefore, behavior prediction mining is a very useful technique.

Based on this, the invention firstly introduces a method for performing preference prediction demonstration by using quantum wires, which can be applied to electronic equipment, such as computer terminals, specifically ordinary computers, quantum computers and the like.

This will be described in detail below by way of example as it would run on a computer terminal. Fig. 1 is a block diagram of a hardware structure of a computer terminal of a method for performing a preference prediction demonstration by using quantum wires according to an embodiment of the present invention. As shown in fig. 1, the computer terminal may include one or more (only one shown in fig. 1) processors 102 (the processor 102 may include, but is not limited to, a processing device such as a microprocessor MCU or 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 understood by those skilled in the art that the structure shown in fig. 1 is only an illustration and is not intended to limit the structure of the computer terminal. 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 performing preference prediction demonstration using quantum wires in the embodiment of the present application, and the processor 102 executes various functional applications and data processing by running the software programs and modules stored in the memory 104, so as to implement the method described above. The 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 located remotely from the processor 102, which may be connected to a computer terminal over 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 device 106 is used for receiving or transmitting data via a network. Specific examples of the network described above may include a wireless network provided by a communication provider of the computer terminal. In one example, the transmission device 106 includes a Network adapter (NIC) that can be connected to other Network devices through a base station to communicate with the internet. In one example, the transmission device 106 can be a Radio Frequency (RF) module, which is used to communicate with the internet in a wireless manner.

It should be noted that a true quantum computer is a hybrid structure, which includes two major components: one part is a classic computer which is responsible for executing classic calculation and control; the other part is quantum equipment which is responsible for running a quantum program to further realize quantum computation. The quantum program is a string of instruction sequences which can run on a quantum computer and are written by a quantum language such as a Qrun language, so that the support of the operation of the quantum logic gate is realized, and the quantum computation is finally realized. In particular, a quantum program is a sequence of instructions that operate quantum logic gates in a time sequence.

In practical applications, due to the limited development of quantum device hardware, quantum computation simulation is usually required to verify quantum algorithms, quantum applications, and the like. The quantum computing simulation is a process of realizing the simulation 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 build quantum programs for a particular problem. The quantum program referred in the embodiment of the invention is a program written in a classical language for representing quantum bits and evolution thereof, wherein the quantum bits, quantum logic gates and the like related to quantum computation are all represented by corresponding classical codes.

A quantum circuit, which is an embodiment of a quantum program and also a weighing sub-logic circuit, is the most common general quantum computation model, and represents a circuit that operates on a quantum bit under an abstract concept, and the circuit includes the quantum bit, a circuit (timeline), and various quantum logic gates, and finally, a result is often read through a quantum measurement operation.

Unlike conventional circuits that are connected by metal lines to pass either voltage or current signals, in quantum circuits, the lines can be viewed as being connected by time, i.e., the state of a qubit evolves naturally over time, in the process being operated on as indicated by the hamiltonian until a logic gate is encountered.

The quantum program refers to the total quantum circuit, wherein the total number of the quantum bits in the total quantum circuit is the same as the total number of the quantum bits of the quantum program. It can be understood that: a quantum program may consist of quantum wires, measurement operations for quantum bits in the quantum wires, registers to hold measurement results, and control flow nodes (jump instructions), and a quantum wire may contain tens to hundreds or even thousands of quantum logic gate operations. The execution process of the quantum program is a process executed for all the quantum logic gates according to a certain time sequence. It should be noted that timing is the time sequence in which the single quantum logic gate is executed.

It should be noted that in the classical calculation, the most basic unit is a bit, and the most basic control mode is a logic gate, and the purpose of the control circuit can be achieved through the combination of the logic gates. Similarly, the way qubits are handled is quantum logic gates. The quantum state can be evolved by using a quantum logic gate, which is the basis for forming a quantum circuitIncluding single-bit quantum logic gates such as Hadamard gates (H-gates, Hadamard gates), pauli-X gates (X-gates), pauli-Y gates (Y-gates), pauli-Z gates (Z-gates), RX-gates, RY-gates, RZ-gates, and the like; multi-bit quantum logic gates such as CNOT gates, CR gates, isswap gates, Toffoli gates, etc. Quantum logic gates are typically represented using unitary matrices, which are not only matrix-form but also an operation and transformation. The function of a general quantum logic gate on a quantum state is calculated by multiplying a unitary matrix by a matrix corresponding to a quantum state right vector. Suppose that a quantum state right vector is

Then the corresponding quantum state left vector is

Wherein, c₁，c₂，...，c_nAre all a plurality of numbers,

denotes c_nConjugation of (1). It can be seen that the right vector represents a 1 × n column vector, the left vector represents an n × 1 row vector, and the two vectors are transpose conjugates of each other.

It will be appreciated by those skilled in the art that in a classical computer, the basic unit of information is a bit, one bit has two states, 0 and 1, and the most common physical implementation is to represent these two states by the high and low of the levels. In quantum computing, the basic unit of information is a qubit, one qubit also having two states, 0 and 1, denoted as |0>And |1>However, it can be in a superimposed state of two states of 0 and 1, and can be expressed as

Where a and b are complex numbers representing states and state amplitudes (probability amplitudes), which classical bits do not have. After measurement, the state of the qubit collapses to a certain state (eigenstate, here | 0)>State, |1>State) in which it collapses to |0>Has a probability of²Collapse to |1>Has a probability of b²，a²+b²＝1，|>Is a dirac symbol.

The quantum state space represented by the qubit refers to quantum state information represented by all eigenstates corresponding to the qubit, and the number of all eigenstates is the power of 2 quantum bits.

Quantum states, i.e., states of qubits, are represented in binary by quantum algorithms (or quantum programs). For example, a set of qubits q0, q1, q2 representing the 0 th, 1 st, and 2 nd qubits, ordered from high to low as q2q1q0, has a quantum state of 2³Superposition of the eigenstates, 8 eigenstates (defined states) means: |000>、|001>、|010>、|011>、|100>、|101>、|110>、|111>Each eigenstate corresponding to a qubit, e.g. |000>The state 000 from high to low corresponds to q2q1q 0. In short, a quantum state is a superposition state of the eigenstates, and is in one of the determined eigenstates when the probability amplitude of the other states is 0.

For example, if the preference data value is 2, and a group of qubits for encoding data has 2 bits or more, for example, 5 qubits, the quantum state can be |00010>, where the two least significant bits are binary 10, which represents the binary value of the preference data. The useful information is the two-bit information of the lowest bit, so the quantum state corresponding to the preference data value can be abbreviated as |2> - |10 >.

Referring to fig. 2, fig. 2 is a schematic flowchart of a method for performing a preference prediction demonstration by using quantum wires according to an embodiment of the present invention, where the method may include:

s201: when a selection instruction aiming at a transaction data type triggered by a user is received, acquiring transaction data corresponding to the data type, and displaying the transaction data in a first display area of a terminal interface.

Specifically, a selection instruction of the user for the transaction data type is triggered, the selection instruction operation is responded, so that the transaction data corresponding to the data type is obtained, and a transaction data display interface after the selection instruction operation is completed is displayed in a first display area of the terminal interface.

The selection instruction may be: a selection button is arranged in the first display preset area, and a user clicks the selection button and responds to the operation of selecting the data type at the rear end to finish the jump from the initialization interface to the first display area interface.

For example, the preset transaction data type may be a transaction data type such as "movie", "music", "shopping", and the like, and after the user selects a certain transaction data type, if the user selects "shopping", the preset transaction data corresponding to the selected "shopping" transaction type may be obtained, and if the transaction data in the "shopping" transaction type includes transaction data such as "milk", "bread", "cheese", "butter", and the like, all the transaction data are displayed in the first display area of the terminal interface for the user to perform a next preference selection.

S202: and when a marking instruction of the transaction data triggered by the user is received, acquiring the transaction data marked by the marking instruction as preference data of the user, and performing differential display on the preference data.

Specifically, after the first display area of the terminal interface displays all transaction data, the user triggers a marking instruction for the transaction data, and the back end responds to the marking instruction to operate, so that the transaction data marked by the marking instruction is obtained and used as preference data of the user, and the preference data is displayed in a distinguishing manner.

Specifically, when a selection operation of a user for some transaction data of the transaction data is received, corresponding transaction data can be selected from all transaction data displayed on the terminal interface to be marked, and the selected transaction data is distinguished and displayed as marked transaction data through color change, brightness, and the like to serve as the preference data of the user.

Illustratively, in the above example, all transaction data in the "shopping" data type is displayed in the first display area of the terminal interface, and the user selects the preference data by triggering the marking instruction, for example, the preference data selected by the user is "milk" and "bread", at this time, the "milk" and "bread" options are displayed by color or shading to be distinguished from other transaction data which is not selected by the marking instruction.

S203: when a preference prediction instruction triggered by a user is received, acquiring a transaction database containing a transaction index and transaction data corresponding to the transaction index, and constructing a first quantum circuit encoded with the transaction index, the transaction data and the preference data to be inquired; wherein, the first quantum circuit is used for inquiring the transaction index corresponding to the preference data.

Specifically, the user responds to the preference prediction operation by triggering the preference prediction instruction, so as to obtain the transaction database containing the transaction index and the transaction data corresponding to the transaction index.

Specifically, the transaction database includes transaction data information and transaction index information, where the transaction data information is a subset element included in each transaction item set, and the transaction index is data position information corresponding to the subset element, which is data of the transaction data in the transaction database correspondingly identifying the element position information.

For example, for a transaction database, assume that it contains a transaction set of N transactions, denoted T ═ T₀，T₁，...，T_N-1Every transaction consists of M items set I ═ I₀，I₁，...，I_M-1A subset of transactions, each transaction containing a set of M items, i.e. M items

. The transaction database may thus be represented as an NxM encoding matrix denoted D where element D_ijNot equal to 0 indicates a transaction T_iIn which comprises I_jItem, else element D_ij＝0。

Illustratively, for a transaction database, the set of entries contained therein is shown in Table 1 below:

table 1: transaction information and item information tables contained in a transaction database

Trading	Item(s)
		T₀	Bread, cheese and milk
T₁	Bread and butter
		T₂	Cheese, milk, butter
T₃	Bread and cheese
		T₄	Cheese, butter and milk

Wherein, if the number 1 represents "cheese"; number 2 represents "milk"; numeral 3 represents "bread"; number 4 represents "butter"; the number 0 indicates that there is no such entry, and the information in table 1 above can be represented by the following matrix:

for the 5 × 4 matrix, the transaction data values including the transaction index and the corresponding transaction index are obtained. To accommodate the binary nature of computers, various serial numbers, labels, etc. are counted beginning with 0. Generally, by default, starting from row 0 and column 0, if the element value of column 0 and row 0 is 1, the element value of column 1 and row 0 is 2, the element value of column 2 and row 0 is 3, the element value of column 3 and row 0 is 0, and so on, the transaction index and the corresponding transaction data information table shown in table 2 are obtained:

table 2: transaction index and corresponding transaction data information table

Specifically, constructing a first quantum line encoded with the transaction index, the transaction data, and the preference data to be queried by using a quantum logic gate and a quantum bit may include the following steps:

s2031: and acquiring a group of quantum bits according to the transaction index and the binary digit number of the transaction data.

Specifically, a pre-constructed transaction index relationship, a group of qubits representing qubits and a quantum state space represented by the qubits can be obtained through user input, and the number of the qubits can be set by a user according to actual requirements. Under the condition of sufficient computing resources, a large number of qubits can be set, and the qubit requirements under most conditions are unconditionally met.

Illustratively, the transaction index may include a row index and a column index, as shown in Table 2 for the transaction index and its corresponding transaction data. It can be known that the transaction database includes 5 transaction item sets, each transaction item set includes 4 transaction data, and the decimal identifier of the transaction data is (1, 2, 3, 4), so that the number of the quantum bits for encoding the column index is set to be at least 2, the number of the quantum bits for encoding the row index is set to be at least 3, and the number of the quantum bits for encoding the transaction data is at least 3.

S2032: coding a transaction index binary value and a transaction data binary value corresponding to each item of transaction data in the transaction database to a first quantum bit in sequence to construct a first sub-quantum circuit; wherein a binary bit corresponds to the first qubit.

For example, as shown in the transaction index and the corresponding transaction data shown in table 2, it can be seen that the transaction index binary value and the transaction data binary value corresponding to each transaction data are encoded onto the qubit to construct the first sub-quantum circuit, so as to obtain the schematic diagram of the first sub-quantum circuit of the present embodiment shown in fig. 3, where an open circle represents a binary digit 0, a solid black circle represents a binary digit 1, a connecting line represents a controlled line, and V1 represents a combination of a series of quantum logic gates, such as X gates and the like, that implement encoding of the transaction data (the transaction data shown in fig. 3) 001 with a transaction index of 0 row and 0 column, that when the quantum state is |00000>, the operation that V1 represents a quantum logic gate is performed, otherwise, the operation is not performed; similarly, the encoding principle and method of V2-V20 are the same as V1, and are not repeated here. In addition, only the transaction index binary values and the transaction data binary value encoding states of

rows

0 and 4 of the transaction database information shown in table 2 are shown in the figure, and the methods and principles of the transaction index binary values and the transaction data binary value encoding states of rows 1, 2 and 3 are the same as those of

rows

0 and 4, and are directly omitted in fig. 3 and are not shown again.

It should be noted that the binary encoding of the data in the actual quantum wire may be implemented by inserting a quantum logic gate, for example, when a binary digit 0 (illustrated as a hollow circle) needs to be encoded in the quantum wire, no operation is performed on the qubit; for a binary digit 1 (shown as a solid black circle) to be encoded on a quantum wire, a pauli-X gate needs to be inserted on the qubit, representing the quantum state on the qubit to change from the initial 0 state to the 1 state; if the encoding needs to be continued, inserting a Pally-X gate on the qubit again, namely reducing the quantum state on the qubit from the 1 state to the initial 0 state. The method or the quantum logic gate for encoding the transaction index binary value and the transaction data binary value corresponding to each piece of transaction information in the transaction database onto the quantum bit is all covered in the protection scope of the present invention.

S2033: coding the binary value of the preference data to be inquired to a quantum bit corresponding to the transaction data, and adding a preset quantum logic gate to the second quantum bit to construct a second sub-quantum circuit; wherein the preset quantum logic gate comprises a Paly-X gate.

Specifically, fig. 4 is a schematic diagram of the second sub-quantum wire of the present embodiment. Optionally, in order to visually display the transaction index and the binary encoding process of the transaction data, the open circles represent the binary number 0, the solid black circles represent the binary number 1, the connecting lines between the circles represent the controlled, pauli-X gate connected open circles and solid black circles, which represent that the preference data to be queried are binary values 01 and 10. It should be noted that the binary encoding diagram of the preference data to be queried shown in fig. 4 is only an example, and the actual binary encoding quantum state needs to be determined according to the binary values of different preference data to be queried.

S2034: adding a controlled U1 quantum logic gate operation to the second qubit to construct a third sub-quantum wire.

Specifically, fig. 5 is a schematic diagram of the third sub-quantum wire of the present embodiment. Illustratively, the second qubit is connected with a quantum logic gate U1 gate by adding a solid black circle, which represents a controlled U1 gate, wherein the matrix form of the U1 gate is

Where θ can be determined by the user according to the line requirement, for example, θ ═ pi, and the third sub-quantum line can be obtained.

S2035: and sequentially adding the transposition conjugation operation corresponding to the second sub-quantum circuit and the transposition conjugation operation corresponding to the first sub-quantum circuit to construct a fourth sub-quantum circuit.

Specifically, fig. 6 is a schematic diagram of a fourth sub-quantum wire of the present embodiment, in which,

the transpose conjugate of the pauli-X gate, and similarly, the empty circle and the solid black circle connected to the transpose conjugate of the pauli-X gate, representing that the preference data to be queried is binary values 01 and 10 are merely examples, corresponding to the schematic diagram of the aforementioned second sub-quantum circuit;

representing the corresponding transposed conjugate of the first sub-quantum wire.

S2036: and sequentially forming the first sub-quantum line, the second sub-quantum line, the third sub-quantum line and the fourth sub-quantum line into a quantum line with binary values of the transaction index, the transaction data and the preference data to be inquired according to a preset quantum bit corresponding relation among the sub-quantum lines.

Specifically, quantum circuits in which binary values of the transaction index, the transaction data, and the preference data to be queried are encoded are sequentially formed according to a preset quantum bit correspondence relationship among the sub-quantum circuits, where the correspondence relationship of the quantum bits is that a quantum bit of a first sub-quantum circuit corresponds to a quantum bit of a transposed conjugate of the first sub-quantum circuit, a quantum bit of the first sub-quantum circuit in which the transaction data is encoded corresponds to a quantum bit of a second sub-quantum circuit in which the preference data to be queried is encoded, a quantum bit of an X gate operation in the second sub-quantum circuit corresponds to a controlled bit in a third sub-quantum circuit, and a quantum bit of the second sub-quantum circuit corresponds to a quantum bit of a transposed conjugate of the second sub-quantum circuit, so as to obtain the schematic diagram of the first quantum circuit in this embodiment shown in fig. 7.

Vi denotes a series of quantum logic gates for realizing binary encoding of each transaction data, and i denotes a number, and the encoding principle is the same as that of the transaction index.

After a first quantum circuit which is encoded with the transaction index, the transaction data and the preference data to be inquired is constructed, the first quantum circuit can be added to a first preset quantum bit position in the first preset quantum circuit according to a first preset time sequence to obtain a second quantum circuit at least used for amplitude updating, and a plurality of second quantum circuits are sequentially added to a second preset quantum bit position in the second preset quantum circuit according to a second preset time sequence to obtain a third quantum circuit at least used for amplitude updating for a plurality of times of iterations.

Illustratively, fig. 8 is a schematic diagram of a first predetermined quantum circuit of this embodiment, which includes a plurality of qubits, Hadamard gates, controlled U1 gates, and SWAP quantum logic gates. Wherein,

representing the effect of a Hadamard gate on n qubits, the open circles connected to the U1 gate representing a virtually controlled U1 gate, i.e., when the quantum state is |0000>When the operation is finished, executing the U1 door operation, otherwise, not acting; the switching gate (SWAP gate) is applied to the first predetermined quantum wire, i.e. the corresponding quantum state in the qubit space acted on by the SWAP gate is swapped.

As shown in fig. 9, which is a schematic diagram of the second quantum wire of this embodiment, according to the first predetermined timing sequence, that is, the pauli-X gate, the Hadamard gate, and the first quantum wire (Oracle wire) are sequentially added to the first predetermined qubit position (the lower half qubit shown in fig. 9) in the first predetermined quantum wire, so as to obtain the second quantum wire (G) for amplitude update^(k)Lines), wherein the SWAP gate functions to implement index transfer of query preference data search results; the second quantum circuit obtains the output result after the amplitude is updated, so that the index probability of the search result can be improved, the discrimination of the probability can be improved, and the accuracy of the preference data query can be more accurately output, thereby the whole second quantum circuit (G)^(k)Wires) may be used as a one-time query for preference data.

Specifically, the gate of Pauli-X and the gate of Hadamard (in line) can be sequentially switched according to a second preset time sequence

Representing the effect of a Hadamard gate on n qubits), t second quantum wires (G)^(k)Wires) are added to the second predetermined qubit positions in the second predetermined quantum wires resulting in a schematic diagram of the third quantum wires of the present embodiment as shown in fig. 10. Wherein n qubits of the upper half of the diagram are used to store search results, t is G^(k)The iteration times of the line can be determined by the user according to the iteration requirement in advance.

It should be noted that the quantum bit number in the above schematic diagram is only an illustration, and does not really show the quantum bit correspondence in the present invention, and in a specific practical application, the method for querying the preference data to be protected in the present application needs to be completed according to the preset quantum bit correspondence between each quantum line or each sub-quantum line.

S204: and operating the first quantum circuit, outputting a quantum state containing each transaction index and a corresponding first amplitude, and determining an item set containing the preference data in the transaction database and the probability distribution corresponding to the rest transaction data in the item set according to the quantum state and the corresponding first amplitude.

Specifically, the first quantum wire can be regarded as an Oracle quantum wire, and in quantum applications, a specific function can be completed by operating the Oracle wire, and a specific implementation manner is provided in a specific problem. The complex function of mutual conversion between quantum states corresponding to transaction indexes and specific representations of transaction data in a transaction database is realized by utilizing an Oracle circuit, so that quantum parallel computation is realized.

Specifically, a first quantum circuit is operated, a quantum state including each transaction index and a first amplitude corresponding to the quantum state are output, and an item set including the preference data in the transaction database and a probability distribution corresponding to each of the rest transaction data in the item set are determined according to the quantum state and the first amplitude corresponding to the quantum state.

It should be noted that, after the first quantum circuit is operated, the quantum state including each transaction index and the amplitude value corresponding to the quantum state can be obtained, and each quantum state corresponds to the row index and the column index of different transaction data in the transaction database. And determining the probability distribution corresponding to the rest transaction data in the item set by using the item set containing the preference data.

For example, according to the transaction database information shown in table 2, if the binary values of the preference data to be queried encoded by the second sub-quantum line are 001 and 010, respectively, the first quantum line is operated to output the quantum state containing the binary value of each transaction index and the corresponding first amplitude k, and for convenience of description, the square value (i.e., the probability value p) of the first amplitude corresponding to each quantum state is directly calculated, and the following results can be obtained:

S^*＝k₀|00000>+k₁|00001>+k₂|00010>+k₃|00011>+k₄|00100>+k₅|00101>+k₆|00110>+k₇|00111>+k₈|01000>+k₉|01001>+k₁₀|01010>+k₁₁|01011>+k₁₂|01100>+k₁₃|01101>+k₁₄|01110>+k₁₅|01111>+k₁₆|10000>+k₁₇|10001>+k₁₈|10010>+k₁₉|10011>+k₂₀|10100>+k₂₁|10101>+k₂₂|10110>+k₂₃|10111>+k₂₄|11000>+k₂₅|11001>+k₂₆|11010>+k₂₇|11011>+k₂₈|11100>+k₂₉|11101>+k₃₀|11110>+k₃₁|11111>

from the above results, it can be seen that each quantum state corresponds to a probability value, such as p₀＝|k₀|²The same applies to the rest, and the sum of the probability values is 1. Each quantum state corresponding to a row and column index of different transaction data in the transaction database, e.g. |00111>Representing line 1 (001) and column 3 (11) the binary transaction data can be queried as 100, |10011>The binary trade data represented by row 4, column 3 can be queried to be 100, wherein the first 3 bits in the quantum state represent the row index and the second 2 bits represent the column index.

In practical application, a column index where the preference data is located can be determined, and whether the preference data exists in each transaction data corresponding to the column index is judged according to the probability corresponding to the quantum state containing the column index; if the preference data exist, determining a transaction item set where a row index corresponding to the preference data is located and a transaction item set simultaneously containing each preference data; calculating the probability corresponding to the quantum state corresponding to the other transaction data except the preference data in each transaction item set; and calculating the sum of the probabilities corresponding to the rest transaction data in the determined transaction item set, and determining the transaction data corresponding to the maximum value in the sum of the probabilities as the preference prediction result of the user.

Illustratively, as can be seen from table 2, the 0 th row, the 1 st row, the 2 nd row and the 3 rd row may be preset to store the

transaction data

1, 2, 3 and 4, so that after the preference data is obtained, the corresponding column index is determined in reverse. Suppose the preference data to be queried are 1 and 2, the column index corresponding to the preference data 1 is 0, and the column index corresponding to the preference data 2 is 1.

S above^*In each contained quantum state, whether the probability corresponding to the quantum state with the column index of 0 is greater than 0 is judged, and if so, it indicates that preference data 1 exists on the row index (one row is a transaction item set) corresponding to the quantum state. For example, quantum state |00000>The probability of correspondence is greater than 0, then it represents |00000>Preference data 1 exists in the 0 th column, i.e. the 0 th transaction item set, where the corresponding 0 th row is located. The presence of preference data 2 can be judged in the same way.

Judging 4 quantum states |00000>、|01000>、|01100>And |10000>Corresponding probability p₀、p₈、p₁₂、p₁₆If the quantum state is greater than 0, the row indexes corresponding to the quantum states are 0, 2, 3 and 4, which indicates that the transaction item sets of item 0, item 2, item 3 and item 4 have preference data 1 to be queried. In the same way, |00001>、、|01001>And |10001>And the preference data 2 to be inquired exists in the corresponding 0 th transaction item set, 2 nd transaction item set and 4 th transaction item set, so that the transaction item sets containing the preference data 1 and 2 are determined to be the 0 th transaction item set, 2 nd transaction item set and 4 th transaction item set.

Then, the probability distribution corresponding to the rest of the transaction data in the 0 th, 2 nd and 4 th transaction item sets is determined, namely the probability distribution of the transaction data 3 and 4 is calculated. Wherein, the 0 th, the 2 nd and the 4 thThe probability distribution of the transaction data 3 in the transaction item set is p₂、p₁₀、p₁₈The probability distribution of the transaction data 4 in the 0 th, 2 nd and 4 th transaction item sets is p₃、p₁₁、p₁₉. In fact, as can be seen from Table 2, p₁₀、p₁₈Both equal to 0, i.e. no transaction data 3 exists in the 2 nd and 4 th transaction item sets; and p is₃Also equal to 0, i.e. transaction data 4 is not present for the set of 2 nd transaction items. Finally, the probability distribution of the transaction data 3 in the 0 th, 2 nd and 4 th transaction item sets is p₂The probability distribution of the transaction data 4 in the 0 th, 2 nd and 4 th transaction item sets is p₁₁、p₁₉。

Specifically, the probability corresponding to the first amplitude is not easily measured directly, so that a quantum state including the binary value of each transaction index and a second amplitude corresponding to the quantum state need to be output by operating a second quantum line.

It should be noted that, in this case, if the value of the second amplitude is subjected to several iterations, the measured precision is higher, and the result is more accurate. Thus, the following steps are performed:

Specifically, the third quantum wire is obtained by combining a plurality of second quantum wires and a preset quantum logic gate according to a preset time sequence, wherein the number of the second quantum wires in the third quantum wire can be determined according to the quantum bit number of the coded transaction index, and the probability distribution of the transaction index data can be obtained through a certain number of loop iterations, wherein the probability or the sum of the probabilities corresponding to the item set containing the preference data and the rest transaction data in the item set is the largest, that is, the result index of the preference prediction data to be queried for the preference data is obtained. In practical applications, the number of second quantum wires is preferably 3, 5 or 7.

S205: and determining a preference prediction result of the user from the item set according to the probability distribution and displaying the preference prediction result on the terminal interface.

Illustratively, in the above example, the item sets containing the preference data 1 and 2 to be queried are the 0 th, 2 nd and 4 th transaction item sets. In the 3 transaction item sets, the probability distribution corresponding to the transaction data 3 is p₂The probability distribution of the transaction data 4 is p₁₁、p₁₉,. By comparing p₂And p₁₁+p₁₉The user's preference prediction result can be determined. If p is₂Greater than p₁₁+p₁₉Then p will be₂The preference prediction result 'bread' represented by the corresponding transaction data 3 is displayed on the terminal interface; if p is₂Is less than p₁₁+p₁₉Then p will be₁₁、p₁₉The quantum state or corresponding preference prediction result "butter" represented by transaction data 4 is displayed at the terminal interface. As can be seen from Table 2, p is actually₁₁+p₁₉Greater than p₂I.e., the preference prediction result is "butter", which is consistent with the frequency of users shopping for "butter" in the 0 th, 2 th, and 4 th transaction item sets.

In practical applications, the transaction data with the highest frequency in all the sets of items simultaneously containing the preference data may be determined as the preference prediction result, where the manner of determining whether the transaction data exists is the same as described above. Since there may be a plurality of transaction data having the highest frequency, it is preferable to determine the preference prediction result by comparing the magnitude of the probability.

Therefore, the item set of user behavior prediction can be obtained through quantum and classical mixed calculation, and through the method and the test and verification of some data, the method can realize the item set statistics and calculation of behavior prediction mining. The core idea of the quantum circuit part of the method adopts a quantum walking search mode, and a transaction index coding mode is carried out on the basis to adapt to the behavior prediction problem. And finally, counting the item set containing the preference data and the transaction data with the maximum probability or the maximum sum of the probabilities corresponding to the rest transaction data in the item set, and displaying the prediction result on a terminal interface.

Referring to fig. 11, fig. 11 is a schematic structural diagram of an apparatus for performing preference prediction demonstration by using quantum wires according to an embodiment of the present invention, and corresponding to the flow shown in fig. 2, the apparatus may include:

the first display module 1101 is configured to, when a selection instruction for a transaction data type triggered by a user is received, acquire transaction data corresponding to the data type, and display the transaction data in a first display area of a terminal interface;

an obtaining module 1102, configured to, when receiving a marking instruction of the transaction data triggered by a user, obtain the transaction data marked by the marking instruction, as preference data of the user, and perform differential display on the preference data;

a building module 1103, configured to, when a preference prediction instruction triggered by a user is received, obtain a transaction database including a transaction index and transaction data corresponding to the transaction index, and build a first quantum line encoded with the transaction index, the transaction data, and the preference data to be queried; the first quantum circuit is used for inquiring a transaction index corresponding to the preference data;

an output module 1104, configured to run the first quantum line, output a quantum state including each of the transaction indexes and a first amplitude corresponding to the quantum state, and determine, according to the quantum state and the first amplitude corresponding to the quantum state, an item set including the preference data in the transaction database and a probability distribution corresponding to each of the other transaction data in the item set;

a second display module 1105, configured to determine a preference prediction result of the user from the item set according to the probability distribution, and display the preference prediction result on the terminal interface.

Specifically, the output module includes:

Specifically, the second display module includes:

Specifically, after the building block, the apparatus further includes:

the output module includes:

Specifically, after the first adding module, the apparatus further includes:

the output unit includes:

Specifically, the building module includes:

An embodiment of the present invention further provides a storage medium, where a computer program is stored in the storage medium, where the computer program is configured to, when executed, perform the steps in any one of the above method embodiments.

Specifically, in the present embodiment, the storage medium may be configured to store a computer program for executing the steps of:

s201: when a selection instruction aiming at a transaction data type triggered by a user is received, acquiring transaction data corresponding to the data type, and displaying the transaction data in a first display area of a terminal interface;

s202: when a marking instruction of the transaction data triggered by a user is received, acquiring the transaction data marked by the marking instruction as preference data of the user, and performing differential display on the preference data;

s203: when a preference prediction instruction triggered by a user is received, acquiring a transaction database containing a transaction index and transaction data corresponding to the transaction index, and constructing a first quantum circuit encoded with the transaction index, the transaction data and the preference data to be inquired; the first quantum circuit is used for inquiring a transaction index corresponding to the preference data;

s204: operating the first quantum circuit, outputting a quantum state containing each transaction index and a corresponding first amplitude, and determining an item set containing the preference data in the transaction database and probability distribution corresponding to other transaction data in the item set according to the quantum state and the corresponding first amplitude;

Specifically, in this embodiment, the storage medium may include, but is not limited to: various media capable of storing computer programs, such as a usb disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic disk, or an optical disk.

An embodiment of the present invention further provides an electronic device, which includes a memory and a processor, where the memory stores a computer program, and the processor is configured to execute the computer program to perform the steps in any one of the method embodiments described above.

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

Specifically, in this embodiment, the processor may be configured to execute the following steps by a computer program:

The construction, features and functions of the present invention are described in detail in the embodiments illustrated in the drawings, which are only preferred embodiments of the present invention, but the present invention is not limited by the drawings, and all equivalent embodiments modified or changed according to the idea of the present invention should fall within the protection scope of the present invention without departing from the spirit of the present invention covered by the description and the drawings.

Claims

1. A method for preference prediction demonstration using quantum wires, the method comprising:

2. The method of claim 1, wherein determining a set of terms in the transaction database that includes the preference data and a probability distribution corresponding to each of the remaining transaction data in the set of terms based on the quantum state and the corresponding first amplitude comprises:

3. The method of claim 2, wherein determining the preference prediction result of the user from the set of items according to the probability distribution comprises:

4. The method of claim 1, wherein after constructing a first quantum wire encoded with the transaction index, the transaction data, and the preference data to be queried, the method further comprises:

5. The method of claim 4, wherein after adding the first quantum wire to the first predetermined qubit position in the first predetermined quantum wire according to the first predetermined timing to obtain the second quantum wire at least for amplitude updating, the method further comprises:

6. The method of claim 1, wherein constructing the first quantum wire encoded with the transaction index, the transaction data, and the preference data to be queried comprises:

7. An apparatus for preference prediction demonstration using quantum wires, the apparatus comprising:

8. The apparatus of claim 7, wherein the output module comprises:

9. A storage medium, in which a computer program is stored, wherein the computer program is arranged to perform the method of any of claims 1 to 6 when executed.

10. An electronic device comprising a memory and a processor, wherein the memory has stored therein a computer program, and wherein the processor is arranged to execute the computer program to perform the method of any of claims 1 to 6.