Now you are in the subtree of TECHNOLOGY and MARKETS public knowledge tree. 

QComp Research

A promising approach to solving hard binary optimization problems is quantum adiabatic
annealing in a transverse magnetic field.

Technical insights have more general speculations about state preparation problem, applicability of quantum computing, etc.

  • Zapata Computing Variational Quantum Factoring > ... it seeks an approximate ground state of the resulting Ising Hamiltonian by training variational circuits using the quantum approximate optimization algorithm

general reviews

A Near-Term Quantum Computing Approach for Hard Computational Problems in Space Exploration

technical articles

Experimental investigation of performance differences between coherent Ising machines and a quantum annealer