A Multiparty Quantum Private Equality Comparison Scheme Relying on | GHZ 3 〉 States

In this work, we present a new protocol that accomplishes multiparty quantum private comparison leveraging maximally entangled | G H Z 3 ⟩ triplets. Our intention was to develop a protocol that can be readily executed by contemporary quantum computers. This is possible because the protocol uses only | G H Z 3 ⟩ triplets, irrespective of the number n of millionaires. Although it is feasible to prepare multiparticle entangled states of high complexity, this is overly demanding on a contemporary quantum apparatus, especially in situations involving multiple entities. By relying exclusively on | G H Z 3 ⟩ states, we avoid these drawbacks and take a decisive step toward the practical implementation of the protocol. An important quantitative characteristic of the protocol is that the required quantum resources are linear both in the number of millionaires and the amount of information to be compared. Additionally, our protocol is suitable for both parallel and sequential execution. Ideally, its execution is envisioned to take place in parallel. Nonetheless, it is also possible to be implemented sequentially if the quantum resources are insufficient. Notably, our protocol involves two third parties, as opposed to a single third party in the majority of similar protocols. Trent, commonly featured in previous multiparty protocols, is now accompanied by Sophia. This dual setup allows for the simultaneous processing of all n millionaires’ fortunes. The new protocol does not rely on a quantum signature scheme or pre-shared keys, reducing complexity and cost. Implementation wise, uniformity is ensured as all millionaires use similar private circuits composed of Hadamard and CNOT gates. Lastly, the protocol is information-theoretically secure, preventing outside parties from learning about fortunes or inside players from knowing each other’s secret numbers.