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 Simon's algorithm

Simon's algorithm is one of the most important algorithms, which provides us with an intuition about the periodicity of a particular function; in other words, it helps us to find when a function repeats itself. Simon's algorithm is also called the periodic quantum algorithm and it provides an exponential speedup as compared to classical period-finding algorithms.

The main goal of Simon's algorithm is to find whether a given function is one-to-one or two-to-one, for which they are defined as having the following properties:

  • One-to-one: This function will map unique inputs to unique outputs, such as .
  • Two-to-one: This function will map two inputs to a unique output, such as .

For the two-to-one mapping process, we have a secret bit string, b, which helps to check whether the function is two-to-one or not. The condition is that if

In Simon's algorithm as well, we will use an oracle or black-box model, , to...