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

Implementing the Deutsch-Jozsa algorithm

The Deutsch-Jozsa algorithm refers to a quantum algorithm designed by Richard Cleve, Artur Ekert, Chiara Macchiavello, and Michele Mosca in 1998, improving on the 1992 version from David Deutsch and Richard Jozsa. It was created with the idea of showing that the power of state superposition in a quantum algorithm could significantly reduce the number of computation steps needed compared to its classical counterpart.

In this section, you will learn how to solve a Deutsch-Jozsa problem theoretically both in a classical and in a quantum way. You will then practically implement a quantum algorithm solving that problem while gaining intuition of some of Silq's core features.

Problem statement

Let's start by defining a problem that can be solved by the Deutsch-Jozsa algorithm. The objective is to determine the nature of a function, , which takes as input an n-bit integer and returns either 0 or 1. We are guaranteed that this function...