World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×
World Scientific Series on Quantum Algorithms, Information, and Learning cover
Editor-in-Chief


Prof. Wojciech Szpankowski


The past few decades have witnessed significant advances in quantum technologies with a few hundred qubit capacities. Quantum computers are at the cusp of surpassing contemporary and even future supercomputers in achieving scientific breakthroughs. Furthermore, recent achievements in quantum algorithms and information processing to collect, store, and process qubits endow us with a more powerful ability, learning from quantum information.

In this context, the World Scientific Series on "Quantum Algorithms, Information, and Learning" offers the readers insights into these new exciting areas. We seek books on foundation and experimental aspects of quantum algorithms, quantum information and communication,and quantum machine learning and AI. Weirdness of quantum world such as uncertainty andnon cloning postulates make these topics more challenging and intriguing. New technological developments in quantum cryptography, quantum computation and quantum communication attracts not only physicists but also researches from other scientific fields such as computer science, mathematics, machine learning, and information theory. We hope this book will serve all of these communities.

The books in the series will include monographs, edited volumes graduate level text and major works aimed at researchers and students in quantum sciences.

To contribute to the series, please contact the series Editor-in-Chief, Prof. Wojciech Szpankowski , at: spa@spa.cs.purdue.edu or szpan@purdue.edu or Dr. Zvi Ruder , at: zruder@wspc.com.

Under Contract

Quantum Information Theory: Foundations and Coding Theorems
Arun Padakandla (University of Tennessee, USA)

Twenty Five Lectures on Quantum Computation, Information and Probability
S Sandeep Pradhan (University of Michigan, USA)