Quantum operations are operations use to manipulate quantum bits (or qubits, for short) in a quantum circuit. They include quantum gates (like the Pauli-Z gate), as well as operations that are not quantum gates (like the IF operation). This is a short introduction to some of the gates I’ll be using in the future in Quantum Algorithms.

The T gate applies a 𝛑/4 phase to a qubit. It is also sometimes referred to as a 𝛑/8 gate. This gate is not a Clifford gate. The IBM Quantum Experience symbol for this gate is:

Hello everyone! While I was doing the TKS (The Knowledge Society) West Coast Focus Hackathon, I learned a lot of new and interesting things about Quantum Computing. One topic which I found very interesting was the Superdense Coding Protocol and Quantum Cryptography (article on that later!). In this article, I will talking about the Superdense Coding protocol. Enough of me blabbing; let’s dive in!

SDC, or Superdense Coding, is a type of Quantum Cryptography in which two classical bits of information are transmitted using one quantum bit, or a qubit. Think of it as a flipped version of Quantum Teleportation…

After learning about Grover’s Algorithm, I decided to try my hand at programming it for two and three qubits — in Python 3 using IBM Quantum Experience’s Quantum Lab and Jupyter (Notebook)! In this article, I will guide you through my steps, as well as what I learned. Please, follow along! By the way, here’s the tutorial I followed.

Before we get started, there are a few things we will need to do. First, and foremost, if you don’t know what Grover’s Algorithm is, here is a Medium article by me about Grover’s Algorithm. Secondly, you will need an IBM…

Grover’s algorithm is a search algorithm designed for use by quantum computers, which was invented by Lov Grover in 1996. This algorithm demonstrates the unparalleled speed of a quantum computer in the task of searching databases. It can also increase the speed of *unstructured searches* quadratically, but it has many more uses than just that. You can also use it as a “hack” to quadratically improve the run-time of many other algorithms. This “hack” is called the *amplitude amplification trick. *But first, let’s investigate the *unstructured search *problem.