Quantum Algorithms for Cryptographically Significant Boolean Functions: An IBMQ Experience

This book provides an up-to-date overview of quantum algorithms for Boolean function analysis, covering topics such as Qubit, Deutsch–Jozsa, Walsh spectrum, Grovers algorithm, Simons algorithm, and autocorrelation spectrum. It aims to bridge the gap between theoretical developments and practical implementations, encouraging readers to design and implement algorithms in this field.

Format: Paperback / softback
Length: 118 pages
Publication date: 20 July 2021
Publisher: Springer Verlag, Singapore

This comprehensive book serves as a timely and cutting-edge exploration of the state-of-the-art analytical techniques in the realm of quantum algorithms, specifically focusing on Boolean functions. By seamlessly bridging the gap between recent advancements and the hands-on analysis of spectral properties from a cryptologic perspective, it offers a valuable resource for researchers, practitioners, and educators alike.

The book delves into a wide range of topics, including Qubit, Deutsch–Jozsa, and Walsh spectra, Grovers algorithm, Simons algorithm, and autocorrelation spectrum. Its primary objective is to inspire readers to develop and implement practical algorithms related to Boolean functions. In addition to traditional combinatorial techniques, the book also explores the implementation of related programs in a quantum computer, providing a holistic approach to this field.

With its extensive coverage, detailed explanations, and practical examples, this book is an invaluable asset for anyone seeking to deepen their understanding of quantum algorithms and their applications in cryptology. Whether you are a seasoned researcher, a practicing professional, or an educator, this book will provide you with valuable insights and knowledge to advance your understanding of this rapidly evolving field.

Weight: 215g
Dimension: 235 x 155 (mm)
ISBN-13: 9789811630606
Edition number: 1st ed. 2021