Synthesizing Bell States using Universal Quantum Gates
| Main Authors: | Rana, Hemant, Verma, Shivani |
|---|---|
| Format: | info publication-preprint |
| Bahasa: | eng |
| Terbitan: |
, 2020
|
| Subjects: | |
| Online Access: |
https://zenodo.org/record/3925692 |
Daftar Isi:
- Quantum Computing has experienced a considerable growth in recent times. Though quantum computers have proved to be useful due to applications of Grover’s search algorithm and Shor’s factorisation algorithm, there exist certain difficulties for implementing scalable quantum computers such as decoherence. Decoherence affects entanglement of two qubits, a phenomenon which perhaps serves as the basis for various crucial applications of quantum computers. Bell state is a pivotal phenomenon based on Qubit entanglement serving useful purpose in Quantum Key Distribution and Quantum Information exchange. Bell state is a disposition in which two qubits are entangled with each other, such that if the state of one qubit changes, the other will also change simultaneously. In this paper we propose a novel algorithm to implement bell states using universal gates only. An error comparison has been performed between the conventional algorithm consisting of Hadamard gate and the proposed algorithm consisting of universal gates. After running for several iterations on a real quantum computing system, the proposed algorithm proves to be more accurate as qubits were observed to collapse in desired states at a greater number of instances than the conventional algorithm.