Quantum Annealing

As part of the #PeerLearning Series, Quantum Computing India had a session on Quantum Annealing by Nilay Awasthi and Kedhar Guhan Balakumar.

Here’s a quick log of the session:
- Optimisation
- Using physics to do our computation
- How?
— Setting up biases
— Entanglement
— Complexity
- Paradigm of quantum computation
— Math behind it
— Hamiltonian formula
— Eigenspectrum
— Classical flipping to Quantum tunnelling
— Cost function
— Formulation
— Convergence theorem
— Computational complexity
— Combinatorial Optimization Problem

Get QuantumComputingIndia’s stories in your inbox

Join Medium for free to get updates from this writer.

Remember me for faster sign in

Catch the YouTube premiere of the video at 9 pm IST today at :

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

Quantum Computing India

Register for our next #PeerLearning Series session at:

Peer Learning Series