Physics – Quantum Physics
Scientific paper
2010-06-05
Physics
Quantum Physics
28 pages, 42 figures; Clifford Lectures 2008 (main speaker Samson Abramsky)
Scientific paper
Quantum algorithms are sequences of abstract operations, performed on non-existent computers. They are in obvious need of categorical semantics. We present some steps in this direction, following earlier contributions of Abramsky, Coecke and Selinger. In particular, we analyze function abstraction in quantum computation, which turns out to characterize its classical interfaces. Some quantum algorithms provide feasible solutions of important hard problems, such as factoring and discrete log (which are the building blocks of modern cryptography). It is of a great practical interest to precisely characterize the computational resources needed to execute such quantum algorithms. There are many ideas how to build a quantum computer. Can we prove some necessary conditions? Categorical semantics help with such questions. We show how to implement an important family of quantum algorithms using just abelian groups and relations.
No associations
LandOfFree
Geometry of abstraction in quantum computation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Geometry of abstraction in quantum computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Geometry of abstraction in quantum computation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-637899