-
Notifications
You must be signed in to change notification settings - Fork 144
Add introductory qiskit in class module #4103
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: main
Are you sure you want to change the base?
Conversation
|
Check out this pull request on See visual diffs & provide feedback on Jupyter Notebooks. Powered by ReviewNB |
|
Thanks for contributing to Qiskit documentation! Before your PR can be merged, it will first need to pass continuous integration tests and be reviewed. Sometimes the review process can be slow, so please be patient. Thanks! 🙌 |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
This LGTM! 🚀
|
I'd love to do a quick copyedit if you can hold off merging for a bit? |
learning/modules/quantum-mechanics/getting-started-with-qiskit.ipynb
Outdated
Show resolved
Hide resolved
learning/modules/quantum-mechanics/getting-started-with-qiskit.ipynb
Outdated
Show resolved
Hide resolved
| "To set up and install the packages above, see the [Install Qiskit](/docs/guides/install-qiskit) guide.\n", | ||
| "In order to run jobs on real quantum computers, students will need to set up an account with IBM Quantum® by following the steps in the [Set up your IBM Cloud account](/docs/guides/cloud-setup) guide.\n", | ||
| "\n", | ||
| "This module was tested and used 2 seconds of QPU time. This is an estimate only. Your actual usage may vary." |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Can you add which processor it took 2 seconds on? e.g.,
"This module was tested and used 2 seconds of QPU time on a Heron v2 processor."
yep, thank you! |
| "source": [ | ||
| "## Introduction\n", | ||
| "\n", | ||
| "In the Qiskit in the Classroom modules, you'll have the opportunity to use a quantum computer to explore various concepts in quantum computing-adjacent fields such as quantum mechanics, computer science, chemistry, and more. To prepare you for this, we've made this introductory module, which teaches the fundamentals of quantum computing and how to use Qiskit to run quantum circuits.\n", |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
| "In the Qiskit in the Classroom modules, you'll have the opportunity to use a quantum computer to explore various concepts in quantum computing-adjacent fields such as quantum mechanics, computer science, chemistry, and more. To prepare you for this, we've made this introductory module, which teaches the fundamentals of quantum computing and how to use Qiskit to run quantum circuits.\n", | |
| "In the Qiskit in the Classroom modules, you'll have the opportunity to use a quantum computer to explore various concepts in quantum computing-adjacent fields such as quantum mechanics, computer science, chemistry, and more. This module serves as a prerequisite to the others - it introduces the fundamentals of quantum computing and how to use Qiskit to run quantum circuits.\n", |
I was trying to work around using the "this" in "To prepare you for this" since it's vague - but is "prerequisite" the right word?
learning/modules/quantum-mechanics/getting-started-with-qiskit.ipynb
Outdated
Show resolved
Hide resolved
learning/modules/quantum-mechanics/getting-started-with-qiskit.ipynb
Outdated
Show resolved
Hide resolved
| "\n", | ||
| "### Fundamental operations: gates\n", | ||
| "\n", | ||
| "Now, a computer needs to be able to *do* something with the bits in order to, well, compute. Binary gates are the operations that form the fundamental building blocks of all more complicated algorithms and codes.\n", |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
| "Now, a computer needs to be able to *do* something with the bits in order to, well, compute. Binary gates are the operations that form the fundamental building blocks of all more complicated algorithms and codes.\n", | |
| "Now, a computer needs to be able to *do* something with the bits in order to, well, compute. Binary gates are the operations that form the fundamental building blocks of all the more complicated algorithms and codes.\n", |
| "\n", | ||
| "### Measurements:\n", | ||
| "\n", | ||
| "Typically, when learning about classical computing, not much attention is paid to the process of reading out the state of the bits. This is because there's not much to it from a conceptual perspective. You can measure the bits at anytime before, during, or after a computation, and it doesn't affect the outcome. This is not the case in quantum computing, as we will discuss below.\n", |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
| "Typically, when learning about classical computing, not much attention is paid to the process of reading out the state of the bits. This is because there's not much to it from a conceptual perspective. You can measure the bits at anytime before, during, or after a computation, and it doesn't affect the outcome. This is not the case in quantum computing, as we will discuss below.\n", | |
| "Typically, when learning about classical computing, not much attention is paid to the process of reading out the state of the bits. This is because it's not very complex from a conceptual perspective. You can measure the bits at anytime before, during, or after a computation, and it doesn't affect the outcome. This is not the case in quantum computing, as we will discuss below.\n", |
| "\n", | ||
| "\n", | ||
| "\n", | ||
| "So, the two bits are copied and fed through both an AND gate and an XOR gate. The result of the XOR gate is the \"sum bit\" (S), which remains in the ones place of the binary number, and the result of the AND gate is the \"carry bit\" (C) which is the value of the next most significant digit in the binary number. Here is the truth table:\n", |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
| "So, the two bits are copied and fed through both an AND gate and an XOR gate. The result of the XOR gate is the \"sum bit\" (S), which remains in the ones place of the binary number, and the result of the AND gate is the \"carry bit\" (C) which is the value of the next most significant digit in the binary number. Here is the truth table:\n", | |
| "So, the two bits are copied and fed through both an AND gate and an XOR gate. The result of the XOR gate is the \"sum bit\" (S), which remains in the ones place of the binary number, and the result of the AND gate is the \"carry bit\" (C), which is the value of the next most significant digit in the binary number. Here is the truth table:\n", |
learning/modules/quantum-mechanics/getting-started-with-qiskit.ipynb
Outdated
Show resolved
Hide resolved
learning/modules/quantum-mechanics/getting-started-with-qiskit.ipynb
Outdated
Show resolved
Hide resolved
learning/modules/quantum-mechanics/getting-started-with-qiskit.ipynb
Outdated
Show resolved
Hide resolved
| "| $|0\\rangle$ | $|1\\rangle$ |\n", | ||
| "| $|1\\rangle$ | $|0\\rangle$ |\n", |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
| "| $|0\\rangle$ | $|1\\rangle$ |\n", | |
| "| $|1\\rangle$ | $|0\\rangle$ |\n", | |
| "| $\\vert 0\\rangle$ | $\\vert 1\\rangle$ |\n", | |
| "| $\\vert 1\\rangle$ | $\\vert 0\\rangle$ |\n", |
This wasn't rendering properly - I think it was missing the verts
No description provided.