A novel construction for quantum stabilizer codes based on binary formalism

Abstract

In this research, we propose a novel construction of quantum stabilizer code based on a binary formalism. First, from any binary vector of even length, we generate the parity-check matrix of the quantum code from a set composed of elements from this vector and its relations by shifts via subtraction and addition. We prove that the proposed matrices satisfy the condition constraint for the construction of quantum codes. Finally, we consider some constraint vectors which give us quantum stabilizer codes with various dimensions and a large minimum distance with code length from six to twelve digits.

A Novel Quantum No-Key Protocol for Many Bits Transfer with Error Correction Codes

“…To extend the first full quantum code, Shor code for 9 qubits is created by Shor, which use both bit-flip correction and phase-flip correction and can correct bit-flip, phase-flip, and their combination [14]. To do so, for one qubit is protected against phase-flip we need extend it to codeword of three qubits.…”

Simulation of Quantum Computation via MAGMA Computational Algebra System

“…Quantum information system is a system which is based on quantum mechanical phenomena, such as superposition and entanglement to perform operates on a system state. The computation algorithms based on quantum computer have proved the efficient on processing data more security and solving complex problem more efficient time [1,[18][19][20][21][22]. For example, one of the first quantum algorithm to factor an integers into its primers is invented by Shor [2], which runs on polynomial time.…”

A Novel Framework for Simulation of Quantum Information System

“…Moreover, Grover [3] proposed a searching algorithm named Grover search, which is applied on many reality researches on large database system. Since then, quantum computers are attracted by many researchers all over the world [4][5][6][16][17][18][19][20].…”