10:00 - 11:00
Quantum hybrid subroutines and video games
I will present two separate projects currently being worked on. First, how to construct a discrete time quantum walk Hamiltonian where it is possible to encode an optimisation problem called Maximum 2-Satisfiability (MAX 2-SAT) in the couplings between dipoles of ferromagnetic interactions described by the Ising model. Based on energy transfer between the problem and the quantum walk Hamiltonian, we make an argument for the solution will on average outperform a best guess. We tested sets of 100 randomly generated MAX 2-SAT problems for patterns on how to optimise the computation and found that if we introduce a hybrid subroutine for taking as input a guess for the solution, it is possible to increase the success probability of getting the optimal solution. This is achievable for all cases when the guess is below half hamming distances away from the optimal solution. My 2nd presentation will be about a video game as a form of public outreach, that aims to make learning quantum computing easy, by reducing the gate model operators and state vectors to a set of visual puzzle pieces. This project will also aim for citizen science, by allowing academics to build puzzles for users to solve.