All Seminars & Colloquia

Adiabatic quantum computing: application to NP-hard problems

William de la Cruz, Center of Research and Advanced Studies of IPN, Mexico City

Thursday, 9/22/2011, 5:04pm - 11:59pm

Abstract: Adiabatic quantum computing (AQC) have been shown to be a useful tool for approximating optimization problems. We show an experimental study of the AQC applied to the MaxSat problem.

Homology of Distributive Lattice

Jozef Przytycki, GW

Tuesday, 9/20/2011, 3:14pm - 11:59pm

Abstract: While homology theory of associative structures, such as groups and rings, was extensively studied in the past, beginning with the work of Hopf, Eilenberg, and Hochschild, homology of non-associative distributive structures, such as quandles, has been neglected until recently. Distributive structures have been studied for a long time. In 1880, C.S. Peirce emphasized the importance of (right-) self-distributivity in algebraic structures. However, homology for these universal algebras was introduced only sixteen years ago by Fenn, Rourke, and Sanderson.

Adiabatic quantum computing: the construction of Hamiltonian operators

William de la Cruz, Center of Research and Advanced Studies of IPN, Mexico City

Tuesday, 9/13/2011, 5:07pm - 11:59pm

Abstract: Adiabatic Quantum Computing (AQC) has been applied to solve optimization problems. It is based on the construction of Hamiltonian operators which codify the optimal solution of the given optimization problem. AQC makes use of the Adiabatic Theorem to approximate solutions of the Schrödinger equation in which a slow evolution occurs. The Hamiltonian operators used in AQC should be local for convenience. Local Hamiltonian operators are expressed as sums of Hamiltonians operating over a reduced number of qubits.

A connection between odd and even Khovanov homology

Speaker: Krzysztof Putyra (Columbia University)

Monday, 7/25/2011, 8:16pm - 11:59pm