What is Quantum Computing ? theory and science and machineries #quantum #quantumcomputers

Welcome back to my RumBle channel
:- Mr.K¡Ng Anonymous Lovers
.
Is quantum computing real ?
.
What is a quantum computer?
Here is a one-sentence summary of what a quantum computer is:
A quantum computer is a type of computer that uses quantum mechanics so that it can perform certain kinds of computation more efficiently than a regular computer can.
There is a lot to unpack in this sentence, so let me walk you through what it is exactly using a simple example.

To explain what a quantum computer is, I’ll need to first explain a little bit about regular (non-quantum) computers.

How a regular computer stores information
Now, a regular computer stores information in a series of 0’s and 1’s.

Different kinds of information, such as numbers, text, and images can be represented this way.

Each unit in this series of 0’s and 1’s is called a bit. So, a bit can be set to either 0 or 1.

Now, what about quantum computers?
A quantum computer does not use bits to store information. Instead, it uses something called qubits.

Each qubit can not only be set to 1 or 0, but it can also be set to 1 and 0. But what does that mean exactly?

Let me explain this with a simple example. This is going to be a somewhat artificial example. But it’s still going to be helpful in understanding how quantum computers work.

A simple example for understanding how quantum computers work
Now, suppose you’re running a travel agency, and you need to move a group of people from one location to another.

To keep this simple, let’s say that you need to move only 3 people for now — Alice, Becky, and Chris.
And suppose that you have booked 2 taxis for this purpose, and you want to figure out who gets into which taxi.
Also, suppose here that you’re given information about who’s friends with who, and who’s enemies with who.

Here, let’s say that:

• Alice and Becky are friends
• Alice and Chris are enemies
• Becky and Chris are enemies
And suppose that your goal here is to divide this group of 3 people into the two taxis to achieve the following two objectives:
• Maximize the number of friend pairs that share the same car
• Minimize the number of enemy pairs that share the same car
Okay, so this is the basic premise of this problem. Let’s first think about how we would solve this problem using a regular computer.
Solving this problem with a regular computer
To solve this problem with a regular, non-quantum computer, you’ll need first to figure out how to store the relevant information with bits.
..
Let’s label the two taxis Taxi #1 and Taxi #0.
Then, you can represent who gets into which car with 3 bits.
For example, we can set the three bits to 0, 0, and 1 to represent:
.
• Alice gets into Taxi #0
• Becky gets into Taxi #0
• Chris gets into Taxi #1
Since there are two choices for each person, there are 2*2*2 = 8 ways to divide this group of people into two cars.
Here’s a list of all possible configurations
.
A | B | C
0 | 0 | 0
0 | 0 | 1
0 | 1 | 0
0 | 1 | 1
1 | 0 | 0
1 | 0 | 1
1 | 1 | 0
1 | 1 | 1

Using 3 bits, you can represent any one of these combinations.

Computing the score for each configuration
Now, using a regular computer, how would we determine which configuration is the best solution?

To do this, let’s define how we can compute the score for each configuration. This score will represent the extent to which each solution achieves the two objectives I mentioned earlier:
.
• Maximize the number of friend pairs that share the same car
• Minimize the number of enemy pairs that share the same car
Let’s simply define our score as follows:
(the score of a given configuration) = (# friend pairs sharing the same car) - (# enemy pairs sharing the same car)
For example, suppose that Alice, Becky, and Chris all get into Taxi #1. With three bits, this can be expressed as 111.

In this case, there is only one friend pair sharing the same car — Alice and Becky.

However, there are two enemy pairs sharing the same car — Alice and Chris, and Becky and Chris.

So, the total score of this configuration is 1-2 = -1.

Solving the problem
With all of this setup, we can finally go about solving this problem.
.....Etc...........