Last week, we reviewed Grover's algorithm, which is one of the first few quantum algorithms developed to demonstrate how a quantum computer can outperform classical computers. During this session, we will discuss different challenges that may have come about in constructing quantum circuit for a 2-qubit (or 4-states) Grover’s algorithm project. Members of the two teams (A and B) are encouraged to present what they have learned over the weeks.
Here is a nice video explaining Grover’s algorithm:
In the next sessions, we shall explore how one can understand Grover’s search algorithm geometrically. This allows for a more elegant demonstration of the power of this quantum algorithm.
This session takes place on 27.05.2021 (Thursday) at 7 PM (Nepali time). Please join in below:
News and Events
OneQuantum Africa Summit | Francesco Petruccione | The Global Quantum Tech Ecosystem, highlighting State of Quantum in Africa
OneQuantum Africa Summit | Mourad Telmini | Quantum Sensing and Metrology (Opportunities and Challenges for Africa)
QML Meetup: Dr. Maria Schuld, Taking stock of quantum machine learning - a critical perspective
Africa Science Leadership Programme (ASLP) | Call for applicants 2021
Hear the latest in machine learning from industry-leading scientists, AWS customers, and experts.
Here is a course on Linear Algebra for Quantum Computing to consider
Podcast | Forwards & Backwards: A History of Quantum Computing
IBM on track with next-level, 1,121 qubit quantum computer by 2023
Ireland to set up first dedicated quantum computer engineering center
QTC Awarded $1.5M from the Department of Energy for Research on Quantum Diamond Magnetometers
Google unveils new Quantum AI campus and aims for Commercial-Grade Quantum Computer by 2029
Diamonds are a girl's best friend, but they are also very popular with quantum scientists
Comparison of Cloud-Based Ion Trap and Superconducting Quantum Computer Architectures
Quantum Computational Supremacy via High-Dimensional Gaussian Boson Sampling