Analyzing Quantum Error Detecting Codes using QUBO formalism

Quantum error-detecting codes help characterize the errors that affect quantum information. These codes are identified by their quantum Hamming Distance. Finding the hamming distance for codes is a hard problem, here we show how to map the problem to a QUBO which may then be solved on a quantum computer. We test this approach using Quantum Annealing, a heuristic to find solutions to QUBO problems which is available on near-term quantum devices. We empirically show the viability of this approach. We also explore the potential of using hybrid approaches to solve this problem.