1 1/19/2017
“ Tomorrow we will have learned to understand and express all of physics
in the language of information.“
J.A. Wheeler
John Archibald Wheeler *1911 † 2008
2
„Any Classical Computer seems to need exponential time to simulate quantum systems.
Why we don‘t use native Quantum Computers?“
R. Feynman Richard Feynman *1918 †1988
0
2
4
6
8
10
2014 2015 2016 2017 2018 2019 2020 2021 2022
GFL
OP
S /
$
Time
performance / price – Data Center
Turing machines Quantum machines
4
𝑇𝑖𝑚𝑒 = 𝑡 ∙ 109 ≈ 10𝑠
Search time: Current Computer (Turing Machine)
11
“Grover's algorithm" by Bender2k14 - Own work.
H… Hadamard Gate U… Controlled U-Gate
Grovers‘s Algorithm in Quantum Gates
Quantum Computer:
𝑇𝑖𝑚𝑒 = 𝑞 ∙ 109 ≈ 300µ𝑠
𝑇𝑖𝑚𝑒 = 𝑡 ∙ 2256 ≈ ≈ 1 𝑡𝑟𝑖𝑙𝑙𝑖𝑜𝑛 ∙ 𝑡𝑟𝑖𝑙𝑙𝑖𝑜𝑛 ∙ ∙ 𝑡𝑟𝑖𝑙𝑙𝑖𝑜𝑛 ∙ 𝑡𝑟𝑖𝑙𝑙𝑖𝑜𝑛 ∙ ∙ 𝑡𝑟𝑖𝑙𝑙𝑖𝑜𝑛 ∙ 𝑦𝑒𝑎𝑟𝑠
Current Computer: (Turing Machine)
"Shor's algorithm" by Bender2k14 - Own work.
H… Hadamard Gate U… Controlled U-Gate QFT … Quantum Fourier Transform
Shore‘s Algorithm in Quantum Gates
Quantum Computer:
𝑇𝑖𝑚𝑒 = 𝑞 ∙ 2562 ≈ 70µ𝑠
12