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 quantum parallelism and interference

In this section, we will look at quantum parallelism and quantum interference: two mechanisms that are often used in combination in quantum algorithms to reduce the number of computation steps compared to classical ones. Thanks to this, you will be able to understand how to take advantage of quantum computing to design algorithms.

Quantum parallelism

In a classical computer, information is kept in memory registers consisting of bits with values equal to either 0 or 1. Quantum memory registers differ because each of their constituting qubits can be in a superposition of the and basis states, leading the quantum memory register itself to potentially be in a superposition of states. From this ability to represent several states, which can be viewed as inputs to a function into one single state, arises a quantum phenomenon known as quantum parallelism. Applying a function to a state in superposition produces the superposition of...