Follow here for comics and classes on Quantum Computing updates every week.
To make the experience fit your profile, pick a username and tell us what interests you.
We found and based on your interests.
UPDATE:
Class of 2020 had finished. I learned a lot by teaching the class on Sunday since March and digesting complex ideas into drawings. Hope you enjoyed it as much as I did. All the recordings can be found here.
We also have a cartoon "textbook" which can be found in 13 markets on Amazon. Search for ASIN : B08HGLPZXP Quantum Computing & Some Physics
See you in future classes!
***
We discussed a new topic for 30 mins every week. The topic is based on my comics of the week below in the log. You can also follow progress of the drawings on my website, LinkedIn, Twitter, Instagram and YouTube. Hackaday is adding the classes gradually to their channel here: Intro to Quantum Computing playlist
You can send questions and requests in the comments section below. I'll address them in the comics, in the comments or during the class. Past recordings are in the description of the slides under the "Files" areas.
***
Quantum computing has been a hot topic since the past couple of years, especially with recent progress made in industry. However, there hasn't been enough materials to lead hobbyists into the subject, as most books and papers are written for professional academics and media articles are technically shallow. These hobbyists include scientists, engineers, developers and hackers who are highly technical but may not have a background in quantum computing. Even with a PhD in Applied Physics who studied quantum properties of materials, I did not know how quantum computers worked. As I started learning the subject, I realize that one does not need a degree in physics to understand quantum computing. All they need is some necessary math and physics foundations. This subject can be taught in a straightforward way at the right level. Once people know what goes into quantum computing, they will be able to dig deeper and demystify the subject.
As I've been teaching our employees at Microsoft, I've built up a series of systematic materials from basic concepts to algorithms to hardware systems, and a tutorial on Q# (Qsharp)  a domainspecific programming language used for expressing quantum algorithms. Typically we took a few months to go through all the basic concepts. Every class was followed by a few Q# exercises. But it is doable for a 2hour workshop, such as the one at Hackaday Supercon. On November 15, 2019, I gave a workshop on a handson introduction to Quantum Computing at Supercon. Here are the slides for everyone. It might felt like a lot to people who encountered the concepts for the first time. But if they go back to the slides now, they'll be able to recall and digest at their own pace. The workshop was also on high demand. We didn't have enough space for more people. So anyone who missed it can take a look at the slides which hopefully can give them directions to study further.
Please feel free to post any questions and discussions in this project page. And any mistakes to correct in the slides. I'll try to answer them here. Enjoy!
Slides Nov 1.pdfSession 25: Quantum Error Correction by Dr. Michael Beverland Recording: https://youtu.be/5zFpLLaVmAsAdobe Portable Document Format  1.89 MB  11/01/2020 at 20:51 


qcvv_Chris.pdfSession 24: Quantum Tomography by Prof. Chris Ferrie Recording: https://youtu.be/utH6YcaoGTEAdobe Portable Document Format  887.31 kB  10/19/2020 at 15:17 


Slides Oct 18.pdfSession 24: Quantum Tomography by Prof. Chris Ferrie Recording: https://youtu.be/utH6YcaoGTEAdobe Portable Document Format  1.02 MB  10/19/2020 at 15:18 


qml_maria.pdfSession 23: Quantum Machine Learning by Dr. Maria Schuld Recording: https://youtu.be/DGNc0gmtumEAdobe Portable Document Format  3.57 MB  10/13/2020 at 09:47 


Slides Oct 11.pdfSession 23: Quantum Machine Learning by Dr. Maria Schuld Recording: https://youtu.be/DGNc0gmtumEAdobe Portable Document Format  778.06 kB  10/11/2020 at 19:44 


Notes from the last Hackaday Quantum Computing class last week on quantum error correction by Dr. Michael Beverland. Recording below.
And that's a wrap for this year! I learned a lot by teaching the class on Sunday since March and digesting complex ideas into drawings. Hope you enjoyed it as much as I did. All the recordings can be found here.
We also have a cartoon "textbook" which can be found in 13 markets on Amazon. Search ASIN : B08HGLPZXP
See you in future classes!
Today is the last quantum computing class of the year at Hackaday and Microsoft Reactor. Make sure to tune in at 11:30 am PT (note the daylight saving time shift) for the season finale on quantum error correction by guest lecturer, Dr. Michael Beverland.
Abstract:
Why have you never experienced superposition in every day life, like a state of Schrodinger's cat being both dead and alive? The reason of course is that noise causes decoherence of the superposition state, collapsing it into either of the two parts of the two cases. To build a large scale quantum computer we need special techniques to overcome these effects and protect the information from collapsing their precious superposition. Today we will cover the field of Quantum Error Correction which is tasked with this great challenge.
Bio:
Michael Beverland is a senior researcher in Microsoft Quantum, specializing in quantum error correction and fault tolerance. He did his postdoctoral work with Krysta Svore at Microsoft Research, his doctoral work with John Preskill at Caltech, and undergraduate studies in Cambridge, England. His research interests span the following topics: topological codes, universal quantum gates, scalable faulttolerant quantum computing, code switching, noise models, and statistical mechanical approaches to quantum error correction.
Notes from last week's class by Prof. Chris Ferrie's on Quantum Tomography.
No class today on Oct 25. Come back next week for Quantum Error Correction by Dr. Michael Beverland.
Here's the condensed notes from Dr. Maria Schuld's QML class last Sunday. Note today's class by Prof. Chris Ferrie is at a later time.
Abstract:
You might have done a bit of selfstudy. You might have participated in a quantum hackathon. You might have got an awesome certificate from Kitty — and had it printed on a mug! You might have even implemented a quantum algorithm on a cloudbased quantum computer. By all accounts, you might have become a quantum coder. That’s great, because I have a problem. Someone gave me this quantum device, but I have no way of proving it really is a quantum device! Can you help me? Quantum tomography defines the problem of characterising an unknown quantum device. Unlike deductively stepping through a quantum algorithm to find out what the output is, quantum tomography gives you the output and asks how it came to be. Since quantum physics is probabilistic, this is an inductive problem — there is no unique solution. That is maybe a bit frustrating because finding out what a device does is important. Let me tell you about it.
Speaker Bio:
Chris Ferrie is an Associate Professor at the University of Technology Sydney and the Centre for Quantum Software and Information. His research interests include quantum estimation and control, and, in particular, the use of machine learning to solve statistical problems in quantum information science. He obtained his PhD in Applied Mathematics from the Institute for Quantum Computing and University of
Waterloo (Canada) in 2012. Chris’s passion for communicating science has led from the most esoteric topics of mathematical physics to more recently writing children’s books, such as Quantum Physics for Babies, and a whole collection of other titles that make science accessible even for the youngest children.
Dr. Maria Schuld, Xanadu and University of KwaZuluNatal in Durban, South Africa, Quantum Machine Learning
Note some changes in schedule for next two guest lectures.
Abstract:
This talk is a guided tour through the emerging research discipline of quantum machine learning, which investigates how quantum computers could be used for "intelligent" data analysis. A focus will be the strategy of optimizing the physical parameters of a quantum circuit in order to train it like a neural network. We will try to understand what the resulting models look like, how they can be integrated into modern machine learning pipelines, and what the most pressing open questions are.
Speaker Bio:
Maria Schuld works as a senior researcher for the Torontobased quantum computing startup Xanadu, as well as for the Big Data and Informatics Flagship of the University of KwaZuluNatal in Durban, South Africa, from which she received her PhD in theoretical physics in 2017. She coauthored the book "Supervised Learning with Quantum Computers" (Springer 2018) and is a lead developer of the PennyLane software framework for quantum differentiable programming. Besides her research on the intersection of quantum computing and machine learning, Maria has a postgraduate degree in political science, and a keen interest in the interplay between emerging technologies and society.
Learn about project qTrill from Rolf Huisman presentation and demo at https://lnkd.in/dY6_duU
As announced, we won't have a quantum computing class today at Hackaday (I'm doing a review of a robotics arm on Instagram Live).
My talk at Zen4Quantum yesterday on Grover's algorithm recording here: https://lnkd.in/dy3WQXN
Also join us for #Hacktoberfest . We are doing a kickoff on Oct 8: https://lnkd.in/dR69GCc
I'd like to see more quantum curious become quantum professionals.
Today's guest lecture:
Rolf Huisman, Q# Community, Introducing the open source Q# Community project qTRIL
Abstract:
We from the Q# Community are group of folks who are excited about Quantum Programming! We maintain and collect open source projects related to the Q# programming language to make it even more useful and pleasant to use. Because the current physical Quantum Computers are still limited power and functionality, a lot of development is done on Quantum simulators. The integrated simulators of Quantum Development Kit (QDK) are often enough, but depending on your hardware there might be other simulators that would be better suited for your task. Our latest project qTrill, makes it possible to run Microsoft Q# programs on those tailored simulators. We can make that work by plugging into the extensibility of the runtime, so let's run through how that works and how you can add your own.
Speaker Bio:
Rolf is an experimental technology enthusiast who likes playing with technologies which aren’t mainstream already. After tasting FPGA's for high performance computing, he got introduced to Quantum Computing after which he got addicted to it. Together with Sarah Kaiser he maintains the Q# community, which is a space for communitydriven open source projects and contribution libraries for Q# Quantum Computing language. During his daytime job Rolf works as an enterprise security architect within a large international bank. His personal interests include experimental technologies, high performance computing, analog electronics, security and discrete mathematics. In his free time, next to reverse engineering systems and writing code, he builds machines like 3D printers, CNC machines, and FPGA processor boards.
Questions and answers captured in the class:
Some were answered in the chat and some were answered in the class. Please watch recording if you don't find the answer to your questions.
[8:49 PM] skaiser (Guest) If you want to join the Q# community slack: http://slack.qsharp.community
[8:56 PM] Kitty Yeung
MS Learn module link: aka.ms/learnqc
[8:57 PM] Sumit Kaul (Guest) Was the quantumclass in c#?
[8:58 PM] Sumit Kaul (Guest) In stabiliserprocessor?
[9:00 PM] skaiser (Guest) qsharpcommunity/chpsim: CHP Simulator for Q# (github.com)
[9:02 PM] s1m0n (Guest) @skaiser all algorithms, do you gonna code in c# or q# DSL?
[9:06 PM] skaiser (Guest) s1m0n the algorithms we will be implementing in http://quantumalgorithmzoo.org/ (github.com) will be done in Q#. The C# Rolf Huisman (Guest) is showing is for some of the backend simulators that we want to try running the Q# code with.
[9:02 PM] Sumit Kaul (Guest) So q# also complies to IL?
[9:05 PM] Sumit Kaul (Guest) Please if you could touch on quantum memory architecture and MS plan for how they are looking at tackling quantum memory
[9:08 PM] Sumit Kaul (Guest) Can we use IOC to supply simulator on the fly using some kind of global bootstrap too or there is something like this already?
[9:09 PM] skaiser (Guest) Sumit Kaul not from MS, but quantum memory or qRAM is a pretty open question right now for the community, especially when it comes to hardware. Basically, the cost of implementing qRAM can in some cases outweigh the advantages of the quantum algorithms using them
[9:11 PM] s1m0n (Guest) @Rolf: Azure already offer any type q# services?
[9:11 PM] Sumit Kaul (Guest) So any thing what’s ms plan for qram?
[9:12 PM] skaiser (Guest) s1m0n There is a service called Azure Quantum Azure Quantum  Microsoft Azure where you can sign up for the private preview
[9:13 PM] Sumit Kaul (Guest) Thank you, this helps to explain nuts and bolts.. question I had for a while
[9:13 PM] skaiser (Guest) also if you want to learn more about Azure quatum https://myignite.microsoft.com/sessions/37e835e8d8d440c78cdc4dceee0bddd5
[9:14 PM] Sumit...
Read more »Here is a summary of last week's intro to quantum key distribution by Prof. Terrill Frantz. Note the guest lecture by Prof. Chris Ferrie scheduled for today is postponed to October 25. There's no topic to discuss for today. Register to attend Microsoft Ignite and take the new quantum modules on MS Learn.
We have a few guest lectures lined up for September and October.
Today we have Professor Terrill Frantz talking about Quantum Cryptography. I'll be drawing comics during the talk.
Also, the comics are now put into a book/notebook format. You can use it as a companion book for the classes. It also makes a good gift for someone who are interested in learning about quantum computing and seeing the integration between science and art. “Quantum Computing & Some Physics: The Quantum Computing Comics Notebook,” is available to on Amazon (this links to the US market. For other markets, search in your respective Amazon site ASIN : B08HGLPZXP)
Abstract:
Building on Kitty's two sessions on RSA encryption and Shor's Algorithm, in this session, we will talk briefly about the overall state of cryptography as it relates to quantum and quickly introduce some nonquantum techniques being studied to to take digital security into a postquantum setting. We will also cover a quantum key distribution (QKD) technique known as BB84, which relies on the "magic" of quantum physics to allow Alice to exchange private keys with Bob with the added benefit of knowing if Eve has intercepted their exchange  a feature not possible in classical encryption.
Speaker Bio:
Terrill Frantz is a professor at Harrisburg University of Science and Technology in the USA, where he teaches precollege, undergraduate, graduate and PhD courses in quantum computing, among other subjects. He recently pivoted into quantum computing after working with classical computing software for over 46 years! Terrill runs https://www.meetup.com/PhiladelphiaHarrisburgQuantumComputingMeetupGroup/ and manages http://live.quantumapalooza.com/
We will be starting some special events this month. For today's class we will look at some basic ideas about topological qubits.
Sunday weekly class at 11:30am PDT. Join Microsoft Teams Meeting.
For phone options:
+1 3238494874 United States, Los Angeles (Toll)
Conference ID: 636 979 670#
We will discuss a new topic for 30 mins every week. The topic will be based on my comics of the week.
Microsoft //Build developer conference. Quantum sessions will include several exciting announcements for learners. Register and attend for free. Follow Twitter @MSFTQuantum @docsmsft
Harnessing the problemsolving power of quantum computing webinar  7 May 2020 https://note.microsoft.com/MSRQuantumComputingRegistrationLive
Check out this Superposition game by my colleague Sarah Marshall: https://www.sarahmarshall.name/blog/themanyworldsofschroedingerscat.html
And a 15 min interview on Quantum Machine Learning and Azure Quantum with Alex Bocharov, Principal Researcher at Microsoft Quantum Systems group and Chris Granade, Senior Research Software Development Engineer, by Vadim Karpusenko, Cloud Developer Advocate at Microsoft : https://channel9.msdn.com/Shows/AIShow/QuantumMachineLearningandAzureQuantum
Create an account to leave a comment. Already have an account? Log In.
Hi Kitty, I was reviewing class #5/ comic #23 (teleportation) and I can’t figure out why, when Alice entangles her new qubit A'> to the previously entangled pair A> B>, she firstly applied the CNOT gate then secondly the Hadamard gate: that is the reverse order of gates to obtain entanglement, isn’t it? May you please elaborate on this step a bit more?
Great question, Davide. The best way to see it would be to go through the math at each step. What happens if you reverse CNOT and H? Would it work for some states? A'> in general is a superposition state of 0> and 1>. What happens if you apply a H gate? Another place to look is jumping to Session 13: Teleportation + codingRecording: https://youtu.be/nPJeIJ5934 and try coding the circuit with Q#.
My question is about the Basic Gates kata, Task 2.3. Twoqubit gate  3. I can do it by thinking intuitively about what gates do, but I don't want to rely on intuitions. I'm looking for a way to do it using only matrices (maybe by writing down the matrix for the multiqubit transformation that I want to achieve, and factoring that matrix into the matrices for basic gates). Is there a way to do something like this?
Hi Barry, for sure, you can express all quantum gates as matrices and qubits as vectors. For this question, you can write down the CNOT matrices and control and target qubits.
I have no doubt that I can express a sequence of basic gate operations with matrices. My question is, are there mathematical tools to find a sequence of operations to go from an arbitrary start state to a desired target state. The basic gates H, CNOT, and Phase45 are universal  so is there a method to determine which of them to apply?
Interesting thought. We can use the arbitrary general matrices that are described by each qubit's angles and then calculate what the angles are. Then we will find out which universal gates they are. We can calculate manually or express in a generic tool like Mathematica or MatLab. 2x2 matrix would be easy but as the matrices grow bigger, it can get messy.
Enjoyed reading the article above , really explains everything in detail,the article is very interesting and effective.Thank you and good luck for the upcoming articles https://www.syscomax.com/
Hi, I'm currently in class 3 where you explain quantum entanglement. Say, there are 3 quantum particles in entanglement. Is this ( 1 ∕√2  000> + 1 /√2  111> ) the only possible configuration. I guess they can be entangled in any possible ways.
If yes, consider the state ( 1 ∕√2  010> + 1 ∕√2  011> ). Here if we observe the first two particles, the third particle's state cannot be determined. On the other hand, it is enough to observe only third particle. Is this valid entanglement?
Hi, thanks for asking. We can entangle them in many different ways. ( 1 ∕√2  000> + 1 /√2  111> ) is a maximally entangled state. The amplitude in front of each term can also be different. The example you gave does not have the three qubits entangled though. When we measure the third qubit (or any qubit), we still won't know what the other two qubits are. It is not different from writing 1 ∕√2  01>(0>+1>) then we can see the first two qubits are not correlated with the last qubit. Whereas in the case of ( 1 ∕√2  000> + 1 /√2  111> ) we cannot write them as separate qubits.
Now I understood the correlation part. Thank you for the clear explanation.
Hi, Sorry to asked but I can not find the link for the first recorded session, Supercon quantum computing workshop share_Kitty Yeung.pdf. Thanks
Here's the link adress, https://youtu.be/ZShByvAUAc
there is superposition like 1/2(00⟩+𝑖01⟩−10⟩−𝑖11⟩), how to understand when there is imaginary part? for 01⟩, i^2 = 1, does it have a negative probability to appear? or we only consider the real part, so the probability of 01⟩ and 11⟩ is 0?
Great that you are asking about this! Thank you. I have not mentioned this part in order to reduce the math for beginners. We cannot have negative probability. In fact, it should be the modulus  i ^2 that we calculate for probability, so the amplitude can be any number. If you express an imaginary number with magnitude and phase, you will see that it is the magnitude (always positive) squared that gives the probability. I can show this detail in one of the next classes. Glad we are ready.
Can anyone help me with setting up the katas on my local computer? I'm working on Windows but I can also try using a Mac. I was able to open a notebook but I kept getting messages that the server couldn't obtain a lock (apparently from dotnet). Then I saw a note about uninstalling microsoft.quantum iqsharp and installing a particular version. When I try to reinstall iqsharp, I get an error message Failure to install and it gives four possible reasons.
Frankly, I'm lost because I'm not an experienced dotnet or jupyter user. If anyone has time for a brief online help session, that would be great.
Hi Barry, sorry to hear your experience with the installation was not smooth. Let me know which instruction you were using and I can see how to update it. There are several ways to run quantum program locally: https://docs.microsoft.com/enus/quantum/installguide/ I personally prefer the Q# command line application option. The instruction guides you to install VS Code and install the QDK extension there. Then you can clone the katas repo and run the .qs files lovally. No iqsharp is need for this one. You can also try this handson guide: https://docs.microsoft.com/enus/learn/modules/qsharpcreatefirstquantumdevelopmentkit/ where it walks you through the above step by step. It also teaches how to build a quantum random number generator if you are interested in finishing the whole tutorial.
Kitty,
your presentation at the Makers' Faire was excellent. And actually your second about fashion was interesting.
I have a question, what is your recommendation for a beginning quantum mechanics text and a good math review text. I feel comfortable with restarting my undergrad calculus.
Thank you
Hi John, thank you for attending both sessions.
For quantum mechanics, a widely used one is Introduction to Quantum Mechanics by David Griffith.
A book on quantum computing that everyone uses is: Nelson and Chaung, Quantum Computation and Quantum Information – 10 th Anniversary Edition (you can find free PDFs to download). It's not the most easy to read though. I heard this one is pretty good: Quantum Computing: An Applied Approach, and Quantum Computing for Software Engineers.
If you are interested in hardware (not specifically for quantum computers), I loved Introduction to Solid State Physics by Charles Kittel.
For math...maybe the standard highschool and undergrad textbooks from China? See if they have translations into English. I haven't used textbooks for math for a while. My undergrad was in England and can't remember what we used there. The lecture notes were pretty good. Are you in the UK?
Thanks for the book recommendations.
I live in Delaware, recently retired from pharma industry, PhD in analytical chemistry. Now I can pursue my intellectual hobbies. I needed a refresher in linear algebra and matrices.
I looked at the chem quantum stuff. It is above my knowledge but it is the same old boring stuff with H atoms. As an analyst I am more interested in finding signals in the noise.
Thank you for your help
Look Kitty is at the Maker Faire
https://makerfaire.com/virtuallymakerfaire2020/schedule/
Saturday morning at 7 am EDT
I'm looking forward to her talk
Hi class, this is a good class. I also recommend you to join weekdays/Saturday free virtual meetup events to meet quantum computing experts from Xanadu, Rigetti, Harrisburg University, QC Ware , Udemy, BEIT, Cambridge Quantum Computing and so on. Here are my groups: 1. https://www.meetup.com/WashingtonQuantumComputingMeetup/ 2. https://www.meetup.com/PhiladelphiaHarrisburgQuantumComputingMeetupGroup/ 3. https://www.meetup.com/zen4maker/ 4. https://www.meetup.com/associationquantum/ 5. https://www.meetup.com/quantumcomputingandbigdata/
I was looking for a good book as a handbook for my Quantum Theory studies to review and discuss Lie groups, Clifford Algebras, SU(2), tensors, spintors, and just a bunch of fundamentals that are spotty in my past. I found this book where the author shares it freely on the Internet (I'm buying it from Amazon because I'm a nice guy).
If you're interested, the book is called "Quantum Theory, Groups and Representations: An Introduction" by Peter Woit.
He makes it publicly available a la his professor's site at Columbia:
http://www.math.columbia.edu/~woit/QM/fallcourse.pdf
Maybe more technical than most would want, but for those looking to read deeper with a companion handbook for the formalism behind the physical application, this seems to cover a lot that I have been looking for in a bunch of other books.
Enjoy!
Aaron
Thanks, Aaron. If you like to give a presentation when you are ready, let me know.
Hey Kitty, I was reviewing past slides and I have a question about number 11 (about the weather). I dont understand why there is a nagative amplituded in the quatum calculation. Is it a real example in that for these number this must be the correct calculation or is the negative case one of several possibilities. I wonder if the point of this slide is that there are solutions represented by both negative and positive terms and this just illustrates one example of what the solution could be.
Yes, the negative sign was put there on purpose to show what happens if the amplitude can be negative, since in the quantum case the amplitude can be positive or negative.
Thank you, Robert. That's a good division of my question into parts.
Thanks Barry and Robert.
There is a set of gates that can be combined to produce any arbitrary amplitude of a qubit. With three qubits, you will apply those gates to them individually so you get the a,b,c,d,e,f,g,h, you want. A way to visualize a qubit is the Bloch sphere  a 3D representation of a qubit vector. You can write any arbitrary gates into a gate (matrix) to move the vector along the Bloch sphere. This will exactly be the topic for the coming week. Watch out for my comics on Wednesday and Sunday.
(this is in response to the question Barry asked at the end of class and in the chat application)
Barry, I wonder if your question can be broken down into two parts. 1) given a 3qbit system with state amplitudes (a,b,c,d,e,f,g,h), what at the 3 qbit states that produce it and 2) how do you manipulate a qbit to have a particular state other that 0,1 and root(2)?
Will this coming week's session be on Zoom again? I heard talk about moving to a more secure platform.
Thanks for asking. Yes, we will use Microsoft Teams moving forward. See updated link in the project description and instruction.
Hi Marcelo, in the Files section above you will find the first two video classes and their accompaning slides. Note that the video URLs do not come in as links for me so I had copy and paste them. The third meeting will be next Sunday.
Just joined! I am new to Quantum Computing. Where do I start?
I was looking for an answer like "watch the recording of the first class". Or "start by visiting the logs pages."
You got it ;) Recording, links, logs, slides are all in here. Please read the project details.
Become a member to follow this project and never miss any updates
I love the illustrations