Qiskit: a Quantum Information Science Kit
Abby Mitchell
Developer Advocate, IBM Quantum
IBM Quantum / © 2023 IBM Corporation
Quantum Complexity Theory
BQP
NP
P-Space
NP-Complete
P
P = problems solvable in polynomial time (i.e. efficient for classical computers)
multiplication
NP = problems solvable in non deterministic polynomial time (i.e. easy to check)
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 factorisation
Simulation of quantum systems
Discrete logarithm
P-Space = problems solvable with a polynomial amount of memory (i.e. space is not the limiting factor)
Does P = NP ?
Research at IBM Quantum
© 2023 IBM Corporation
3
Simulating �Quantum Systems
Chemistry
Quantum Dynamics
Condensed matter physics
Superconductivity
© 2020 IBM Corporation
Fluid dynamics
Batteries
Solving a problem on a Quantum Computer
Quantum Algorithm
Problem
Quantum Circuits
Compiled Quantum Circuit
Hardware
Simulator
Solving a problem on a Quantum Computer
Quantum Algorithm
Problem
Quantum Circuits
Compiled Quantum Circuit
Hardware
Simulator
ecosystem
research
code
How is Qiskit developed?
Qiskit Core
Find a bug & open an issue (even better open a PR!)
Look through open issues (look for good first issue or help wanted tags)
Attend Demo Days and Office hours (qiskit.org/events)
Ecosystem
Contribute to existing projects in the Qiskit Ecosystem (qiskit.org/ecosystem)
Create your own project using Qiskit – and open-source it!
Submit your project to the Qiskit Ecosystem
Translations
Qiskit Localization Contributors can also earn badges at 4 different levels for their translations
Help others
Participate in the Qiskit Slack
Answer Qiskit questions on Quantum Computing StackExchange or StackOverflow
Upvote and comment on GitHub Issues, review others’ PRs
Become a Qiskit Advocate (https://qiskit.org/advocates )
© 2020 IBM Corporation
9
Q&A
Thank-you!�
(also visit qiskit.org for more info)