Scribd
Upload
25 views

Quantum Computing: Memory Bits Qubits Quantum Superposition Qubit States

A quantum computer uses qubits that can represent superpositions of 1s and 0s, allowing the computer to be in multiple states simultaneously. This contrasts with classical computers that can only be in one state at a time. Quantum algorithms run sequences of quantum logic gates on qubits and end with a measurement, collapsing the qubits into a classical bit string result. One example is Shor's algorithm, which can find the prime factors of large numbers exponentially faster than classical computers. It works by using quantum Fourier transforms and measurements to extract periodicity from the qubits that reveals the factors.

Uploaded by

Utkal Parasar
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
25 views

Quantum Computing: Memory Bits Qubits Quantum Superposition Qubit States

A quantum computer uses qubits that can represent superpositions of 1s and 0s, allowing the computer to be in multiple states simultaneously. This contrasts with classical computers that can only be in one state at a time. Quantum algorithms run sequences of quantum logic gates on qubits and end with a measurement, collapsing the qubits into a classical bit string result. One example is Shor's algorithm, which can find the prime factors of large numbers exponentially faster than classical computers. It works by using quantum Fourier transforms and measurements to extract periodicity from the qubits that reveals the factors.

Uploaded by

Utkal Parasar
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Quantum Computing

Abstract
In Today’s world computers have changed nearly everything but as we know that there is limitations of every thing,
and so as for our classical computers that we use in our day to day life as well.classical computers are very good at
calculating something our doing the mathematics of anything .But there are some limitations of classical computer
because it carrys a limited amount of mind which is created by the humans themselves whose limitations of mind is
enormous or simply no limitations.

In my presentation of paper on quantum ciomputing I will be illustrating the things and the manipulations or
calculations of things about which the classical computers will take more than a decade to solve or analyse and we
are even not sure about the accuracy as well. Suppose we can take the example of RSA cryptography.Its a kind of
encryption and decryption system based upon prime factors and will help to secure any data or assets via any means
possible.Quantum computing enables the us to find the prime factors of extremely large no. in seconds whereas a
classical computer will take years with acertainity in accuracy as well.

Like normal binary data there exists only two possibility either 1 or 0 but in quantum realm there exists a single bit
known as Qubit which is a superposition of 1 and 0 at the same time.So depending upon the number of bits in any
process there are quite possible no. of outputs. Suppose we are calculating the data about life so as per the results of
quantum world He or She may be alive or dead at the same time depending upon the the moment at which you want
to observe the condition.

A great research is going on , on this topic but still the developments that we have seems to be quite small ,its like
that starting developrement of first classical computer back then in 1871.And the maximum possible output was to
find the prime factor of 15 i.e. 3 and 5with nearly 50% accuracy. But like no one have thinked of the computers at
one like that it’s the start of a new era which will answer a lot of unanswered stuffs related to cosmos, parallel
universe,a blackhole and time slip etc.

INTRODUCTION:

A classical computer has a memory made up of bits, where each bit is represented by either a one
or a zero. A quantum computer, on the other hand, maintains a sequence of qubits, which can
represent a one, a zero, or any quantum superposition of those two qubit states;[10]:13–16 a pair of
qubits can be in any quantum superposition of 4 states,[10]:16 and three qubits in any superposition of
8 states. In general, a quantum computer with qubits can be in an arbitrary superposition of up
to different states simultaneously.[10]:17 (This compares to a normal computer that can only be
in one of these states at any one time).
A quantum computer operates on its qubits using quantum gates and measurement (which also
alters the observed state). An algorithm is composed of a fixed sequence of quantum logic
gates and a problem is encoded by setting the initial values of the qubits, similar to how a classical
computer works. The calculation usually ends with a measurement, collapsing the system of qubits
into one of the eigenstates, where each qubit is zero or one, decomposing into a classical state. The
outcome can therefore be at most classical bits of information (or, if the algorithm did not end with a
measurement, the result is an unobserved quantum state).
Quantum algorithms are often probabilistic, in that they provide the correct solution only with a
certain known probability.[11] Note that the term non-deterministic computing must not be used in that
case to mean probabilistic (computing), because the term non-deterministic has a different meaning
in computer science.
An example of an implementation of qubits of a quantum computer could start with the use of
particles with two spin states: "down" and "up" (typically written and , or and ). This is true because
any such system can be mapped onto an effective spin-1/2 system.

Shor’s algorithm
Although any integer number has a unique decomposition into a product of primes, finding the prime
factors is believed to be a hard problem. In fact, the security of our online transactions rests on the
assumption that factoring integers with a thousand or more digits is practically impossible. This
assumption has been challenged in 1995 when Peter Shor proposed a polynomial-time
quantum algorithm for the factoring problem. Shor’s algorithm is arguably the most dramatic
example of how the paradigm of quantum computing changed our perception of which problems
should be considered tractable. In this section we briefly summarize some basic facts about
factoring, highlight main ingredients of the Shor’s algorithm, and illustrate how it works using a toy
factoring problem.

You might also like