5/7: MIT Quantum Information Processing seminar series (4pm in 26-214)
Title: Quantum Algorithms Using Clebsch-Gordan Transforms
Abstract: In nearly every quantum algorithm which exponentially outperfroms the best classical algorithm the quantum Fourier transform plays a central role. Recently, however, cracks in the quantum Fourier transform paradigm have begun to emerge. In this talk I will discuss one such development which arises in a new efficient quantum algorithm for the Heisenberg hidden subgroup problem. In particular I will show how considerations of symmetry for this hidden subgroup problem lead naturally to a different transform than the quantum Fourier transform, the Clebsch-Gordan transform over the Heisenberg group. Clebsch-Gordan transforms over finite groups thus appear to be an important new tool for those attempting to find new quantum algorithms. [Part of this work was done in collaboration with Andrew Childs (Caltech) and Wim van Dam (UCSB)]
5/10: University of Oregon Physics Seminar (4pm in 100 Willamette)
Title: When Physicists Build Quantum Algorithms
Abstract: Our universe is a quantum universe, obeying the laws of quantum theory to high precision. Thus it makes perfect sense to base the most fundamental model of a computer (which is, of course, nothing more than a physical device obeying the laws of physics) upon gadgets which respect the laws of quantum theory. Such “quantum computers” have attracted widespread attention over the last decade, in large part due to the ability of these computers to break modern cryptosystems and to outperform classical computers at certain algorithmic tasks. An important grand challenge for quantum computing these days is to find new quantum algorithms which outperform their classical counterparts. As a physicist, however, you may wonder, “what role can I play in coming up with new quantum algorithms, I’m just a pragmatic physicist?” In this talk I will give examples of new quantum algorithms inspired and devised by physicists, using tools and techniques which are near and dear to most physicists. These new quantum algorithms suggest that there is much that physics can contribute to the theory of quantum computing algorithms.
5/16: Perimeter Institute Quantum Discussions (4pm in room 405):
Title: Quantum Algorithms Using Clebsch-Gordan Transforms
Abstract: In nearly every quantum algorithm which exponentially outperfroms the best classical algorithm the quantum Fourier transform plays a central role. Recently, however, cracks in the quantum Fourier transform paradigm have begun to emerge. In this talk I will discuss one such development which arises in a new efficient quantum algorithm for the Heisenberg hidden subgroup problem. In particular I will show how considerations of symmetry for this hidden subgroup problem lead naturally to a different transform than the quantum Fourier transform, the Clebsch-Gordan transform over the Heisenberg group. Clebsch-Gordan transforms over finite groups thus appear to be an important new tool for those attempting to find new quantum algorithms. [Part of this work was done in collaboration with Andrew Childs (Caltech) and Wim van Dam (UCSB)]
And I’m not even interview for jobs 😉 And look, I’ve got the same title and abstract for my MIT and Perimeter talks. Been a long time since I gave the same talk twice. From past experience the jokes are bad in both talks 🙂