RSS icon
Twitter icon
Facebook icon
Vimeo icon
YouTube icon

Comparing classical and quantum complexity

September 23, 2016 - 11:00am
Richard Jozsa
University of Cambridge

 **NOTE: Building is COMPUTER SCIENCE INSTRUCTIONAL CENTER, not Computer and Space Science**  

Issues of complexity are at the root of almost all theoretical aspects of quantum information science and correspondingly, concepts from theoretical computer science have provided a strikingly novel perspective on the foundations of quantum physics itself. For the theory of algorithms and computing, the formalism of 'classical simulation of quantum circuits' provides a mathematically precise tool for studying the rich relations between classical and quantum complexity. We will give an overview of this subject, indicating some elegant mathematical ingredients and implications for physics. Along the way we will mention some striking results for quantum Clifford circuits and matchgate circuits.​

CSI 2117

Subscribe to A Quantum Bit 

Quantum physics began with revolutionary discoveries in the early twentieth century and continues to be central in today’s physics research. Learn about quantum physics, bit by bit. From definitions to the latest research, this is your portal. Subscribe to receive regular emails from the quantum world. Previous Issues...

Sign Up Now

Sign up to receive A Quantum Bit in your email!

 Have an idea for A Quantum Bit? Submit your suggestions to