Book Image

Quantum Computing with Silq Programming

By : Srinjoy Ganguly, Thomas Cambier
Book Image

Quantum Computing with Silq Programming

By: Srinjoy Ganguly, Thomas Cambier

Overview of this book

Quantum computing is a growing field, with many research projects focusing on programming quantum computers in the most efficient way possible. One of the biggest challenges faced with existing languages is that they work on low-level circuit model details and are not able to represent quantum programs accurately. Developed by researchers at ETH Zurich after analyzing languages including Q# and Qiskit, Silq is a high-level programming language that can be viewed as the C++ of quantum computers! Quantum Computing with Silq Programming helps you explore Silq and its intuitive and simple syntax to enable you to describe complex tasks with less code. This book will help you get to grips with the constructs of the Silq and show you how to write quantum programs with it. You’ll learn how to use Silq to program quantum algorithms to solve existing and complex tasks. Using quantum algorithms, you’ll also gain practical experience in useful applications such as quantum error correction, cryptography, and quantum machine learning. Finally, you’ll discover how to optimize the programming of quantum computers with the simple Silq. By the end of this Silq book, you’ll have mastered the features of Silq and be able to build efficient quantum applications independently.
Table of Contents (19 chapters)
Section 1: Essential Background and Introduction to Quantum Computing
Section 2: Challenges in Quantum Programming and Silq Programming
Section 3: Quantum Algorithms Using Silq Programming
Section 4: Applications of Quantum Computing

Introducing search algorithms

In Chapter 8, Quantum Algorithms I – Deutsch-Jozsa and Bernstein-Vazirani, you saw and implemented function checking algorithms that helped you to identify whether a particular function is constant or balanced. Now, in this chapter, we will be building upon the foundations of function checking and will implement the famous quantum searching algorithm known as Grover's search algorithm.

Before we begin our discussion on quantum search algorithms, let's first understand the search algorithms classically available to us. The two most prominent search algorithms are linear search and binary search, which are used widely to search for an element in a database or array. In linear search, each element of the array is traversed and is compared with the marked element that we are trying to search. Since each element is being compared, if the desired element is present at the very end of the array, then it will take N searches to find the desired...