# Research > Quantum Information & Computation

## Overview

The laws of quantum mechanics govern the behavior of infinitesimal particles such as individual photons or electrons. As computers and their microprocessors become smaller and smaller it becomes increasingly necessary to take into account quantum phenomena in order to accurately predict their behavior. Rather than a hindrance, the field of quantum computing sees this as an opportunity to develop a radically novel model of computation which uses quantum phenomena in order to develop:

- Algorithms that run faster than any algorithm known for classical computers,
- Cryptosystems that are more secure than any classical cryptosystem could ever be,
- Coding procedures that go beyond information-theoretic limitations on classical codes, and much more!

The quantum computing group at CMS benefits from a close collaboration with Caltech’s Institute for Quantum Information and Matter, partly co-located within the same building. As a result our research takes a strong interdisciplinary bent. Our approach consists in identifying challenges in quantum information and the study of quantum systems for which the use of computer science techniques, from algorithms, complexity, cryptography or information theory, can lead to major advances.

A sample recent focus of interest of our group has been the study of the computational consequences of “quantum weirdness”: we approach the nonlocal properties of entanglement from the complexity-theoretic (multiprover interactive proofs) and cryptographic (device-independent quantum key distribution) vantages. Inspired by our collaborators from physics we develop classical and quantum algorithms for the simulation of quantum mechanical systems, contributing to the understanding of new phases of matter. We are also excited by the prospects of topological architectures for quantum memories and quantum error-correcting codes. Our point of view is that quantum computing is not the future: it is the present! Quantum mechanical systems are everywhere, with a strangeness and power that is only awaiting a computational mindset to be properly understood and harnessed.

## Faculty

Fernando Brandão, Alexei Kitaev, John Preskill, Gil Refael, Leonard Schulman, Thomas Vidick

**Related research groups & Centers >**
IQIM,
Theory group,
CMI

## Recent Research Talks

Paul Rudd vs Stephen Hawking in a game of Quantum Chess 1/26/16

Quantum Computing and the Entanglement Frontier - John Preskill 9/27/13

## Related Courses

Physics 12b. Quantum Physics.

ACM/CMS 104. Linear Algebra and Applied Operator Theory.

ACM/CMS 113. Introduction to Optimization.

Ma/CS 117 abc. Computability Theory.

Physics 125ab. Quantum Mechanics.

EE/Ma/CS 126 ab. Information Theory.

EE/Ma/CS 127. Error-Correcting Codes.

CS/EE/Ma 129 abc. Information and Complexity.

Physics 135b. Applications of Quantum Mechanics: Quantum Computing.

CS 138 abc. Computer Algorithms.

CS/CMS 139. Analysis and Design of Algorithms.

CS 150. Probability and Algorithms.

CS 151. Complexity Theory.

BE/CS/CNS/Bi 191 ab. Biomolecular Computation.

CNS/Bi/Ph/CS 187. Neural Computation.

Physics 195. Advanced Quantum Mechanics.

Ph/CS 219 abc. Quantum Computation.

SS/CS 241. Advanced Algorithmic Economics.

CS 286-2. Topics in quantum information.