Quantum Algorithms and Invariant Subgroups part 1 of 6

Loading...

Sign in or sign up now!
Alert icon
Upgrade to the latest Flash Player for improved playback performance. Upgrade now or more info.
237 views
Loading...
Alert icon
Sign in or sign up now!
Alert icon

Uploaded by on Mar 27, 2011

New York Algebra Colloquium March 25, 2011.

Dr. Marianna Bonanome (City Tech, CUNY)
Title: Quantum Algorithms for Fixed Points and Invariant Subgroups

Abstract of Marianna's talk: In this talk I will present quantum algorithms to solve several problems concerning fixed points and invariant subgroups of automorphisms. These efficient algorithms invoke a quantum algorithm which computes the intersection of multiple unsorted lists whose elements originate from the same set. This intersection algorithm is a modification of the Grover search procedure.

For more information regarding the colloquium, please visit: https://sites.google.com/site/nyalg2/

Category:

Science & Technology

Tags:

License:

Standard YouTube License

  • likes, 0 dislikes

Link to this comment:

Share to:
see all

All Comments (0)

Sign In or Sign Up now to post a comment!
Loading...

Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more