19 lines
2.0 KiB
Markdown
19 lines
2.0 KiB
Markdown
|
# Demonstrating Superposition
|
|||
|
|
|
|||
|
|
***Superposition**: A* fundamental principle of quantum mechanics. It states that, much like waves in classical physics, any two quantum states can be added together and the result will be another valid quantum state.
|
|||
|
|
|
|||
|
|
**The below diagram would be how a quantum computer solves a maze:**
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
**vs. its classical computer counterpart:**
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
# **How does this work?**
|
|||
|
|
|
|||
|
|
This machine works based on the presence or absence of the clicks caused by the rotation of these mechanical levers. Although we have moved on from mechanical levers to digital bits, the same concept still governs all our computing efforts. The concept of **qubit** can easily be explained by saying that it can be 0 and 1 at the same time. But in the mechanical case, having a click and having no click at the same time, seems like an absurd case to make. This is the reason why even researchers working on Quantum Technology are not able to fully visualize it’s power and capabilities.
|
|||
|
|
|
|||
|
|
However, let us try to make some sense of the situation here. In any way, computing power directly correlates to the number of computational states which exists at the same time. Let’s take the example of navigating a maze. When considering that a quantum particle is going through this maze, remember that a quantum particle has the unique property of being at 2 places at the same time due to the principle of quantum superposition. So when a quantum particle encounters various paths to take within the maze, it can decide to take all of those paths at the same time using superposition.
|
|||
|
|
|
|||
|
|
If you think about it, this process closely resembles the paradigm of parallel computing. Due to quantum *superposition*, the quantum particle is able to navigate the maze in exponentially less time than the classical bit.
|