Solving Sudoku Using Quantum Computing

What is Grover’s Algorithm?

  1. Initialize 2^n qubits to the state |0>.
  2. Create an equal superposition of all possible states, |s> by applying Hadamard gates to each qubit.
  3. Pass it through the quantum oracle — i.e. a function which returns a unique value for the winning state.
  4. Pass it through the “Grover diffuser” — another functions which flips states over the average (more on this below).
  5. Keep repeating step 2 and 3.
General Architecture of the Grover Algorithm

Sudoku x Grover’s Algorithm

--

--

--

Activator at The Knowledge Society | A Sandwich or Two Founder

Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

Exploring a Different Kind of Calculus

Understanding Fractional Dimensions

The Abel Prize, 2022

The Hunt for a Number

Leonhard Euler, Basel problem, zeta function, Riemann, Apéry’s constant, zeta of 3.

Cellular automata: The Atoms of Complexity

Can you live in a Fractional Dimension? — II

Inventing Mathematics

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Avery Parkinson

Avery Parkinson

Activator at The Knowledge Society | A Sandwich or Two Founder

More from Medium

Is There a Way to Keep a Secret? Quantum Key Distribution.

RECENT TRENDS IN QUANTUM COMPUTING

A Compilation of Introductions to Quantum Gates (MQC )Part 2

A tour of Quantum Computing