1、Introduction Introduction to Quantum to Quantum ComputingComputingKaelyn Ferris,PhDQuantum Engineer&Community CoordinatorIBM QuantumMajo LozanoQuantum Hardware Engineer IBM QuantumBackground Quantum ComputingIBM Quantum6What makes computing quantum?Quantum computers use ququantum bitsbits or qubitsq
2、ubitsThese qubits qubits have interesting properties which make them particularly powerfulNamely,they can be put in a superpositionsuperposition,entangled entangled with other qubits,andinterfereinterfere with each otherSuperpositionIBM Quantum7Superposition IBM Quantum8=0 bitstring in Dirac notatio
3、n=Hadamard gateSuperposition IBM Quantum9orMeasurement gate EntanglementIBM Quantum10InterferenceIBM Quantum11Quantum Complexity TheoryBQPNPP-SpaceNP-CompletePP=problems solvable in polynomial time(i.e.efficient for classical computers)multiplicationNP=problems solvable in non deterministic polynomi
4、al time(i.e.easy to check,hard to solve)NP-Complete=problems solvable in non deterministic polynomial time(i.e.most difficult of the NP class to solve)BQP=problems solvable in bounded-error quantum polynomial time(i.e.efficient for quantum computers)Integer factorisationSimulation of quantum systems
5、Discrete logarithmP-Space=problems solvable with a polynomial amount of memory(i.e.space is not the limiting factor)Does P=NP?Quantum Computers Today15Physical LimitationsDecoherence:2023 IBM Corporation github/twitter:javabstermore qubits,more connections =more“noise”Vibrations Temperature fluctuat
6、ions Electromagnetic waves Other environmental factorsmore qubits =more“noise”June 2023 evidence of quantum“utility”Simulation of a physics systemPushing the limits of quantum hardwareSummary:https:/ 16 2023 IBM CorporationResearch at IBM Quantumhttps:/ Quantum utility vs.quantum advantageQuantum ut