quantum computing

Quantum information processing provides a plethora of new problems and research topics suitable for tackling using computer algebra systems. This includes the problems of characterizing multipartite entanglement, generation and optimization of quantum computational circuits and analysis of quantum walks and quantum automata. In the reverse direction, quantum algorithms which outperform their classical counterparts may be of use in symbolic calculations (e.g. Grobner Bases).

To watch live, visit https://plus.google.com/events/ch6t6vavh1ao97t36d8q5sqtf6k at the appointed hour.

Date/time: Tue. May 20th 2014 2pm BST/UTC+1
Speaker: Daniel Gottesman (Perimeter Institute)
Title: Fault-tolerant quantum computation with constant overhead

Date: 28th January 2014
Time: 2pm UTC/GMT
Speaker: Troels Frimodt Rønnow (ETH Zurich)
Title: Quantum annealing on 503 qubits

This program will deal with quantum cryptography, quantum computing and quantum repeaters. The goal of this event is to introduce this exciting topic in a relaxed and stimulating atmosphere to a general audience of physicists and computer scientists with little or no background in practical quantum communications. Special emphasis will be placed on practical aspects of quantum communications, such as the implementation of Quantum Key distribution systems and quantum repeaters, as well as concrete steps towards a quantum computer.

This is our "Nobel Prize" lecture. Dietrich is a long time colleague of David Wineland at NIST and will tell us about the latest research from the Ion Storage Group.

To join the hangout or watch the livestream go to http://gplus.to/qplus at the appointed hour. Please note the unusual start time of 5pm BST(UTC+1)

Date: 23rd April 2013 5pm BST(UTC+1)
Speaker: Dietrich Leibfried (NIST)
Title: Towards scalable quantum information processing and quantum simulation with trapped ions