Welcome to the Quantum Realm. 

Sundays are for sipping coffee, light reads, laid-back listens, and community endeavors.

🔬Science is the act of asking illuminating questions to extract illuminating answers. And a healthy dose of trial and error along the way, of course. Check out those actively pushing forward quantum computing. Plus, your Raspberry Pi is due for an upgrade — how about a little quantum addition?

🗓️ THIS WEEK

Sunday, July 21 | QTM-X Quantum Education Series 6 of 10: Quantum Hardware

📰 WEEKEND BYTES

Fun news & community contributions.

💡 Life is full of mystery, but one thing remains certain — discovery questions benefit from multi-dimensional analysis, and quantum computing is no exception: Amara Graps, previously having digested 500 hybrid classical-quantum research papers to better understand trends (check it out here), returns with a new question — are certain quantum computing use cases better served by specific modalities? There are layers to scientific discovery. When quantum computing was in even earlier stages, we were largely focused (and many remain so) on determining the superior quantum computing modality. Over time, the conversation has evolved and more are curious as to whether there are certain modalities better suited for certain use cases. One insight presented by Amara is the importance of ansätzes in bridging quantum algorithms to hardware and highlighting their potential to solve specific problems effectively. Another insight is not found in answers but rather in further questions that are successful in directing where the conversation needs to move next: perhaps it is not a question of modality per use case, but more granular by determining the best algorithm variant per use case and determining the best hardware per selected algorithm variant. While these are largely unanswered, I can say with certainty that I am looking forward to seeing what Amara discovers next! Check out the article at the above link and follow Quantum Progress Today on X for more updates.

🎲 The quantum foreshadowing of physicists and probability: This month in the history of physics, July of 1654, Blaise Pascal and Pierre de Fermat's letters on the "Problem of Points" laid the groundwork for modern probability theory. Pascal, a child prodigy, invented a mechanical calculator and contributed to various scientific fields before focusing on probability. Their correspondence tackled how to fairly divide winnings in interrupted games, a problem first posed by Luca Paccioli. This exchange revolutionized how scientists and mathematicians approached uncertainty and risk. Probability theory and quantum mechanics are deeply intertwined, as quantum mechanics fundamentally relies on probabilistic principles to describe the behavior of particles at the quantum level.

🌟 The QInnovision World Challenge 2025 will be at the Quantum Innovation Summit next year: This event invites the global community to solve real-world problems in healthcare, finance, and cybersecurity using cutting-edge quantum tech. The challenge includes phases for ideation, technical development, and market integration, culminating in a grand finale at the Quantum Innovation Summit in Dubai. Participants will gain extensive networking opportunities, international exposure, and the chance to collaborate with industry leaders and investors. If you have an idea that could transform the potential of quantum innovation into tangible societal impacts, be sure to sign up at the link.

🏆️ Prestigious award announced for the namesake of quantum algorithm: The Claude E. Shannon Award honors individuals for consistent and profound contributions to information theory, with recipients delivering a lecture at the subsequent IEEE International Symposium on Information Theory, a tradition started by Claude Shannon himself. For 2025, Peter Shor has been selected as the recipient for his crucial contributions to information theory.

🍓 Your next computer upgrade arrived and it’s not the 4090: If you’ve been dying for a desktop quantum computer, chances are the market will not be filling that demand anytime soon. But, a Rasberry Pi with a quantum twist? That’s not too much to ask for. This RasQberry project combines a 3D-printed IBM Q System One model, a Raspberry Pi, and Qiskit to offer a playful yet educational exploration of quantum computing. While it’s not anywhere near the real thing, it's a unique take on a handheld educational platform that can demonstrate and teach quantum computing concepts through interactive experiences, perfect for demos, meetups, and low-key tinkering.

🎮️ And if a 3D-printed IBM Q System One didn’t quite satisfy that hands-on quantum fun: "Fun with Quantum" is a collection of Jupyter notebooks designed to make learning quantum computing fun and engaging. From the Quantum Coin Game that demonstrates superposition and interference, to Hardy's Paradox and the GHZ Game on real devices, these notebooks offer hands-on experiences. Whether you're tackling Boolean satisfiability problems or exploring the Mermin-Peres Magic Square, there's something for everyone.

🚀 TDQ Exchange

Is there someone within the community you’d like to see highlighted?

🔊 VOLUME ON

🦸‍♀️ ON THE SHOULDERS OF GIANTS

Peter Shor is a renowned mathematician and computer scientist, best known for his significant contributions to quantum computing. He is a professor of applied mathematics at the Massachusetts Institute of Technology. Shor's most famous contribution is the development of Shor's algorithm, a quantum algorithm for integer factorization that significantly outperforms the best-known classical algorithms. This discovery has profound implications for cryptography and has propelled quantum computing into the spotlight. Shor's work has earned him numerous accolades, including the Gödel Prize and the Dirac Medal, establishing him as a pivotal figure in the field of quantum information science.

RECOMMENDED PUBLICATIONS:

Algorithms for Quantum Computation: Discrete Logarithms and Factoring

This seminal paper introduces Shor's algorithm, demonstrating that quantum computers can efficiently solve problems like integer factorization and discrete logarithms, which classical computers cannot.

Fault-Tolerant Quantum Computation

Shor addresses the issue of error correction in quantum computers, proposing methods to perform quantum computations reliably even in the presence of errors.

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

A further elaboration on Shor's algorithm provides a more detailed mathematical framework and proves its polynomial-time efficiency for factoring large integers and computing discrete logarithms using quantum computing.

CARRY ON PUSHING THE BOUNDARIES OF POSSIBILITY.