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)
1
Section 1: Essential Background and Introduction to Quantum Computing
6
Section 2: Challenges in Quantum Programming and Silq Programming
10
Section 3: Quantum Algorithms Using Silq Programming
14
Section 4: Applications of Quantum Computing

Getting started with Grover's search algorithm

Grover's search algorithm is a quantum version of the searching algorithm that helps to accomplish an unordered search, which means finding an element or multiple elements in a database or array. This algorithm shows the power of quantum computing in the sense that it minimizes the number of operations to carry out the searching process compared to its classical search versions. Grover's algorithm provides a speedup in the searching process and utilizes the technique of amplitude amplification for the marked item that we are trying to search.

As you already saw in Chapter 8, Quantum Algorithms I – Deutsch-Jozsa and Bernstein-Vazirani, how the algorithms required an oracle in order to run, in a very similar manner, Grover's algorithm also requires an oracle that encodes the marked item (the element that we want to search) in a list of several items. This oracle is known as Grover's oracle and can be thought...