Skip to main content
SpringerLink
Log in

Quantum Algorithms for Cryptographically Significant Boolean Functions

An IBMQ Experience

  • Book
  • © 2021

Overview

Authors:
  1. Tharrmashastha SAPV

    1. Computer Science, Indraprastha Institute of Information Technology, Delhi, India

    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. Debajyoti Bera

    1. Computer Science, Indraprastha Institute of Information Technology, Delhi, India

    View author publications

    You can also search for this author in PubMed   Google Scholar

  3. Arpita Maitra

    1. TCG-CREST, Kolkata, India

    View author publications

    You can also search for this author in PubMed   Google Scholar

  4. Subhamoy Maitra

    1. Applied Statistics Unit, Indian Statistical Institute, Kolkata, India

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • 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

Part of the book series: SpringerBriefs in Computer Science (BRIEFSCOMPUTER)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (5 chapters)

  1. Front Matter

    Pages i-xiii
    Download chapter PDF

  2. Introduction

    • Tharrmashastha SAPV, Debajyoti Bera, Arpita Maitra, Subhamoy Maitra
    Pages 1-37

  3. Deutsch-Jozsa and Walsh Spectrum

    • Tharrmashastha SAPV, Debajyoti Bera, Arpita Maitra, Subhamoy Maitra
    Pages 39-58

  4. Grover’s Algorithm and Walsh Spectrum

    • Tharrmashastha SAPV, Debajyoti Bera, Arpita Maitra, Subhamoy Maitra
    Pages 59-87

  5. Simon’s Algorithm and Autocorrelation Spectrum

    • Tharrmashastha SAPV, Debajyoti Bera, Arpita Maitra, Subhamoy Maitra
    Pages 89-111

  6. Conclusion and Research Direction

    • Tharrmashastha SAPV, Debajyoti Bera, Arpita Maitra, Subhamoy Maitra
    Pages 113-116

  7. Back Matter

    Pages 117-118
    Download chapter PDF
Back to top

Keywords

About this book

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. 

Authors and Affiliations

  • Computer Science, Indraprastha Institute of Information Technology, Delhi, India

    Tharrmashastha SAPV, Debajyoti Bera

  • TCG-CREST, Kolkata, India

    Arpita Maitra

  • Applied Statistics Unit, Indian Statistical Institute, Kolkata, India

    Subhamoy Maitra

About the authors

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.

Bibliographic Information

  • Book Title: Quantum Algorithms for Cryptographically Significant Boolean Functions

  • Book Subtitle: An IBMQ Experience

  • Authors: Tharrmashastha SAPV, Debajyoti Bera, Arpita Maitra, Subhamoy Maitra

  • Series Title: SpringerBriefs in Computer Science

  • DOI: https://doi.org/10.1007/978-981-16-3061-3

  • Publisher: Springer Singapore

  • eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)

  • Copyright Information: The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2021

  • Softcover ISBN: 978-981-16-3060-6Published: 20 July 2021

  • eBook ISBN: 978-981-16-3061-3Published: 19 July 2021

  • Series ISSN: 2191-5768

  • Series E-ISSN: 2191-5776

  • Edition Number: 1

  • Number of Pages: XIII, 118

  • Number of Illustrations: 21 b/w illustrations, 1 illustrations in colour

  • Topics: Cryptology, Mobile and Network Security, Systems and Data Security, Privacy, Computer Crime

Publish with us

Policies and ethics

Back to top

Search

Navigation