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

Quantum superdense coding

In quantum teleportation, we saw that two classical bits are used to transfer a quantum state from Alice to Bob. In superdense coding, we use a single quantum state to send two classical bits.

There are two classical bits, which means a total of 4 combinations. Now, depending on Alice and what she wants to send to Bob, she will apply one of the following gate operations:

  • If Alice wants to send 00, then nothing is done.
  • If Alice wants to send 01, then a Z gate is applied.
  • If Alice wants to send 10, then an X gate is applied.
  • If Alice wants to send 11, then ZX is applied.

Figure 3.15 shows the circuit for the superdense coding:

Figure 3.15 – Superdense coding circuit

From Figure 3.15, you can see that Alice generates a shared entanglement between qubits a and b and, to encode her secret message, she uses the X gate, which means she is sending value with 10 as information to Bob. Bob then undoes the...