News

Filter by:

Limit to news where the title matches:
Limit to items where the date of the news item:
Date range
Limit to items where the date of the news item:
Limit to news items tagged with one or more of:
Limit to news items where the audience is one or more of:
Wednesday, January 16, 2019

Sparse structures in graphs and matroids

Professors Peter Nelson (PI) and Luke Postle (co-PI) have been awarded an International Research Partnership Grant (IPRG) for their project Sparse structures in graphs and matroids. Professors Nelson and Postle, and their graduate students, will collaborate with University of Bordeaux professors Marthe Bonamy and Frantisek Kardos.

Friday, October 26, 2018

Fall 2018 convocation

Five C&O graduate students received their degrees at the Fall 2018 convocation ceremony.

Written by Institute for Quantum Computing staff

Quantum computers can solve a linear algebra problem faster than classical computers, according to a new study published in Science. The finding proves that constant-depth quantum circuits are more powerful than their classical counterparts, and provides a new sense of how quantum technology will be a key to more powerful computing.