This course studies approximation algorithms – algorithms that are used for solving hard optimization problems. Such algorithms find approximate (slightly suboptimal) solutions to optimization ...

A large team of researchers working with Google Inc. and affiliated with a host of institutions in the U.S., one in Germany and one in the Netherlands has implemented a quantum approximate ...

Variational quantum algorithms (VQAs) are constrained by a trade-off: deeper circuits can cover a larger reachable quantum states but suffer from barren plateaus, while shallow circuits remain ...

Researchers demonstrated a quantum algorithmic speedup with the quantum approximate optimization algorithm, laying the groundwork for advancements in telecommunications, financial modeling, materials ...

This research details how a bosonic quantum system’s evolution defies the standard mean-field Hartree approximation, a key ...

Researchers at MIT's Computer Science & Artificial Intelligence Lab (CSAIL) have open-sourced Multiply-ADDitioN-lESS (MADDNESS), an algorithm that speeds up machine learning using approximate matrix ...

*Note: This course description is only applicable for the Computer Science Post-Baccalaureate program. Additionally, students must always refer to course syllabus for the most up to date information.