A method and device for calculating votes based on quantum logic

Through the vote calculation method based on quantum logic, the density operator and quantum computing model in the two-dimensional Hilbert space are used to solve the problem that votes cannot express complex attitudes in the existing technology, and the quantum state calculation of votes is realized. Supports multiple voting mechanisms, simplifying the calculation process.

CN114241653BActive Publication Date: 2024-11-19QUDOOR TECH INC +1
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202111549268.7
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-12-17
Publication Date
2024-11-19
Estimated Expiration
2041-12-17

AI Technical Summary

Technical Problem

The existing ballots can only be in a deterministic state of 0 or 1, and cannot express voters' complex attitudes towards the issue to be voted, cannot break the Arrow's impossible theorem, and cannot realize the calculation of the superposition state of votes.

Method used

Using a vote calculation method based on quantum logic, the density operator in two-dimensional Hilbert space represents mutually opposed binary quantum states, and the quantum computing model is calculated through the quantum vote counting unit, and the Toffoli gate and Pauli X are used. The gate implements quantum synthesis and dissociation operations to calculate the voting results.

Benefits of technology

The quantum-state application of votes is realized, which can express the complex attitudes of voters, is simple to calculate and is easy to implement, and supports a voting mechanism of one-vote veto and one-vote pass system.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114241653B_ABST
    Figure CN114241653B_ABST
Patent Text Reader

Abstract

The present invention discloses a method for calculating ballots based on quantum logic, and relates to the field of electronic voting, and in particular to a method, device, computer equipment and storage medium for calculating ballots based on quantum logic; the quantum ballot calculation in the present application adopts a density operator on a two-dimensional Hilbert space to represent the quantum states corresponding to mutually opposing binary elements; and through multiple computing units, all the acquired ballots are respectively measured according to a determined quantum operation expression to measure the calculation base, and the quantum bit state of the calculation base is determined; finally, the voting result is calculated according to the quantum bit state of each calculation base; the application of the quantum state of ballots is realized, and the calculation is simple and easy to implement.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of electronic voting, and in particular to a method and device for calculating votes based on quantum logic. Background Art

[0002] Electronic voting means that voters vote through a digital system rather than on paper. The security and fairness of electronic voting has been a research focus of the academic community for more than 20 years. With the advancement of quantum information technology, quantum voting has become a research hotspot in the academic community in the past 10 years.

[0003] Since existing ballots can only be in a deterministic state of 0 or 1, the existing voting and counting mechanisms and methods cannot break Arrow's Impossibility Theorem. In real-life voting, voters often do not simply agree (1) or disagree (0) with the issues to be voted on, and such attitudes cannot be expressed using existing ballots.

[0004] Therefore, in view of the problems existing in the prior art, it is particularly important to provide a technology that can calculate the superposition state of votes. Summary of the invention

[0005] The purpose of the present invention is to avoid the shortcomings of the prior art and provide a ballot calculation method based on quantum logic that can calculate the superposition state of ballots.

[0006] Therefore, according to one aspect of the present invention, a method for calculating votes based on quantum logic includes the following steps:

[0007] S1: Get quantum ballots; quantum ballots use density operators on two-dimensional Hilbert space to represent quantum states corresponding to opposing binary elements;

[0008] S2: Send the acquired quantum votes to each quantum counting unit respectively;

[0009] S3: Calculate the quantum computing expression corresponding to the obtained quantum vote according to the determined quantum computing model;

[0010] S4: Each quantum counting unit measures the computational basis according to the corresponding quantum operation expression, and determines the quantum bit state of the corresponding computational basis; the computational basis is a set of unit vectors that are orthogonal to each other in the two-dimensional Hilbert space;

[0011] S5: Calculate the voting results based on the quantum bit states of each computing base.

[0012] Specifically, the computational basis is an orthogonal basis {|0〉, |1〉} consisting of |0〉 and |1〉; wherein |0〉 and |1〉 are two pure states of the quantum bit.

[0013] More specifically, step S3 also includes: determining a corresponding quantum computing model according to the determined voting mechanism.

[0014] More specifically, step S5 includes the following steps:

[0015] S51: Determine the counting results of each quantum counting unit according to the calculation results of step S4;

[0016] S52: Calculate the voting result according to the statistical method corresponding to the determined voting mechanism.

[0017] The above voting mechanism includes a veto voting, and the corresponding quantum operation model is a quantum conjunction operation model. The quantum conjunction operation model uses the Toffoli gate to perform a quantum conjunction operation on the obtained density operator.

[0018] More specifically, the quantum conjunction operation model is:

[0019] Among them, ρ and σ both represent density operators on the two-dimensional Hilbert space,

[0020] is the operation symbol between matrices, indicating the operation of tensor product.

[0021] AND is a logical operation symbol, which means the operation of logical AND.

[0022] Tr1,2 represents the partial trajectory operation acting on the first and second qubits,

[0023] TOF is the operation symbol of the quantum gate, representing the Toffoli gate operation.

[0024] Another specific voting mechanism includes one-vote-through voting, and the corresponding quantum computing model is the quantum extraction computing model.

[0025] The quantum extraction operation model is:

[0026] Among them, ρ and σ both represent density operators on the two-dimensional Hilbert space,

[0027] is the operation symbol between matrices, indicating the operation of tensor product.

[0028] AND, OR, and NOT are all logical operation symbols, representing logical AND operation, logical OR operation, and negation operation respectively.

[0029] A device using the above-mentioned quantum logic-based vote counting method is characterized in that it includes: an information collection module, a quantum ballot generation module, an information summary module and multiple quantum counting units; the information collection module is used to collect ballot information; the quantum ballot generation module has a built-in quantum ballot model, which is used to generate quantum ballots according to the determined ballot information and send the ballots to each quantum counting unit respectively; the quantum counting unit is used to measure the calculation base according to the determined quantum operation expression and determine the quantum bit state of the calculation base; the information summary module is used to calculate the voting result according to the quantum bit state of each calculation base.

[0030] According to another aspect of the present invention, there is provided a computing device, comprising a memory, a processor, and computer instructions stored in the memory and executable on the processor, wherein when the processor executes the instructions, the steps of the vote calculation method based on quantum logic as described above are implemented.

[0031] According to another aspect of the present invention, a computer-readable storage medium is provided, which stores computer instructions, and when the instructions are executed by a processor, the steps of the vote calculation method based on quantum logic as described above are implemented.

[0032] The beneficial effects of the present application are as follows: a method for calculating ballots based on quantum logic, which uses density operators on a two-dimensional Hilbert space to represent quantum states corresponding to mutually opposing binary elements; and through multiple computing units, each of the acquired ballots is measured according to a determined quantum operation expression to perform a computational base measurement to determine the quantum bit state of the computational base; and finally, the voting result is calculated based on the quantum bit state of each computational base; the application of ballot quantum state is realized, and the calculation is simple and easy to implement. BRIEF DESCRIPTION OF THE DRAWINGS

[0033] The present invention may be better understood by describing exemplary embodiments disclosed in the present invention in conjunction with the accompanying drawings, in which:

[0034] Figure 1 Shown is a schematic flow chart of a vote calculation method based on quantum logic according to the first embodiment disclosed in the present invention;

[0035] Figure 2 The figure shows a program module schematic diagram of a device according to the first embodiment disclosed in the present invention;

[0036] Figure 3 What is shown is a schematic diagram of the hardware structure of a computer device according to the first embodiment disclosed in the present invention. DETAILED DESCRIPTION

[0037] The specific embodiments of the present invention will be described below. It should be noted that in the specific description of these embodiments, in order to be concise and clear, this specification cannot provide a detailed description of all the features of the actual embodiments. It should be understood that in the actual implementation of any embodiment, just as in the process of any engineering project or design project, in order to achieve the specific goals of the developer and to meet system-related or business-related restrictions, various specific decisions are often made, and this will also change from one embodiment to another. In addition, it can also be understood that although the efforts made in this development process may be complex and lengthy, for ordinary technicians in the field related to the content disclosed by the present invention, some changes such as design, manufacturing or production based on the technical content disclosed by the present invention are just conventional technical means, and should not be understood as the content of the present invention is insufficient.

[0038] Unless otherwise defined, the technical or scientific terms used in the claims and the specification shall have the usual meaning understood by persons with ordinary skills in the technical field to which the invention belongs. The words "first", "second" and similar words used in the patent application specification and the claims of the present invention do not indicate any order, quantity or importance, but are only used to distinguish different components. "One" or "one" and other similar words do not indicate a quantitative limitation, but indicate the existence of at least one. "Include" or "comprises" and other similar words mean that the elements or objects appearing before "include" or "comprises" include the elements or objects listed after "include" or "comprises" and their equivalent elements, and do not exclude other elements or objects. "Connected" or "connected" and other similar words are not limited to physical or mechanical connections, nor are they limited to direct or indirect connections.

[0039] See also Figure 1 This embodiment proposes a method for calculating votes based on quantum logic, including the following steps:

[0040] S1: Get quantum ballots; quantum ballots use density operators on two-dimensional Hilbert space to represent quantum states corresponding to opposing binary elements;

[0041] S2: Send the acquired quantum votes to each quantum counting unit respectively; each quantum counting unit acquires all quantum votes;

[0042] S3: Each quantum counting unit determines the corresponding quantum computing model according to the determined voting mechanism, and calculates the quantum computing expressions corresponding to all the obtained quantum votes according to the determined quantum computing model;

[0043] S4: Each quantum counting unit measures the calculation basis according to the corresponding quantum operation expression to determine the quantum bit state of each corresponding calculation basis; the calculation basis is a set of unit vectors that are orthogonal to each other in the two-dimensional Hilbert space; the calculation basis is an orthogonal basis {|0>, |1>} composed of |0> and |1>; where |0> and |1> are two pure states of the quantum bit

[0044] S5: Calculate the voting results based on the quantum bit states of each computing base.

[0045] Specifically, step S5 includes the following steps:

[0046] S51: Determine the counting results of each quantum counting unit according to the calculation results of step S4;

[0047] S52: Counting the various vote counting results according to the statistical method corresponding to the determined voting mechanism to calculate the final voting result.

[0048] In one embodiment, the voting mechanism includes a one-vote veto voting, that is, as long as one person has a definite veto attitude, the proposal will not be passed. The corresponding quantum computing model is a quantum conjunction computing model, which uses a Toffoli gate to perform a quantum conjunction operation on the obtained density operator.

[0049] For example, there is a proposal with m voters {v1, ..., v m}, corresponding to m votes ρ1,…,ρ m , and n quantum counting units.

[0050] Votes ρ i It is represented by the density operator on the two-dimensional Hilbert space, that is, ρ i =a|1><1|+b|0>〈0|, a represents the degree of approval of the vote, b represents the degree of opposition of the vote, where a>0, b>0, and a+b=1. 1 represents approval of the proposal, 0 represents opposition to the proposal. If the voter holds an attitude of 80% approval and 20% opposition to the proposal, this attitude can be represented by a quantum state such as 0.8|1>〈1|+0.2|0>〈0|.

[0051] The quantum conjunction operation model uses the Toffoli gate to perform quantum conjunction operations on the obtained density operator. Measuring a quantum bit ρ with the computational basis {|0>, |1>} will result in a result of 0 or 1, where the probability of getting 0 is <0|ρ|0> and the probability of getting 1 is <1|ρ|1>.

[0052] Under the one-vote veto system, in a quantum counting unit, as long as one or more voters are measured to have opposing opinions, the proposal will not be passed. That is, when the measurement results of all votes are 1, the counting result of the quantum counting unit is 1. Therefore, using the Toffoli gate, the quantum conjunction operation model is determined:

[0053]

[0054] Among them, ρ and σ both represent density operators on the two-dimensional Hilbert space, is the operation symbol between matrices, indicating the operation of tensor product, AND is the logical operation symbol, indicating the operation of logical AND, TOF is the operation symbol of quantum gate, indicating the operation of Toffoli gate, Tr 1,2 represents a partial trajectory operation on the first and second qubits, which simply means discarding the first and second qubits while leaving the third qubit unchanged. For example,

[0055]

[0056]

[0057]

[0058]

[0059]

[0060] The quantum conjunction operation can be naturally extended to multiple qubits:

[0061]

[0062] Each quantum counting unit counts the votes it receives ρ1,…,ρ m First, perform a quantum conjunction operation to obtain Again The calculation base {|0>, |1>} is measured. Each calculation unit will calculate a definite result 0 or 1, and the corresponding counting result is against the proposal or in favor of the proposal.

[0063] Finally, the measurement results of the quantum counting unit are counted to obtain the voting result: if more than 50% of the measurement results are 1, the proposal is passed; otherwise, if less than 50%, it is not passed.

[0064] In another embodiment, the voting mechanism includes a one-vote-pass voting, which is the opposite of a one-vote-no voting, that is, as long as there is one person who is definitely in favor of the proposal, the proposal is passed. The corresponding quantum computing model is the quantum disjunctive computing model.

[0065] Therefore, it is necessary to use the Pauli X-gate to define the quantum negation operation. The matrix representation of the Pauli X-gate is as follows:

[0066]

[0067] Through the Pauli X-gate, the quantum negation operation model NOT(ρ)=XρX is determined;

[0068] Among them, NOT(|0><0|)=X|0〉<0|X=|1〉<1|.

[0069] Combining the quantum negation operation model and the quantum conjunction operation model, the quantum disjunction operation model is determined:

[0070]

[0071] Among them, ρ and σ both represent density operators on the two-dimensional Hilbert space,

[0072] is the operation symbol between matrices, indicating the operation of tensor product.

[0073] AND, 0R, and NOT are all logical operation symbols, representing logical AND operation, logical OR operation, and negation operation respectively.

[0074] Each vote counter counts the votes ρ1,…,ρ m First, perform quantum extraction operation to obtain Again The calculation base {|0〉, |1〉} is measured. Each calculation unit will calculate a definite result 0 or 1, and the corresponding counting result is against the proposal or in favor of the proposal.

[0075] Finally, the measurement results of the quantum counting unit are counted to obtain the voting result: if more than 50% of the measurement results are 1, the proposal is passed; otherwise, if less than 50%, it is not passed.

[0076] Please continue reading Figure 2, shows a quantum vote calculation device. In this embodiment, the device may include or be divided into one or more program modules, one or more program modules are stored in a storage medium and executed by one or more processors to complete the present invention and realize the above-mentioned quantum logic-based vote calculation method. The program module referred to in the present invention refers to a series of computer program instruction segments that can complete specific functions, which is more suitable for describing the execution process of the above-mentioned quantum logic-based vote calculation method in a storage medium than the program itself. The following description will specifically introduce the functions of each program module of this embodiment. The above-mentioned device includes: an information acquisition module, a quantum vote generation module, an information aggregation module and multiple quantum counting units.

[0077] The information collection module is used to collect ballot information.

[0078] The quantum ballot generation module has a built-in quantum ballot model, which is used to generate quantum ballots based on the determined ballot information and send the ballots to each quantum counting unit respectively.

[0079] The quantum counting unit is used to measure the computing base according to the determined quantum operation expression and determine the quantum bit state of the computing base.

[0080] The information summary module is used to calculate the voting results based on the quantum bit states of each computing base.

[0081] Specifically, multiple quantum counting units can be placed in multiple different vote counters, or integrated in the same vote counter. If placed in different vote counters, each vote counter can meet the computing requirements as long as it can perform 3 quantum bit operations.

[0082] The number of quantum bits that need to be manipulated in the existing quantum voting mechanism will increase exponentially with the number of voters, which makes its physical implementation extremely difficult. However, in the present invention, the number of quantum bits that need to be manipulated is only 3, which is physically easier to implement.

[0083] The present embodiment also provides a computer device, such as a smart phone, tablet computer, laptop computer, desktop computer, rack server, blade server, tower server or cabinet server (including an independent server or a server cluster composed of multiple servers) that can execute programs. The computer device 20 of the present embodiment includes at least but is not limited to: a memory 21 and a processor 22 that can communicate with each other through a system bus, such as Figure 3 It should be pointed out that Figure 3 Only computer device 20 is shown with components 21 - 22 , but it should be understood that implementing all of the components shown is not a requirement, and more or fewer components may alternatively be implemented.

[0084] In this embodiment, the memory 21 (i.e., readable storage medium) includes flash memory, hard disk, multimedia card, card-type memory (e.g., SD or DX memory, etc.), random access memory (RAM), static random access memory (SRAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), programmable read-only memory (PROM), magnetic memory, disk, optical disk, etc. In some embodiments, the memory 21 may be an internal storage unit of the computer device 20, such as a hard disk or memory of the computer device 20. In other embodiments, the memory 21 may also be an external storage device of the computer device 20, such as a plug-in hard disk, a smart memory card (SmartMediaCard, SMC), a secure digital (SecureDigital, SD) card, a flash card (FlashCard), etc. equipped on the computer device 20. Of course, the memory 21 may also include both the internal storage unit of the computer device 20 and its external storage device. In this embodiment, the memory 21 is generally used to store the operating system and various application software installed on the computer device 20, such as the program code of the quantum vote calculation device in the embodiment. In addition, the memory 21 can also be used to temporarily store various types of data that have been output or are to be output.

[0085] The processor 22 may be a central processing unit (CPU), a controller, a microcontroller, a microprocessor, or other data processing chip in some embodiments. The processor 22 is generally used to control the overall operation of the computer device 20. In this embodiment, the processor 22 is used to run the program code stored in the memory 21 or process data, such as running the quantum vote calculation device to implement the quantum logic-based vote calculation method of the first embodiment.

[0086] This embodiment also provides a computer-readable storage medium, such as a flash memory, a hard disk, a multimedia card, a card-type memory (for example, an SD or DX memory, etc.), a random access memory (RAM), a static random access memory (SRAM), a read-only memory (ROM), an electrically erasable programmable read-only memory (EEPROM), a programmable read-only memory (PROM), a magnetic memory, a disk, an optical disk, a server, an App application store, etc., on which a computer program is stored, and when the program is executed by a processor, a corresponding function is realized. The computer-readable storage medium of this embodiment is used to store a quantum vote calculation device, and when executed by a processor, the quantum logic-based vote calculation method of embodiment 1 is realized.

[0087] In summary, according to the exemplary embodiments, a vote calculation method based on quantum logic of the present application uses a density operator on a two-dimensional Hilbert space to represent quantum states corresponding to mutually opposing binaries; and multiple computing units respectively perform measurements of computational bases on all obtained votes according to a determined quantum operation expression to determine the qubit states of the computational bases; finally, according to the qubit states of each computational base, the voting result is calculated; realizing the application of vote quantization, with simple calculation and easy implementation; and being able to implement a quantum voting mechanism of one-vote veto or one-vote approval system.

[0088] The following is an explanation of the definitions related to the present application:

[0089] Definition 1 [Hilbert space] A finite-dimensional Hilbert space H is:

[0090] A complex vector space, that is, for any φ, ψ ∈ H and any there is aφ + bψ ∈ H. With a scalar product operation <·|·>: such that for any φ, ψ, χ ∈ H and any there is

[0091]

[0092] <φ|φ> ≥ 0,

[0093] 〈φ|φ> = 0 if and only if φ = 0,

[0094] 〈φ|aψ + bχ> = a〈φ|ψ> + b〈φ|χ〉.

[0095] A quantum system is represented mathematically by a Hilbert space. The state of a quantum system is represented by a vector in the Hilbert space. A vector is represented by the Dirac notation |φ〉, and the norm of |φ〉 is represented by ||φ|| and calculated as follows: A vector with a norm of 1 is called a unit vector.

[0096] Definition 2 [Orthogonal basis] An orthogonal basis of a Hilbert space H is a set of pairwise orthogonal unit vectors {|φ i >}, that is, for any |φ i >, |φ j 〉 we have 〈φ i |φ j 〉 = 0 and 〈φ i |φ i > = 1.

[0097] A qubit is the basic unit of quantum information, just as a bit is the basic unit of classical information. A qubit, as a physical system, is represented mathematically by a 2-dimensional Hilbert space The commonly used quantum bit states are |0> and |1>, where The computational basis of quantum bits refers to an orthogonal basis consisting of |0> and |1>.

[0098] Given a vector |φ> on a Hilbert space H, its dual 〈φ| is a vector from H to the set of complex numbers The function of ψ>∈H is to map 〈φ|ψ>. Equivalently, 〈φ| can be regarded as the transposed conjugate of |φ>: if but Here c1,…,c n is plural, represents their conjugate. For example, <0|=

[10] , <1|=

[01] ,

[0099] The system formed by multiple qubits is represented by the tensor product of a single qubit:

[0100] Definition 3 [Tensor product] Given a vector Then their tensor product is

[0101]

[0102] For example, the tensor product of |0> and |1> is Usually for simplicity we will Denoted as |a, b>.

[0103] In addition to vectors, matrices can also perform tensor product operations:

[0104]

[0105] |0> and |1> are two commonly used pure states of quantum bits. The more general mixed state of quantum bits is mathematically represented by the density operator. The definition of the density operator is relatively complicated. We need to first introduce the concepts of operator, adjoint, projection, trajectory, etc.:

[0106] Definition 4 [Operator] An operator on a Hilbert space H is a linear mapping from H to H.

[0107] If H is an n-dimensional Hilbert space, then every n×n matrix is ​​an operator on H. For example yes Operator on

[0108] Definition 5 [Adjoint] Given an operator A on a Hilbert space H, its adjoint A * is an operator on H that satisfies the following conditions: for any φ, ψ∈H, there is 〈A * φ|ψ>=<φ|Aψ>.

[0109] Definition 6 [Projection] A projection P on a Hilbert space H is an operator that satisfies the following conditions: PP = P and P = P * .

[0110] Definition 7 [Trajectory] Given an operator A on a Hilbert space H, its trajectory is calculated as follows:

[0111] Tr(A)=∑ i 〈i|A|i>, where {|i>} is an orthogonal basis of H.

[0112] Based on the concepts, define semi-positive definite operators and density operators:

[0113] Definition 8 [Semi-positive definite operator] An operator A on a Hilbert space H is a semi-positive definite operator if the following condition is satisfied: there exists an operator B on H such that A = B*B.

[0114] Definition 9 [Density operator] A semi-positive definite operator A on a Hilbert space H is a density operator if the following conditions are met: A = A * And Tr(A)=1.

[0115] For example and are density operators. In fact, for any unit vector |v>, |v>〈v| is a density operator.

[0116] Definition 10 [Toffoli gate] The Toffoli gate is a Hilbert space The operator on is calculated as follows: where x i ∈{0, 1}.

[0117] The serial numbers of the above embodiments of the present invention are only for description and do not represent the advantages or disadvantages of the embodiments.

[0118] Any process or method description in a flowchart or otherwise described herein may be understood to represent a module, segment or portion of code that includes one or more executable instructions for implementing the steps of a specific logical function or process, and the scope of the preferred embodiments of the present invention includes alternative implementations in which functions may not be performed in the order shown or discussed, including performing functions in a substantially simultaneous manner or in the reverse order depending on the functions involved, which should be understood by those skilled in the art to which the embodiments of the present invention belong.

[0119] A person of ordinary skill in the art can understand that all or part of the steps carried out in the above-mentioned embodiment method can be completed by instructing related hardware through a program, and the program can be stored in a computer-readable medium. When the program is executed, it includes one of the steps of the method embodiment or a combination thereof.

[0120] In the description of this specification, the description with reference to the terms "one embodiment", "some embodiments", "example", "specific example" or "some examples" etc. means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present invention. In this specification, the schematic representations of the above terms do not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described may be combined in any one or more embodiments or examples in a suitable manner.

[0121] Through the description of the above implementation methods, those skilled in the art can clearly understand that the above embodiment methods can be implemented by means of software plus a necessary general hardware platform, and of course by hardware, but in many cases the former is a better implementation method.

[0122] The above are only preferred embodiments of the present invention, and are not intended to limit the patent scope of the present invention. Any equivalent structure or equivalent process transformation made using the contents of the present invention specification and drawings, or directly or indirectly applied in other related technical fields, are also included in the patent protection scope of the present invention.

Claims

1. A method for calculating votes based on quantum logic, characterized in that: The following steps are involved: S1: Obtaining a quantum ballot; the quantum ballot uses a density operator on a two-dimensional Hilbert space to represent the quantum states corresponding to the mutually opposing binary elements; S2: Send the acquired quantum votes to each quantum counting unit respectively; S3: Each quantum counting unit determines the corresponding quantum computing model according to the determined voting mechanism, and calculates the quantum computing expression corresponding to the obtained quantum vote according to the determined quantum computing model; S4: Each quantum counting unit measures the calculation base according to the corresponding quantum operation expression, and determines the quantum bit state of the corresponding calculation base; the calculation base is a set of unit vectors that are orthogonal to each other in the two-dimensional Hilbert space; S5: Calculate the voting results based on the quantum bit states of each computing base.

2. A method for calculating votes based on quantum logic according to claim 1, characterized in that: The calculation base is composed of and Orthogonal basis , ; wherein said and are the two pure states of the quantum bit.

3. According to claim 1, a method for calculating votes based on quantum logic is characterized in that: The step S3 comprises the following steps: The corresponding quantum computing model is determined according to the determined voting mechanism.

4. A method for calculating votes based on quantum logic according to claim 3, characterized in that: The step S5 further comprises: S51: Determine the counting results of each quantum counting unit according to the calculation results of step S4; S52: Calculate the voting result according to the statistical method corresponding to the determined voting mechanism.

5. A method for calculating votes based on quantum logic according to any one of claims 1 to 4, characterized in that: The voting mechanism includes a veto voting system, and the corresponding quantum operation model is a quantum conjunction operation model, which uses a Toffoli gate to perform a quantum conjunction operation on the obtained density operator.

6. A method for calculating votes based on quantum logic according to claim 5, characterized in that: The quantum conjunction operation model is: ; Among them, ρ and σ both represent density operators on the two-dimensional Hilbert space, is the operation symbol between matrices, indicating the operation of tensor product. AND is a logical operation symbol, which means the operation of logical AND. T 1,2 represents the partial trajectory operation on the first and second qubits, TOF is the operation symbol of the quantum gate, representing the Toffoli gate operation.

7. A method for calculating votes based on quantum logic according to any one of claims 1 to 4, characterized in that: The voting mechanism includes one-vote-through voting, and the corresponding quantum computing model is the quantum extraction computing model. The quantum extraction operation model is: ; Among them, ρ and σ both represent density operators on the two-dimensional Hilbert space, is the operation symbol between matrices, indicating the operation of tensor product. AND, OR, and NOT are all logical operation symbols, representing logical AND operation, logical OR operation, and negation operation respectively.

8. A device using the quantum logic-based vote counting method according to any one of claims 1 to 7, characterized in that: include: Information collection module, quantum ballot generation module, information aggregation module and multiple quantum vote counting units; The information collection module is used to collect ballot information; The quantum ballot generation module has a built-in quantum ballot model, which is used to generate quantum ballots according to the determined ballot information and send the ballots to each quantum counting unit respectively; The quantum counting unit is used to measure the computing base according to the determined quantum operation expression to determine the quantum bit state of the computing base; The information summary module is used to calculate the voting results according to the quantum bit states of each computing base.

9. A computing device comprising a memory, a processor, and computer instructions stored in the memory and executable on the processor, characterized in that: When the processor executes the instructions, the steps of the method according to any one of claims 1 to 7 are implemented.

10. A computer-readable storage medium storing computer instructions, characterized in that: When the instruction is executed by a processor, the steps of the method described in any one of claims 1 to 7 are implemented.