Sponsored by
Shor's algorithm revolutionized our understanding of computational power, proving that quantum computers could solve problems far beyond the reach of classical systems. Now, in a space where innovation meets legacy—the halls of MIT, where Professor Shor himself still walks—we invite you to push the boundaries of quantum computing.
Welcome to the Quantum Factorization Challenge, where your mission is to factor increasingly larger semiprime integers using pure quantum algorithms. With access to the Quantum Rings Simulator, capable of simulating circuits with hundreds of qubits and millions of gate operations, all running on the qBraid platform, or on your local developer environment-- this is your chance to demonstrate mastery, ingenuity, and the future of quantum computation.
At the heart of this challenge lies one of the most critical problems in modern cryptography: the difficulty of factoring large integers. Semiprime numbers, the product of two prime numbers, form the foundation of encryption methods like RSA. The security of these systems relies on the near impossibility of factoring large semiprimes using classical computers.
Quantum algorithms like Shor’s show that this problem can be solved efficiently in a quantum world, posing both opportunities and challenges for the future of cryptography. By participating in this challenge, you’re not just solving a problem—you’re contributing to advancements that could reshape cybersecurity, data privacy, and computational theory.
-
Factor Large Semiprime Integers
Use quantum algorithms to tackle a prepared list of semiprime integers, from an approachable 8-bit number and growing to numbers beyond sizes that are yet known to have been factored using quantum algorithms. -
Leverage the Quantum Rings Simulator
Use any quantum framework, but run all simulations on the Quantum Rings Simulator.In the event that you need more compute on qBraid, or more qubits from Quantum Rings, reach out on the Quantum Rings Discord Channel, with evidence that your approach has worked with smaller samples, and we can unlock more resources for you.
-
Focus on Real Quantum Solutions
Classical optimizations are off the table—this challenge is about harnessing the full power of quantum algorithms. -
Demonstrate Universality
Your solution should be capable of factoring multiple numbers of at least the same bit size—not just the one specific integer on the list. -
Document Your Approach
Clearly explain your algorithm, its scalability, and provide insights into any learnings or novel approaches applied.
All submissions must meet the above requirements, and will be ranked by the bit size of the largest number factored.
The largest bit size wins.
In the event that there is a tie, the team with the fastest execution will win.
Before selecting a winner, the source code, execution evidence, and documentation will be reviewed to ensure that the above requirements have been met.
The semiprime integers provided are in a list located in the repository in semiprimes.py.
As you go, you will want to start small, and scale up. Keep in mind that simulation time may be a bottle neck, so getting a working implementation quickly for smaller numbers is key, so you can estimate the time it will take to run your algorithm on larger numbers.
In addition to the pride of winning the MIT iQuHack, members of the winning team will receive:
🏆 A copy of Fundamentals of Quantum Computing: Theory and Practice by Quantum Rings' Co-founder and CTO, Venkat Kasirajan. (up to 5 team members)
- If the winning team is based in the U.S., each member will receive a signed copy with a personal note from Venkat.
- If the winning team is outside the U.S., each member will receive a copy of the textbook shipped directly from the publisher.
Additionally, all participants will receive:
- Access to the Quantum Rings Simulator with 200 qubits for one year after the hackathon (non-commercial use).
- Support from the Quantum Rings community and staff to assist with simulator-related questions during the event.
- Hands-on experience with cutting-edge quantum computing challenges.
- Register for free at www.QuantumRings.com
- Confirm your email
- Select "Manage Keys" and enter Promocode "IQUHACK25" to unlock 200 qubits of simulation --> This will be available to you for an entire year following the hackathon
- Copy the key, and use it to start simulating massive circuits locally!
If you need more capacity -- just ask! We'll be happy to unlock even more qubits of simulation during the hackathon. Just ask on the #quantum-rings channel on discord.
Submit the following:
- Code: Provide your quantum implementation using Quantum Rings' simulator via GitHub.
- Results: Include the integers factored, their prime factors, the number of qubits used, the number of gate operations, and the execution times.
- Quantum Rings Email: Include the email used to register at Quantum Rings-- this will be used to validate the circuit execution.
- Documentation: Explain your algorithm, scalability, and insights into any learnings or novelty in your approach.
When you are ready to submit, you can submit your circuit using this Google Form
Good luck-- let's see what you can achieve!
