Complexity theory is a fundamental branch of theoretical computer science that categorises computational problems according to their inherent difficulty and the resources required to solve them. At ...

We present a general framework whereby analysis of interior-point algorithms for semidefinite programming can be extended verbatim to optimization problems over all classes of symmetric cones ...

Seeking to reduce the computing power needed for the widely used dynamic mode decomposition algorithm, a team of researchers in China led by Guo-Ping Guo developed a quantum-classical hybrid algorithm ...