Emami, B.; Dyk, W.; Haycraft, D.; Robinson, J.; Nguyen, L.; Miri, M.-A.; Huggins, D. J.

Computational protein design is a foundational challenge in biotechnology, advantageous for engineering novel enzymes and therapeutics, yet its combinatorial complexity remains a bottleneck for classical optimization. We formulate fixed-backbone computational protein design as a quadratic Hamiltonian over rotamer variables to naturally map onto a hybrid photonic entropy computing platform, Dirac-3. To assess solution quality and runtime performance, we benchmark the photonic solver against an exact classical cost function network (CFN) solver, which provides provably optimal baselines. For protein instances ranging from 493 to 943 variables, Dirac-3 attains solutions within 0.16-2.47% of optimal energies. Empirical scaling analysis reveals a comparatively gentle effective runtime growth for the photonic solver over the measured regime, consistent with near-linear polynomial scaling, in contrast to the sharp super-polynomial growth observed for the classical baseline beyond approximately 1000 variables. These results suggest a near-term crossover regime in which hardware-aligned continuous-variable optimization may offer a practical promise for large computational protein design instances where exact classical methods become time-prohibitive.