More information: Xiaomeng Sui et al, Non-convex optimization for inverse problem solving in computer-generated holography, Light: Science & Applications (2024). DOI: 10.1038/s41377-024-01446-w ...

Characterizing the difficulty of the optimization problem instances with a "hardness ... is a paradigmatic hard task in computer science and has broad applications in logistics, network design ...

Quantum computing is not just another technological advancement—it’s a complete shift in the way we think about solving ...

A quantum computer can solve optimization problems faster than classical supercomputers ... an area with broad applicability in industry and science. Quantum annealing is a specific type of ...

It's hard to overstate the stakes surrounding the most important unsolved problem in computer science. P versus NP concerns the apparent asymmetry between finding solutions to problems and ...

In the gate-based mode of a neutral atom quantum computer, the spin of the nucleus ... The nice thing about running optimization problems on this hardware is that errors aren't as problematic ...

However, many optimization problems are difficult ... Perhaps the most exalted question in computer science is whether all problems have efficient algorithms. More popularly known as the P = NP ...

This is a well-studied area of computer science, full of techniques that Jordan could explore. By translating an optimization problem into a quantum one, and then applying the decoding lens to it ...