Fr. 78.00

Quantum Computing - An Easy Digest - DE

English · Paperback / Softback

Shipping usually within 2 to 3 weeks (title will be printed to order)

Description

Read more

Quantum Computing - An Easy Digest is a concise and accessible guide designed for readers with little to no background in quantum computing. Using engaging stories and analogies-such as Alice and a spinning coin-the book simplifies complex topics like qubits, superposition, entanglement, and the uncertainty principle. It explains how quantum bits differ from classical bits and how quantum computers can solve certain problems faster. This book explores different physical implementations of qubits, including superconductors, trapped ions, and photons. It introduces essential quantum gates, circuits, and well-known algorithms like Grover's search and Shor's factoring. Readers are also introduced to error correction techniques and the challenges of building scalable, fault-tolerant quantum systems.Practical chapters help readers write basic quantum programs using tools like IBM's Qiskit and Google's Cirq. The final chapters highlight real-world applications, career opportunities, and the ethical impact of quantum technologies. Supplementary materials support further learning, making it ideal for beginners.

About the author










Dr. Abhishek RoyProfessor, Dept. of Comp. Sc. & Engg.Adamas University, Kolkata 700126, WB, India.

Product details

Authors Aswani Kumar Nayak, Abhishek Roy, Souvik Sengupta
Publisher LAP Lambert Academic Publishing
 
Languages English
Product format Paperback / Softback
Released 01.01.2025
 
EAN 9786208453497
ISBN 9786208453497
No. of pages 96
Subject Guides

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.