《Quantum Computing What, Why, and What for.pdf》由会员分享,可在线阅读,更多相关《Quantum Computing What, Why, and What for.pdf(15页珍藏版)》请在三个皮匠报告上搜索。
1、EMPOWERING OPENConfidential Business Information.Not for distribution.2022 QDeepTech GmbH.All rights reserved.2023 QDeepTech GmbH.All rights reserved.Quantum computing:What is quantum computing?2023 QDeepTech GmbH.All rights reserved.Quantum Computing What is a Quantum Computer Quantum computation h
2、arnesses the underlying phenomena of Quantum Mechanics,such as Superposition,Intrinsic Randomness,and Entanglement,for information processing by manipulating and having full control of asingle Quantum System.O ne B it/P-B it/Q ubit(N=1)Classical Bit 01State of the system Either 0 or 1p:0,(1-p):1Fluc
3、tuating between0 and 1 P-Bit 01Superposition Qubit|0|1“+”Superposition of|0 and|1 =a1|0+a2|1Qubit Representation|0|110 2023 QDeepTech GmbH.All rights reserved.Quantum Computing What is a Quantum Computer Quantum computation harnesses the underlying phenomena of Quantum Mechanics,such as Superpositio
4、n,Intrinsic Randomness,and Entanglement,for information processing by manipulating and having full control of asingle Quantum System.|0|1“+”Either 0 or 1Superposition QubitSuperposition of|0 and|1 =a1|0+a2|1|0|1One Bit/Qubit(N=1)Classical Bit 01Classical Bit 01N Bits/Qubits(N1)N=2(2 bits/qubits)|00,
5、|01,|10,|11 Either:Classical One out of 2Npossible permutations 01Superposition of 2N states.All of 2N possible permutations Qubits2=a1|00+a2|01+a3|10+a4|11A quantum computer operates with quantum bits or qubits and simultaneously processes massively entangled superpositions of their states as a sin
6、gle quantum system.A string of N qubits can encompassan entangled superposition of 2N classical N-bit stings.In this sense,a quantum computer may possess an exponential advantage over a classical one.2023 QDeepTech GmbH.All rights reserved.Quantum Computing What is a Quantum Computer Superposition C
7、lassical Bit 01N Bits/Qubits(N1)N=2(2 bits/qubits)|00,|01,|10,|11 Either:Superposition of 2N states.All of 2N possible permutations Classical One out of 2Npossible permutations 01Qubits2=a1|00+a2|01+a3|10+a4|11Entanglement Entanglement is used as a computational multiplier for qubits.The ability of
8、the system to make calculations grows not in a linear fashion but exponentially.|0|1|0|1Observed here Affected over there Spooky action at the distance|0|1|0|1 2023 QDeepTech GmbH.All rights reserved.Quantum Computing What is a Quantum Computer A quantum computer operates with qubits and simultaneou
9、sly processes massively entangled superpositions of their states as a single quantum system.In this sense,a quantum computer may possess an exponential advantage over a classical one.Quantum Supremacy/Quantum Advantage Quantum Algorithms are much faster than regular Algorithms because the speedup co
10、mes from putting the input on the superposition of all possible inputs and then performing the algorithm on the superposition.So instead of running the algorithm in one input as you do classically,you can run the algorithm using“quantum parallelization”on all possible inputs simultaneously.The core
11、of quantum computing is to program the interference phenomena(which can be destructive)so that you boost/reinforce the amplitude of the correct answer by suppressing all the other amplitudes of the wrong answers by destructive interference.We got an N-bit string that is randomly sampled.This doesnt
12、work for every problem.The art is to find these classes of problems,where these works.Then we can claim quantum advantage/speed up or supremacy in that we have a speedup(exponential or whatever)compared to the same input into a classical computer performing the same task.Quantum Algorithms are much
13、faster than regular Algorithms because the speedup comes from putting the input on the superposition of all possible inputs and then performing the algorithm on the superposition.So instead of running the algorithm in one input as you do classically,you can run the algorithm using“quantum paralleliz
14、ation”on all possible inputs simultaneously.Confidential Business Information.Not for distribution.2022 QDeepTech GmbH.All rights reserved.2023 QDeepTech GmbH.All rights reserved.Quantum computing:Why and What for?1.Dennard scaling is gone,Amdahls Law is reaching its limit,and Moores Law is becoming
15、 difficultand expensive to follow,particularly as power and performance benefits diminish.2023 QDeepTech GmbH.All rights reserved.Quantum Computing Why Quantum Computing Moores Law graph(Source:)Moores Law:computer power will double for constant costroughly once every two years.Quantum effects are b
16、eginning tointerfere in electronic devices as they are smaller and smaller.Problem:Quantum effects are beginning tointerfere in electronic devices as they are smaller and smaller.Dennard Scaling:“Power Wall”that has limited practical processor frequency to around 4-6 GHz since 2006.Amdahls lawis use
17、d in computer architecturefor parallel computing to make predictions regardingthe theoretical speedup when multiple processors areused.The smaller somethingis,the quicker it can bechanged.Can smallertransistors switch at higher speeds?Computing beyond Moores Law IEEEhttps:/puter.org/csdl/magazine/co
18、/2015/12/mco2015120014/13rRUytF44E II.Computational complexity:time and space required to solve a computational problem.2023 QDeepTech GmbH.All rights reserved.Quantum Computing Why Quantum Computing II.Computational complexity:time and space required to solve a computational problem.2023 QDeepTech
19、GmbH.All rights reserved.Quantum Computing What for Quantum Computing 1.Faster Quantum Algorithms:A dozen quantum algorithm have been developed that are significantly(sometimes exponentially)faster than the best-known classical algorithms.2.Unique Simulations:Problems with no classicalcounterparts c
20、an be simulated or computed only with a quantum computer*.3.Managing complexity:Hard,intractable,or infeasible classical problems can be computed only with a quantum computer.4.Threat to Internet security:Quantum computation can break the current Internet security.QC threat to Internet Security!III.
21、Computational Resource,Energy :Energy requirements for computation 2023 QDeepTech GmbH.All rights reserved.Quantum Computing Why Quantum Computing Energy dissipation in performing a logical gate is connected with the irreversibility of computation.Landauer principle:toerase information,it is necessa
22、ry to dissipate energy.The energy requirement to erase one bit of information is:Ediss=kB Landauersprincipleimpliesthat Informationis physical.Thelowertheoreticallimitofenergyconsumptionofcomputation implies a limit on the information throughput ofirreversible computers,as real hardware has finite p
23、owerdissipation tolerance.One of the fundamental problems we will need to solveis computational irreversibility as it is directly correlated toenergy consumption and heat dissipation.Without reversible computing,increases in the number ofcomputations-per-joule-of-energy-dissipated must end byabout 2
24、050:because the limit implied by Landauers principlewill be reached.Quantum Computing landscape and State of the Art 2023 QDeepTech GmbH.All rights reserved.2023 QDeepTech GmbH.All rights reserved.Quantum Computing landscape and State of the Art https:/ Business Information.Not for distribution.2022 QDeepTech GmbH.All rights reserved.2023 QDeepTech GmbH.All rights reserved.Thank you for your attention