Cantitate/Preț
Produs
Total produse
Vezi coșul
Quantum Algorithms for Cryptographically Significant Boolean Functions: An IBMQ Experience de Tharrmashastha SAPV

Quantum Algorithms for Cryptographically Significant Boolean Functions: An IBMQ Experience: SpringerBriefs in Computer Science

Autor Tharrmashastha SAPV, Debajyoti Bera, Arpita Maitra, Subhamoy Maitra
en Limba Engleză Paperback – 20 iul 2021
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. 
Citește tot Restrânge

Din seria SpringerBriefs in Computer Science

  • 20% Belief Revision in Non-Classical Logics
    Preț: 12062 lei
  • Mobile Edge Caching in Heterogeneous Vehicular Networks
    Preț: 43376 lei
  • Foundations of Blockchain: Theory and Applications
    Preț: 46224 lei
  • Applications of Algebra to Communications, Control, and Signal Processing
    Preț: 29248 lei
  • 20% Feature Models: AI-Driven Design, Analysis and Applications
    Preț: 16696 lei
  • 20% Experience with Technology: Dynamics of User Experience with Mobile Media Devices
    Preț: 31635 lei
  • 20% Deep Learning in Smart eHealth Systems: Evaluation Leveraging for Parkinson’s Disease
    Preț: 28776 lei
  • 20% Art, Design and Technology: Collaboration and Implementation
    Preț: 33565 lei
  • 20% Concepts, Ontologies, and Knowledge Representation
    Preț: 39528 lei
  • 20% ITIL® 2011 At a Glance
    Preț: 31380 lei
  • 20% Lossy Image Compression: Domain Decomposition-Based Algorithms
    Preț: 31380 lei
  • 20% A Survey of Data Leakage Detection and Prevention Solutions
    Preț: 31364 lei
  • 20% Sentiment Analysis for PTSD Signals
    Preț: 31317 lei
  • 20% Glazed Panel Construction with Human-Robot Cooperation
    Preț: 31267 lei
  • Interworking of Wireless LANs and Cellular Networks
    Preț: 36477 lei
  • 20% Data Dissemination and Query in Mobile Social Networks
    Preț: 22596 lei
  • 20% Service Placement in Ad Hoc Networks
    Preț: 31494 lei
  • 20% Software Similarity and Classification
    Preț: 31380 lei
  • 20% Two-Dimensional Change Detection Methods: Remote Sensing Applications
    Preț: 31299 lei
  • 20% Traffic Measurement on the Internet
    Preț: 31330 lei
  • 20% The Design of Cloud Workflow Systems
    Preț: 31413 lei
  • 20% Demand-Driven Associative Classification
    Preț: 31494 lei
  • 20% Autonomic Cooperative Networking
    Preț: 31427 lei
  • 20% Real-Time Detection of Lines and Grids: By PClines and Other Approaches
    Preț: 31299 lei
  • 20% Querying Moving Objects Detected by Sensor Networks
    Preț: 31285 lei
  • 20% Visual Indexing and Retrieval
    Preț: 31427 lei
  • Network Robustness under Large-Scale Attacks
    Preț: 36345 lei
  • Scalable Parallel Programming Applied to H.264/AVC Decoding
    Preț: 34149 lei
  • 20% Evolutionary Game Design
    Preț: 31526 lei
  • Social Media Audit: Measure for Impact
    Preț: 33469 lei
  • Peer-to-Peer Query Processing over Multidimensional Data
    Preț: 36608 lei
  • Group Cell Architecture for Cooperative Communications
    Preț: 36646 lei
  • 20% Intermittently Connected Mobile Ad Hoc Networks: from Routing to Content Distribution
    Preț: 31494 lei
  • 20% Criminal Justice Forecasts of Risk: A Machine Learning Approach
    Preț: 34222 lei
  • 20% Interactive Co-segmentation of Objects in Image Collections
    Preț: 31219 lei
  • 20% Event-Driven Surveillance: Possibilities and Challenges
    Preț: 31299 lei
  • 20% A Primer of Multicast Routing
    Preț: 31494 lei
  • 20% Spatial AutoRegression (SAR) Model: Parameter Estimation Techniques
    Preț: 31285 lei
  • Rhodes Framework for Android™ Platform and BlackBerry® Smartphones
    Preț: 36381 lei
  • 20% Automated Configuration Problem Solving
    Preț: 31108 lei
  • 20% Power Distribution and Performance Analysis for Wireless Communication Networks
    Preț: 31413 lei
  • 20% Mobile Authentication: Problems and Solutions
    Preț: 31494 lei
  • 20% Repairing and Querying Databases under Aggregate Constraints
    Preț: 22515 lei
  • 20% Spatio-temporal Networks: Modeling and Algorithms
    Preț: 29495 lei
  • 20% Entropy Guided Transformation Learning: Algorithms and Applications
    Preț: 31330 lei
  • 20% Video Processing in the Cloud
    Preț: 31236 lei
  • 20% Guide to ILDJIT
    Preț: 31413 lei
  • 20% Context Management for Distributed and Dynamic Context-Aware Computing
    Preț: 31380 lei
  • 20% Bootstrapping Trust in Modern Computers
    Preț: 31458 lei
  • 20% Decentralized Reasoning in Ambient Intelligence
    Preț: 31458 lei

Preț: 46489 lei

Nou

Puncte Express: 697
Preț estimativ în valută:
8897€ • 9330$ • 7418£

Carte tipărită la comandă

Livrare economică 08-22 ianuarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9789811630606
ISBN-10: 9811630607
Pagini: 118
Ilustrații: XIII, 118 p. 22 illus., 1 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.2 kg
Ediția:1st ed. 2021
Editura: Springer Nature Singapore
Colecția Springer
Seria SpringerBriefs in Computer Science

Locul publicării:Singapore, Singapore

Cuprins

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.

Notă biografică

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.

Textul de pe ultima copertă

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. 

Caracteristici

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