A New Universal Quantum Gates and Its Simulation on GPGPU

Luo, Huimin; Yuan, Jian; Dai, Wenjing

doi:10.1007/978-3-319-68505-2_2

Cited by 1 publication

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is during the measurement phase that a qubit selects a definite state, while quantum entanglement [2,3] is a phenomenon by which qubits are manipulated such that their outputs became correlated and cannot be represented as an output of individual qubits. Superposition and quantum entanglement are playing key roles in designing quantum algorithms and are the backbone of quantum teleportation [4]-and quantum cryptography [5]-based systems. Even though these phenomena provide significant advantage to quantum computers, in reality, very few problems [6,7] have been figured out which can be solved effectively with quantum computing.…”

Section: Introductionmentioning

confidence: 99%

A Generalized Quantum Algorithm for Assuring Fairness in Random Selection Among 2N Participants

Kumar¹

2020

SN COMPUT. SCI.

View full text Add to dashboard Cite

Quantum computing promises to provide a tremendous boost to the computational power of our machines by utilizing superposition and entanglement phenomenon of quantum mechanics. Few quantum algorithms are known which are taking advantage of these quantum phenomena and are providing solutions to problems having significant importance. In this paper, we have proposed a generalized method for designing 2 N qubits circuit such that during measurement only one qubit will be in state-1, while remaining other qubits will hold state-0. Apart from adding fair randomness to the selection process in distributed quantum computing, these generalized quantum circuits can be found very useful in commercial domains requiring transparency and trust in systems requiring fair randomness in decision-making such as in a lottery system. The critical advantage of using our proposed method is that it allows individual's results to be teleported to them, hence making an end-to-end system whose fairness is quantum assured.

show abstract

Section: Introductionmentioning

confidence: 99%

A Generalized Quantum Algorithm for Assuring Fairness in Random Selection Among 2N Participants

Kumar¹

2020

SN COMPUT. SCI.

View full text Add to dashboard Cite

show abstract

A New Universal Quantum Gates and Its Simulation on GPGPU

Cited by 1 publication

References 14 publications

A Generalized Quantum Algorithm for Assuring Fairness in Random Selection Among 2N Participants

A Generalized Quantum Algorithm for Assuring Fairness in Random Selection Among 2N Participants

Contact Info

Product

Resources

About