Decomposition of Quantum Gates with Primitives Quantum Operations

Main Article Content

Paramita Ray

Abstract

In classical computers, a bit is either 0 or 1 at a particular time. A quantum bit can exist not only in a state corresponding to the logical state 0 or 1 as in a classical bit, but also in states corresponding to a blend or superposition of these classical states. In other words, a qubit can exist as a zero, a one, or simultaneously as both 0 and 1, with a numerical coefficient representing the probability for each state. Quantum Computers use Quantum Mechanical properties to provide an exponential speed up in time and query processing capabilities [11]. In this section, we will try to decompose basic quantum gate and simulate with using Quantum computing language (QCL). QCL is a high level, architecture independent [4] programming language for quantum computers, with a syntax derived from classical procedural languages.

 

Keywords: Basic Quantum Gates, PMD, Quantum computing language, Quantum register, Quantum mechanic

Downloads

Download data is not yet available.

Article Details

Section
Articles