Quantum Algorithms for Cryptographically Significant Boolean Functions: An IBMQ Experience (SpringerBriefs in Computer Science) - Softcover

SAPV, Tharrmashastha; Bera, Debajyoti; Maitra, Arpita; Maitra, Subhamoy

Softcover

ISBN 10: 9811630607 ISBN 13: 9789811630606

Publisher: Springer, 2021

Synopsis

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. 

About this title

About the Author

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 Facultyin 1997. Having around 6000 citations to his name, Professor Maitra has authored several books and around 200 research papers in the area of cryptology and quantum information.

From the Back Cover

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. 

Edition details

• Publisher: Springer
• Publication date: 2021
• Language: English
• ISBN 10: 9811630607
• ISBN 13: 9789811630606
• Binding: Paperback
• Edition number: 1
• Number of pages: 131