Factoring larger integers with fewer Qubits via quantum annealing with optimized parameters

As part of the #PeerLearning Series, Quantum Computing India had a session on Factoring larger integers with fewer Qubits via quantum annealing with optimized parameters by Mahima,Nilay and Kedhar.

Here’s a quick log of the session:
- Alternate for Shor’s Algorithm — QUBO Model
- Illustration of multiplication
- Factorisation problem optimisation
- Maximum carry function
- Issues
- Decrease the number of variables

Get QuantumComputingIndia’s stories in your inbox

Join Medium for free to get updates from this writer.

Remember me for faster sign in

Check out the full video here today at 9pm IST!

Curious about Quantum Computing ? Join India’s fastest growing community

Quantum Computing India

Register for our next #PeerLearning Series session at:

Peer Learning Series

Join our discord channel to get updates on our latest events:

Join the Quantum Computing India Discord Server!