Abstract
This paper studies one of the best-known quantum algorithms — Shor’s factorisation algorithm — via categorical distributivity. A key aim of the paper is to provide a minimal set of categorical requirements for key parts of the algorithm, in order to establish the most general setting in which the required operations may be performed efficiently.
We demonstrate that Laplaza’s theory of coherence for distributivity [13,14] provides a purely categorical proof of the operational equivalence of two quantum circuits, with the notable property that one is exponentially more efficient than the other. This equivalence also exists in a wide range of categories.
When applied to the category of finite-dimensional Hilbert spaces, we recover the usual efficient implementation of the quantum oracles at the heart of both Shor’s algorithm and quantum period-finding generally; however, it is also applicable in a much wider range of settings.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Abramsky, S., Coecke, B.: A categorical semantics of quantum protocols. In: Proc. 19th Annual IEEE Symp. on Logic in Computer Science (LICS 2004), pp. 415–425. IEEE Computer Soc. Press (2005)
Abramsky, S.: Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories. In: Fiadeiro, J.L., Harman, N.A., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol. 3629, pp. 1–29. Springer, Heidelberg (2005)
Aharanov, D., Landau, Z., Makowsky, J.: The quantum FFT can be classically simulated, arXiv:quant-ph/0611156 v1 (2006)
Barr, M.: Algebraically Compact Functors. Journal of Pure and Applied Algebra 82, 211–231 (1992)
Blute, R.F., Cockett, J.R.B., Seely, R.A.G., Trimble, T.H.: Natural deduction and coherence for weakly distributive categories. Mathematical Structures in Computer Science 113, 229–296 (1991)
Carboni, A., Lack, S., Walters, R.: Introduction to Extensive and Distributive Categories. Journal of Pure and Applied Algebra 84, 145–158 (1993)
Cockett, J.R.B.: Introduction to Distributive Categories. Mathematical Structures in Computer Science 3, 277–307 (1993)
Coecke, B., Pavlovic, D.: Quantum measurements without sums. In: Chen, G., Kauffman, L., Lamonaco, S. (eds.) Mathematics of Quantum Computing and Technology. Taylor and Francis (arxiv.org/quant-ph/0608035) (2007)
Hines, P.: Quantum circuit oracles for abstract machine computations. Theoretical Computer Science 411, 1501–1520 (2010)
Høyer, P., Špalek, R.: Quantum Fan-out is Powerful. Theory of Computing 1(5), 81–103 (2005)
Joyal, A., Street, R.: The geometry of tensor calculus. Advances in Mathematics (102), 20–78 (1993)
Joyal, A., Street, R.: The geometry of tensor calculus II (manuscript)
Laplaza, M.: Coherence for categories with associativity, commutativity, and distributivity. Bulletin of the American Mathematical Society 72(2), 220–222 (1972)
Laplaza, M.: Coherence for distributivity. In: MacLane, S. (ed.) Coherence in Categories. Springer Lecture Notes in Mathematics, vol. 281, pp. 29–65 (1972)
MacLane, S.: Duality for groups. Bulletin of the American Mathematical Society 56(6), 485–516 (1950)
MacLane, S.: Categories for the working mathematician, 2nd edn. Springer, New York (1998)
Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press (2000)
Pati, A., Braunstein, S.: Impossibility of deleting an unknown quantum state. Nature 404, 164–165 (2000)
Shor, P.: Algorithms for quantum computation: discrete log and factoring. In: Proceedings of IEEE FOCS, pp. 124–134 (1994)
Wootters, W., Zurek, W.: A Single Quantum Cannot be Cloned. Nature 299, 802–803 (1982)
Yoran, N., Short, A.: Classical simulability and the significance of modular exponentiation in Shor’s algorithm, arXiv:quant-ph/0706.0872 v1 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hines, P. (2013). Quantum Speedup and Categorical Distributivity. In: Coecke, B., Ong, L., Panangaden, P. (eds) Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky. Lecture Notes in Computer Science, vol 7860. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38164-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-38164-5_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38163-8
Online ISBN: 978-3-642-38164-5
eBook Packages: Computer ScienceComputer Science (R0)