Automated error correction in IBM quantum computer and explicit generalization

Abstract

Experimental realization of automated error correction is demonstrated through IBM Quantum Experience for Bell and GHZ states using a measurement based approach upon ancilla qubits. The measurement automatically activates error correcting unitary operations to restore the system to its original entangled state. We illustrate the algorithm for the maximally entangled qudit case by applying appropriate Hadamard and Controlled-NOT gates.

Implementation of quantum secret sharing and quantum binary voting protocol in the IBM quantum computer

“…IBM has made its five-qubit quantum processors 'ibmqx2', 'ibmqx4' and 16-qubit processor 'ibmqx5', as an open access resource [63] for the public to test and verify various theoretical protocols. Many groups were able to test various quantum computational tasks like quantum arXiv:1807.03219v1 [quant-ph] 9 Jul 2018 teleportation [64,65], violation of Mermin inequalities [66], verification of entropic uncertainity relations [67], quantum error correction [68][69][70][71], quantum cheque [72,73], non-destructive discrimination of Bell states [74], designing fault tolerant quantum circuits [75], homomorphic encryption experiments [76], non-Abelian braiding of surface code defects [77], approximate quantum adders [78], entanglement assisted invariance [79], simulating ising interaction [80], comparison or quantum computing architectures [81] to name a few.…”

Five Experimental Tests on the 5-Qubit IBM Quantum Computer

“…The quantum computer prototypes of the IBM Quantum Experience -namely ibmqx2 (5 qubits), ibmqx4 (5 qubits) and ibmqx5 (16 qubits)-allow the implementation by the scientific community of real experiments on a quantum processor (see [4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22]). Recent applications include, for instance, the design of a quantum cheque [15], a simulation of the braiding of two non-abelian anyons [10] or a demonstration of faulttolerant quantum computation [13].…”

Cybersecurity Challenges Associated With the Internet of Things in a Post-Quantum World

“…All the aforementioned algorithms are termed asymmetric cryptographic primitives [96]. The solutions to these modern algorithms require enormous computational resources and time; therefore, they are highly secure algorithms if they have quantum computers to solve their existing asymmetric cryptographic primitives [97,98]. Quantum computers using Shor's algorithm [99] can solve these problems within the polynomial time and hence are not more secure.…”