Lavoisier S.A.S.
14 rue de Provigny
94236 Cachan cedex
FRANCE

Heures d'ouverture 08h30-12h30/13h30-17h30
Tél.: +33 (0)1 47 40 67 00
Fax: +33 (0)1 47 40 67 02


Url canonique : www.lavoisier.fr/livre/autre/quantum-algorithms-for-cryptographically-significant-boolean-functions/descriptif_4694061
Url courte ou permalien : www.lavoisier.fr/livre/notice.asp?ouvrage=4694061

Quantum Algorithms for Cryptographically Significant Boolean Functions, 1st ed. 2021 An IBMQ Experience SpringerBriefs in Computer Science Series

Langue : Anglais

Auteurs :

Couverture de l’ouvrage Quantum Algorithms for Cryptographically Significant Boolean Functions
This book is a timely report of the state-of-the-art analytical techniques in the domain of quantum algorithms related to Boolean functions. It bridges the gap between recent developments in the area and the hands-on analysis of the spectral properties of Boolean functions from a cryptologic viewpoint. Topics covered in the book include Qubit, Deutsch?Jozsa and Walsh spectrum, Grover?s algorithm, Simon?s algorithm and autocorrelation spectrum. The book aims at encouraging readers to design and implement practical algorithms related to Boolean functions. Apart from combinatorial techniques, this book considers implementing related programs in a quantum computer. Researchers, practitioners and educators will find this book valuable. 
1. Introduction.- 2. Deutsch-Jozsa and Walsh Spectrum.- 3. Grover’s Algorithm and Walsh Spectrum.- 4. Simon’s Algorithm and Autocorrelation Spectrum.- 5. Conclusion & Research Direction.
THARRMASHASTHA SAPV is Research Scholar and pursuing Ph.D. in Computer Science at the Indraprastha Institute of Information Technology Delhi (IIITD), India. He completed his 5-year integrated M.Sc. in Mathematics with first-class honours from Integrated Science Education and Research Centre (ISERC), Visva Bharati, West Bengal, India. His area of research is quantum algorithms for Boolean functions. Since he is a regular contributor of Qiskit, he is recently selected as Qiskit Advocate. His team won the second prize in IBM’s Teach Me Quantum competition in 2019.
 
DEBAJYOTI BERA is Assistant Professor at the Indraprastha Institute of Information Technology, New Delhi, India. He completed his Ph.D. in Computer Science from Boston University, USA, in 2010, and B.Tech. in Computer Science and Engineering from the Indian Institute of Technology Kanpur, India, in 2002. His current research interests include computational complexity theory, quantum computing, algorithmic techniques in data mining, network analysis, and information security.
 
ARPITA MAITRA is Assistant Professor at TCG-CREST, Kolkata, India. She has been working in the domain of quantum information since 2001. She completed her Ph.D. from Computer Science and Engineering Department, Jadavpur University, India. She has published more than 20 research papers in reputed journals and conferences in the broad area of quantum secure communication.
 
SUBHAMOY MAITRA is Professor at the Applied Statistics Unit of the Indian Statistical Institute, Kolkata, India. He earned his Ph.D. and graduate degree in computer science from the Indian Statistical Institute, Kolkata, India, and undergraduate degree in electronics and telecommunications engineering from Jadavpur University, Kolkata, India. Post working in the domain of hardware and software engineering for a few years, Professor Maitra joined the Indian Statistical Institute, Kolkata, as Faculty
Discusses recent developments on Boolean function and quantum algorithms Encourages readers to design and implement practical algorithms onto a quantum computer Considers core concepts in quantum algorithms with latest research

Date de parution :

Ouvrage de 118 p.

15.5x23.5 cm

Disponible chez l'éditeur (délai d'approvisionnement : 15 jours).

68,56 €

Ajouter au panier