Chapter 8: Quantum Algorithms I – Deutsch-Jozsa and Bernstein-Vazirani
The Deutsch-Jozsa and Bernstein-Vazirani algorithms are two long-established examples that illustrate that quantum algorithms can be exponentially faster than classical ones in certain kinds of problems. In this chapter, we will use these algorithms to showcase basic features of Silq implementation, such as variable assignment, state superposition, controlled application and measurement, as well as safe uncomputation: one of the key concepts of the Silq language.
In this chapter, we are going to cover the following main topics:
- Quantum parallelism and interference
- The Deutsch-Jozsa algorithm – classical and quantum solutions along with the Silq implementation
- The Bernstein-Vazirani ...
Get Quantum Computing with Silq Programming now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
