Lecture
Hidden Sub-group Problem and Simon Algorithm
In course
DEMO: esse do
Duis commodo eu ullamco incididunt quis et proident consectetur nulla pariatur reprehenderit. Voluptate aliquip irure deserunt aute eu nisi dolor aliquip et. Nulla labore reprehenderit sunt fugiat occaecat eiusmod tempor. Ullamco aliquip commodo do velit Lorem dolore sit duis aute pariatur cupidatat dolor velit esse. Reprehenderit est consectetur eu aliqua quis aliqua.
Description
This lecture covers the hidden sub-group problem and the Simon algorithm, focusing on the promise function, oracle, input-output relations, and quantum concepts. The instructor explains the algorithm step by step, highlighting the importance of subgroup problems in quantum computing.
Instructors (3)
minim consectetur occaecat esse
Proident sint incididunt eu cupidatat. Commodo ipsum cupidatat mollit velit irure anim ut. Eu anim labore reprehenderit ad ut fugiat. Excepteur fugiat sint esse adipisicing laboris voluptate Lorem sit non incididunt nulla. Ut laboris aliquip voluptate do tempor est voluptate sunt laboris velit ipsum ex. Qui sunt pariatur adipisicing sunt pariatur excepteur pariatur ex velit cupidatat ad do.
aliqua occaecat sit commodo
Quis Lorem id exercitation eu voluptate in. Duis cupidatat quis non anim culpa voluptate ipsum anim excepteur deserunt laboris sit eu enim. Laborum amet ad nisi aliqua nostrud ex duis proident. Nulla laborum excepteur cillum proident officia ex esse officia consectetur. Do do sit est velit elit sit fugiat ex cillum consectetur ea. Deserunt veniam commodo cupidatat aute sunt adipisicing aliqua quis qui adipisicing incididunt. Tempor est do sunt exercitation excepteur ex Lorem dolore qui Lorem excepteur consequat et sunt.
irure elit
Dolor minim quis anim cillum qui. Id dolore aute duis nisi officia velit culpa ad commodo eu cillum. Labore dolore voluptate exercitation exercitation ut anim. Dolore anim et dolor est ea nulla culpa culpa minim amet voluptate adipisicing deserunt. Do incididunt anim duis Lorem. Reprehenderit esse minim labore proident sunt laboris magna magna laboris. In tempor consectetur laborum Lorem non proident esse.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Ontological neighbourhood
Related lectures (54)
Introduction: Course syllabus
Introduces the course syllabus, grading scheme, and classical and quantum computation models.
Hidden Subgroup Algorithm
Continues the discussion on Simon's hidden subgroup problem, focusing on finding a basis.
Shor's factoring algorithm: Quantum Phase Estimation
Covers Shor's factoring algorithm and the link between order finding and factoring.
Stabilizer Formalism: Kuill-Laflamme Theorem
Covers the Kuill-Laflamme theorem and the stabilizer formalism for Quantum Error Correcting Codes.
Fundamental Groups
Explores fundamental groups, homotopy classes, and coverings in connected manifolds.