Quantum computing: Difference between revisions
From ACT Wiki
Jump to navigationJump to search
imported>Doug Williamson (Expand final sentence.) |
imported>Doug Williamson (Add applications. Source: Institute for Quantum computing webpage https://uwaterloo.ca/institute-for-quantum-computing/quantum-computing-101) |
||
| Line 1: | Line 1: | ||
Quantum computers can process vastly more information, faster, compared with conventional (binary) computers. | Quantum computers can process vastly more information, faster, compared with conventional (binary) computers. | ||
| Line 10: | Line 8: | ||
#Superposition | #Superposition | ||
#Entanglement | #Entanglement | ||
Among other applications, quantum computing has the potential to break existing encryption systems, such as RSA encryption, but also to create more secure encryption systems. | |||
| Line 18: | Line 19: | ||
* [[Quantum]] | * [[Quantum]] | ||
*[[Qubit]] | *[[Qubit]] | ||
*[[RSA encryption]] | |||
*[[Superposition]] | *[[Superposition]] | ||
[[Category:Technology]] | [[Category:Technology]] | ||
Revision as of 12:30, 18 December 2019
Quantum computers can process vastly more information, faster, compared with conventional (binary) computers.
Quantum computers are framed around qubits, rather than the bits which are the basis of conventional computers.
Quantum computing is based on two key attributes of quantum systems:
- Superposition
- Entanglement
Among other applications, quantum computing has the potential to break existing encryption systems, such as RSA encryption, but also to create more secure encryption systems.
