Introducing
Your new presentation assistant.
Refine, enhance, and tailor your content, source relevant images, and edit visuals quicker than ever before.
Trending searches
- Fundamentally different from classical computers!
Classical computers utilize binary values...
Quantum computers use a mixture of binary, representing probabilities rather than definite values! [1, 3]
- Qubits may exist as a 0 or 1, but also as a combination of either (superposition). [1]
-This phenomena may be found in multi-level
quantum fields
- ‘Spin’ (polarity) in a magnetic field
- Signal photons (wave-particle duality) [1, 2].
what does it mean?
The benefits of mastering quantum computing are groundbreaking
A byte of data (8 bits) may represent one of 256 different combinations (numbers) at any given time.
- A qubyte can represent all of these combinations at once when in
superposition!
2 bytes can still only represent 1 number
- 16 qubits (2 qubytes) can represent all 65,536 combinations in parallel. [1]
All possible algorithmic quantum calculations are done on the same clock speed. [1]
Derived from quantum properties of probability and uncertainty.
- Quantum gates take superposition inputs, and generate a
probabilistic output (also in superposition).
- This implies that an observed output is a probability
[1,2,4]
Model quantum physics [1, 5, 6]
- Multi-level physics simulation
- Simulated using quantum components
- Remove unwanted variables in real world simulations
Provide quick solutions to exceptionally difficult math problems [7, 8]
- Time consuming on classical computers
Further development in medicine [1]
- Classical computers still struggle to model complex organic systems
Although less exciting than solving the mysteries of the universe, we are make progress with quantum physics and computing
In 2017 physicists demonstrated the ability to solve a simple system of equations using only quantum methods
"best solid-state platforms with excellent scalability and remarkable high fidelity." [6]
The Harrow, Hassidim, and Lloyd (HHL) algorithm was used to accomplish this task, and is theorized to be exponentially faster than classical calculations
Quantum computers have been shown to outperform supercomputers in isolated tasks (quantum supremacy)
One such example is Google's quantum computer, which was able to model quantum number generation
This took the 53 qubits in Google's computer 2-3 minutes, and would have taken a classical supercomputer ~10,000 years [7]
While quantum computers may one day aid in medicine, physics, and humanitarian development - they may also pose a threat to our security
Number
X
RSA Encryption uses large numbers and their prime factors to act as a public and private key for online users to access encrypted (otherwise unusable) data
As far as classical computers are concerned: it is far easier to multiple factors to match a number than it is to determine that number's prime factors [8]
It is for this reason that RSA encryption is used to keep data secure - as it would take an exceptional amount of computational work for computers to determine these factors
Prime Factors
There is an established formula known as Shor's Algorithm Able to define a better guess for prime factors of a number N, after an initial guess. [8,9]
g^(P/2)±1 = m*N Shor's Alrorithm (simplified) [8]
where g is any initial guess, p is some power, N is the number being factored, and m is some multiple of N
Computers still struggle to accomplish these computational steps in sum, but the exponential calculations preformed by quantum computers imply that modern encryption methods may one day be at risk. [8]
Refrences