Is it possible to distribute a quantum computer across many sites and still be able to run powerful quantum algorithms with a minimal overhead? Work with coworkers from Bristol, Princeton and MIT has demonstrated that the answer is in fact yes...

My coworkers and I have discovered new algorithms to run on a quantum computer (once one is built!). The first is called the MultiGrover algorithm and allows you to perform parallel Grover searches ...

The separation problem is a fundamental convex optimization problem. We have developed a powerful new technique to solve the separation problem and show how it can be used to search for Bell inequalities...

The violation of a Bell inequality demonstrates that the outcomes of an experiment have contradicted a set of well defined classical intuitions. Quantum mechanics allows correlations between space-like separated parties that have no classical explanation...

This webpage was built with Bootstrap and Jekyll. Last updated: Mar 30, 2017