Seminar | September 14 | 1-2 p.m. | Cory Hall, 521 Hogan Room
Eli Yablonovitch, Electrical Engineering and Computer Sciences Dept., University of California, Berkeley
Recently, at least six well-funded quantum computing startups have emerged, in addition to some large internal efforts in major companies on quantum information processing . It appears that the initial emphasis is not on the Shor Algorithm, which would require billions of qubits, but rather on optimization algorithms that aim to solve the Ising problem, that could possibly be done with as few as one hundred qubits. The Ising problem in magnetism is a surrogate for major np-hard problems like financial portfolio optimization, the traveling salesman problem, protein folding, etc.
The question arises whether there are classical machines that could solve the same problem, without the need for the complexity of quantum bits. There is reason for optimism, since the Ising problem itself can be set up classically. This talk will explore the kind of circuits and components that can solve optimization problems.
CA, firstname.lastname@example.org, 5106423214