Hybrid quantum-classical algorithm matches best code solvers
Researchers reformulated the minimum distance problem for quantum error-correcting codes as a Quadratic Unconstrained Binary Optimization task and solved it with a hybrid quantum annealing workflow. In reported tests, the hybrid approach matched the best known classical results for the problem.
This QUBO formulation could make it practical to screen larger quantum error-correcting code parameter spaces for greater minimum distances within the next two years.