Skip to main content

Can a Quantum Computer Run the von Neumann Architecture?

  • Chapter
  • First Online:
New Structures for Physics

Part of the book series: Lecture Notes in Physics ((LNP,volume 813))

Abstract

At the core of nearly every modern computer is a central processing unit running the von Neumann architecture. This computer architecture gives computationally universal machines, and non-trivial control structures arise naturally, leading to high-level programming constructs.

At the core of the von Neumann architecture is the notion that program code may be stored and manipulated in the same way as data. A datum describing an operation may be stored and processed in the same way as any other form of data, but may also be ‘promoted’ to an operation, and applied.

Classically, this is well-studied—particularly from a categorical point of view. We consider such operations in the quantum setting, including Nielsen and Chuang’s orthonormal encoding, Abramsky and Coecke’s categorical foundations, the BBC protocol, and the Choi-Jamiołkowsky correspondence.

Obstacles to a quantum analogue of the von Neumann architecture are also considered, including the no-cloning and no-deleting theorems, the “no-programming principle”, and the Gottesman-Knill theorem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 159.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    The team was lead by J. Mauchley and J. P. Eckert, with J. von Neumann acting as a consultant. See [10] for details of the team members.

  2. 2.

    This comment is deliberately unfair, in that languages presented in [34] have been designed for many purposes—including quantum communication protocols (of which there are many), proving correctness of both protocols and algorithms, formal proofs of security for quantum encryption and communication, &c.—and none of them have the creation of new algorithms as a stated objective. However, the point remains that going from quantum programming languages to quantum programs is a highly non-trivial exercise.

  3. 3.

    The no-deleting property is what logicians would refer to as the failure of the contraction rule (see [83] for an in-depth discussion of this), whereas the no-cloning property is a (special case of) failure of the weakening rule. These may be treated separately (i.e. we may consider logics with weakening, but not contraction, or vice versa), as in the field of substructural logics [84].

  4. 4.

    This statement is, of course, more general than formal. However, it may be formalised in a wide range of settings. In a logical setting, the observation that in his semantic models implication is not primitive but contains an implicit copying operation, famously motivated J.-Y. Girard’s Linear Logic [36, 37]. The connection between evaluation and logical rules is beyond the scope of this paper—we refer to [29, 6] for logical interpretations of the particular structures presented, in terms of linear logic operations.

  5. 5.

    The existence this swap is exactly the symmetry of the tensor product. For Hilbert spaces H and K, there is a natural isomorphism \(\sigma_{H,K} :H\otimes K\rightarrow K\otimes H\). We shall also see in Section 14.9.1 that the existence of such a symmetry is required for a categorical treatment of evaluation—at least, in the quantum-mechanical setting.

  6. 6.

    We refer to [57] for P. Freyd’s perhaps controversial suggestion that the real function of category theory is to demonstrate that the trivial parts of mathematics are trivial for trivial reasons. Another point of view is that it allows us to formalise similarities and differences between the behaviour of mathematical structures—and we have a special interest in comparing the behaviour of Sets and Hilbert spaces.

  7. 7.

    In particular, we will refer to indexed families of arrows in a category as “natural”, without giving a formal definition. We refer to [73] for natural families as components of natural transformations, and [21] for an exposition without explicit reference to natural transformations.

  8. 8.

    We emphasise that, although the category Set does not admit conames, they are by no means an exclusively quantum phenomenon—rather, they are simply a property associated with compact closure. For example, [46] uses compact closure in modelling classical Turing machines.

  9. 9.

    Even this post-selected version requires classical communication, in order to tell Bob when to give up on the experiment. The requirement for classical communication in teleportation protocols is important to prevent teleportation being used for superluminal signalling.

  10. 10.

    A natural question at this point is,‘why not give the unknown map as a coname, rather than a name? From the physical interpretation of Sect. 14.10.2, a coname is interpreted as a (successful) measurement; that is, it is derived from a classically determined measurement apparatus. It is hard to see how we may go from an arbitrary quantum state to a measurement against some basis containing that state—thus the coname can only be given as classical information.

  11. 11.

    In both cases, we ignore questions of timing and assume that the time spent processing is constant, regardless of the input. However, if the processing time is not constant, it maybe measured, and gives additional (classical) information about the operation of both quantum and classical black boxes. See [63] for applications of this in classical cryptography, and [17, 42, 72] for the key rôle that processing time plays in quantum computation.

  12. 12.

    Even in the presence of a number of identical copies of the black box, and finite input/output sets, this procedure is at best tedious. In the infinite case, it is straightforwardly impossible—thus from a physical point of view, arbitrary functions cannot be named, even in the classical world. Under what conditions computable functions may be named is left as an interesting exercise.

  13. 13.

    We strongly distinguish this from the idea of a universal quantum gate that can simulate (up to a reasonable approximation) any other quantum gate. In particular, universal computation requires the possibility of non-termination of an algorithm … and indeed the undecidability of termination is a fundamental theorem of theoretical computer science [54]. Both the usual quantum circuit model [17] and the (restricted forms of) quantum Turing machines contained in [17] require unconditional termination in exactly K steps, where K is some a priori fixed value.

  14. 14.

    The connection between C-monoids and Church’s lambda calculus is not straightforward. As observed in [66], the product structure is equivalent to requiring surjective pairing in the lambda calculus. We also refer to [66] for a demonstration—via Occam’s Razor—of how combinatory logic arises from C-monoids, without explicit reference to products, i.e. using the closed, but not monoidal closed, structure—giving what [66] refers to as “monstrous” coherence conditions. The author leaves it to those braver than himself to reason about quantum physics using the (admittedly elegant) language of such monstrosities!

  15. 15.

    Side-effects and states are often considered essential for input/output, storage, exception-handling, &c. We refer to [96] for how such features are handled in functional programming using the very categorical idea of monads.

References

  1. Abramsky, S.: Domain theory in logical form. Ann. Pure Appl. Logic 51, 177 (1991)

    MathSciNet  Google Scholar 

  2. Abramsky, S., Blute, R., Panangaden, P.: Nuclear and Trace Ideals in Tensored *-categories. J. Pure Appl. Algebra 143(1) 3–47 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  3. Abramsky, S., Haghverdi, E., Scott, P.: Geometry of interaction and linear combinatory algebras. Math. Struct. Comput. Sci. 12(5) 625–665 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  4. Abramsky, S., Coecke, B.: A categorical semantics of quantum protocols. In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS 2004), pp. 415–425. IEEE Computer Soc. Press (2004)

    Google Scholar 

  5. Abramsky, S.: Abstract scalars, loops, and free traced and strongly compact closed categories. In: Proceedings of CALCO 2005, Springer LNCS 3629, pp. 1–31 (2005)

    Google Scholar 

  6. Abramsky, S., Duncan, R.: A categorical quantum logic. Math. Struct. Comput. Sci. 16(3) (2006)

    Google Scholar 

  7. Aliferis, P.: D Leung Computation by Measurements: A unifying picture. Phys. Rev. A 70, 062314 (2004)

    Article  ADS  Google Scholar 

  8. Altenkirch, T., Grattage, J., Vizzotto, J.: An Algebra of Pure Quantum Programming ENTCS, 3rd International Workshop on Quantum Programming Languages (2005) (to appear)

    Google Scholar 

  9. Anantharaman, C.: Delaroche C*– algèbres de Cuntz- Krieger et groupes Fuchsiens in Operator Theory, Operator Algebras and Related Topics (Timisoara 1996) The Theta Foundation, Bucharest, pp. 17–35 (1997)

    Google Scholar 

  10. Aspray, W.F.: Pioneer day ‘82: history of the stored program concept. Ann. Hist. Comp. 4(4) 358–367 (1982)

    Article  Google Scholar 

  11. Backus, J.: Can Programming Be Liberated from the von Neumann Style? A functional style and its algebra of programs. Commun. ACM 21(8) 613–641 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  12. Backus, J.: Function level programs as mathematical objects functional programming languages and computer architecture archive. In: Proceedings of 1981 Conference on Functional Programming Languages and Computer Architecture, pp. 1–10. Portsmouth, New Hampshire (1981)

    Google Scholar 

  13. Barr, M., Wells, C.: Category Theory for Computer Science, 3rd edn., Centre de Recherches Mathématique, Montreal (1999)

    Google Scholar 

  14. Bennett, C.: Logical reversibility of computation. IBM J. Res. Develop. 17 525–532 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  15. Bennett, H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., Wootters, W.K.: Teleporting an unknown quantum state via dual classical and einstein-podolsky-rosen channels. Phys. Rev. Lett. 70, 1895–1899 (1993)

    Article  MathSciNet  ADS  MATH  Google Scholar 

  16. Brassard, G., Braunstein, S., Cleve, R.: Teleportation as a quantum computation. Physica D 120, 43–47 (1998)

    Article  MathSciNet  ADS  MATH  Google Scholar 

  17. Bernstein, E., Vazirani, U.: Quantum complexity theory. SIAM J. Comput. 26(5), 1411–1473 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  18. Brown, A., Page, A.: Elements of Functional Analysis. Van Nostrand Reinhold Publishing, London (1970)

    MATH  Google Scholar 

  19. Burks, A.: Who invented the computer? The legal battle that changed computing history Promethius Books (2003)

    Google Scholar 

  20. Choi, M.: Completely Positive Linear Maps on Complex Matrices, Linear Algebra and Its Applications, pp. 285–290 (1975)

    Google Scholar 

  21. Coecke, B.: Introducing Categories to the practicisng physicist (Manuscript) Available as: http://web.comlab.ox.ac.uk/oucl/work/bob.coecke/Cats.pdf (2005)

  22. Coecke, B.: Kindergarten quantum mechanics – Lecture notes. In: Quantum Theory: Reconsiderations of the Foundations III, p. 8198. AIP Press, New York (2006)

    Google Scholar 

  23. Coecke, B., Pavlovic, D.: Quantum measurements without sums. In: Chen, G., Kauffman, L., Lomonaco, S. (eds.) The Mathematics of Quantum Computation and Technology. Taylor and Francis (to appear)

    Google Scholar 

  24. Copeland, B.: The church-turing thesis. In: Zalta, E.N. (ed.) The Stanford Encyclopedia of Philosophy (Fall 2002 Edition), available as http://plato.stanford.edu/archives/fall2002/entries/church-turing/ The citation above refers to the version in the following archive edition (2002)

  25. Danos, V., Kashefi, E., Panangaden, P.: The one way to quantum computation. In: Bugliesi, M. et al.: (eds.) ICALP 2006, Part II, Springer LNCS 4052 1321 (2006)

    Google Scholar 

  26. Danos, V., Kashefi, E., Panangaden, P.: >The Measurement Calculus quant-ph: 0704.1263v1 (2007)

    Google Scholar 

  27. Darwin, C.G.: Free Motion in the wave mechanics. Proceedings of the Royal Society of London. Series A,Containing Papers of a Mathematical and Physical Character 117 (766) pp. 258–293 (1927)

    MATH  Google Scholar 

  28. Deutsch, D.: Quantum theory, the Church-Turing principle and the universal quantum computer Proceedings of the Royal Society of London, A 400, pp. 97–117 (1985)

    Google Scholar 

  29. Duncan, R.: Types for Quantum Computation, DPhil. Thesis, Oxford University (2007)

    Google Scholar 

  30. Eilenburg, S., Kelly, G.: Closed Categories Proceedings of the Conference on Categorical Algebra (La Jolla 1965), Springer 421562 (1966)

    Google Scholar 

  31. Feynman, R., Leighton, R., Sands, M.: The Feynman Lectures on Physics, vol. 3. Addison-Wesley, Reading, Mass (1965)

    Google Scholar 

  32. Finkel, R.: Advanced Programming Language Design. Addison-Wesley, Reading (1996)

    MATH  Google Scholar 

  33. Fouche, W., Heidema, J., Jones, G., Potgieter, P.: Halting in quantum Turing computation (2008)

    Google Scholar 

  34. Gay, S.: Quantum programming languages: survey and bibliography. Math. Struct. Comput. Sci. 16(4) (2006)

    Google Scholar 

  35. Geroch, R.: Mathematical Physics. University of Chicago Press, Chicago (1985)

    MATH  Google Scholar 

  36. Girard, J.-Y.: Linear logic. Theor. Comput. Sci. 50(1), 1102 (1987)

    Article  MathSciNet  Google Scholar 

  37. Girard, J.-Y., Lafont, Y., Taylor, P.: Proofs and Types, Cambridge Tracts in Theoretical Computer Science, C.U.P (1989)

    Google Scholar 

  38. Godfrey, M., Hendry, D.: The computer as von Neumann planned it. IEEE Ann. History Comput. 15(1), (1993)

    Google Scholar 

  39. Gottesman, D.: The Heisenberg representation of quantum computers. In: Corney, S.P., Delbourgo, R. Jarvis, P.D. (eds.), Group22: Proceedings of XXII International Colloquium on Group Theoretic Methods in Physics, pp. 32–43. Cambridge, MA. Extended version at arXiv:quant-ph/9807006 (1999)

    Google Scholar 

  40. Grattage, J.: QML – A Functional Quantum Programming Language, PhD Thesis, Univ. Nottingham (2006)

    Google Scholar 

  41. J. Gruska Quantum Computing. McGraw-Hill, New York (1999)

    Google Scholar 

  42. Hagar, A., Korolev, A.: What is quantum in quantum computing? A lesson from two halting problems,ESF Workshop on The Logic of Quantum Information 2004, available as http://www.webalice.it/shakush/ST1.pdf (2004)

  43. Herken, R. (ed.): The universal Turing machine: A half-century survey, 2nd ed. Springer, New York (1995)

    MATH  Google Scholar 

  44. Hines, P.: The categorical theory of self-similarity. Theory Appl. Categories 6, 33–46 (1999)

    MathSciNet  MATH  Google Scholar 

  45. Hines, P.: A short note on coherence and self-similarity. J. Pure Appl. Algebra 175(1), 135–139 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  46. Hines, P.: A categorical framework for finite state machines. Math. Struct. Comput. Sci. 13(3), 451–480 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  47. Hines, P.: Physical systems as constructive logics. In: Calude, Dinneen, Paun, Rozenburg, Stepney (eds.) Springer LNCS, vol. 4135, pp. 101–112 (2006)

    Google Scholar 

  48. Hines, P.: Compact closed monoids – Definitions and Constructions GeoCal, CIRM Marseille (2006)

    Google Scholar 

  49. Hines, P.: Machine semantics. Theor. Comput. Sci. 409, 1–23 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  50. Hines, P.: Towards a quantum machine semantics. Mathematical Foundations of Programming Semantics (2007), invited talk

    Google Scholar 

  51. Hines, P.: From causality to computational models. Int. J. Unconventional Comput. 4(3) 249–272 (2008)

    Google Scholar 

  52. Hines, P.: Quantum Circuit Oracles for Abstract Machine Computations. Available as: http://www.peterhines.net/downloads/papers/Circuits.pdf (submitted)

  53. Hughes, J.: Why functional programming matters. In Turner, D. (ed.) Research Topics in Functional Programming. Addison Wesley, New York (1990)

    Google Scholar 

  54. Immerman, N.: Computability and complexity. In: Zalta, E.N. (ed.) The Stanford Encyclopedia of Philosophy (Fall 2006 Edition), available as: http://plato.stanford.edu/archives/fall2006/entries/computability/ (2002)

  55. Jamiołkowski, A.: Linear transformations which preserve trace and positive semidefiniteness of operators. Rep. Math. Phys. 3, 275–278 (1972)

    Article  ADS  MATH  Google Scholar 

  56. Johnstone, P.: Stone Spaces, Cambridge Studies in Advanced Mathematics 3. Cambridge University Press, Cambridge (1986)

    Google Scholar 

  57. Johnstone, P.: Review of, ‘Natural dualities for the working algebraist’, by Clarke, D., Davey, B., American Mathematical Society (2000)

    Google Scholar 

  58. Joyal, A., Street, R.: The geometry of tensor calculus I. Adv. Math. 88(1), 55–112 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  59. Joyal, A., Street, R.: The geometry of tensor calculus II manuscript

    Google Scholar 

  60. Joyal, A., Street, R., Verity, D.: Traced Monoidal categories. Math. Proc. Camb. Phil. Soc. 425–446 (1996)

    Google Scholar 

  61. Jozsa, R., Linden, N.: On the rôle of entanglement in quantum speedup. Proceedings of the royal society. Math. Phys. Eng. Sci. 459(2038), 2011–2032 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  62. Kelly, M., Laplaza, M.: Coherence for compact closed categories. J. Pure Appl. Algebra 19, 193–213 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  63. Kocher, P.C.: Timing attacks on implementations of Diffie Hellman, RSA, DSS, and Other Systems. In: Koblitz, N. (ed.) Advances in Cryptology – CRYPTO 96, Springer-Verlag, LNCS, vol. 1109, pp.104–113 (1996)

    Google Scholar 

  64. Kitaev, A., Shen, A., Vyalyi, M.: Classical and Quantum Computation, Graduate Studies in Mathematics (47), American Mathematical Society, Providence (2002)

    Google Scholar 

  65. Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5, 183–191 (1961)

    Article  MathSciNet  MATH  Google Scholar 

  66. Lambek, J., Scott, P.: An Introduction to Higher-Order Categorical Logic, Cambridge Studies in Advanced Mathematics 7. Cambridge University Press, Cambridge (1986)

    Google Scholar 

  67. Laplaza, M.: Coherence in non-monoidal closed categories. Trans. Am. Math. Soc. 230, 293–311 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  68. Laplaza, M.: Embedding of closed categories into monoidal closed categories. Trans. Am. Math. Soc. 233, 85–91 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  69. Lawvere, F.W.: Functorial semantics of algebraic theories. Proc. Nat. Acad. Sci. 50(5) 869–872 (1963)

    Article  MathSciNet  ADS  MATH  Google Scholar 

  70. Lee, J.A.N.: Looking Back, IEEE Computer Magazine (Feb. 1996)

    Google Scholar 

  71. Lee, J.A.N.: John Louis von Neumann, The History of Computing Series (NSF project CDA-931261). available as http://ei.cs.vt.edu/history/VonNeumann.html (2002)

  72. Linden, N., Popsecue, L.: >The halting problem for quantum computers, arXiv:quant-ph:/9806054 v2 1998 (1998)

    Google Scholar 

  73. MacLane, S.: Categories for the Working Mathematician, 2nd edn. Springer, New York (1998)

    Google Scholar 

  74. Martin, K.: Domain theory and Measurement This volume (2008)

    Google Scholar 

  75. Miyadera, T., Ohya, M.: Designing Quantum Turing Machine is uncomputable Proc. EQIS 02 (2002)

    Google Scholar 

  76. Myers, J.: Can a universal computer be fully quantum? Phys. Rev. Lett. 78(9) 1823–1824 (1997)

    Article  MathSciNet  ADS  MATH  Google Scholar 

  77. von Neumann, J.: First Draft of a Report on the EDVAC U.S. Army report on Contract No. W-670-ORD-4926. , University of Pennsylvania. Moore School of Electrical Engineering. See also [38] (1945)

    Google Scholar 

  78. Nielsen, M., Chuang, I.: Programmable quantum gate arrays. Phys. Rev. Lett. 79, quant-ph/9703032 (1997)

    Google Scholar 

  79. Nielsen, M.: Chuang Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)

    Google Scholar 

  80. Pati, A., Braunstein, S.: Impossibility of deleting an unknown quantum state. Nature 404, 164–165 (2000)

    ADS  Google Scholar 

  81. Pati, A., Braunstein, S.: Quantum deleting and signaling. Phys. Lett. A 315, 208–212 (2003)

    Article  MathSciNet  ADS  MATH  Google Scholar 

  82. Raginsky, M.: Radon-Nikodym Derivatives of Quantum Operations arXiv:math-ph/0303056 (2003)

    Google Scholar 

  83. Renstall, G.: On logics without contraction, PhD Thesis, University of Queensland (1994)

    Google Scholar 

  84. Renstall, G.: An introduction to sub-structural logics. Routledge NY (1999)

    Google Scholar 

  85. Shi, Y.: Both Toffoli and Controlled-NOT need a little help to do universal quantum computation arXiv:quant-ph/0205115 v2 (2002)

    Google Scholar 

  86. Roeder, D.: Category theory applied to Pontryagin duality. Pacific J. Math. 52(2), 519–527 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  87. Rojas, R.: Konrad Zuse’s legacy. IEEE Ann. History Comput. 19(2), 5–16 (1997)

    Article  Google Scholar 

  88. Rojas, R.: How to make Zuse’s Z3 a universal computer. IEEE Ann. History Comput. 20(3), 51–54 (1998)

    Article  Google Scholar 

  89. Selinger, P.: Dagger compact closed categories and completely positive maps. In: Proceedings of the 3rd International Workshop on Quantum Programming Languages, ENTCS, vol. 170, pp. 139–163 (2007)

    Google Scholar 

  90. Shum, M.C.: Tortile tensor categories. J. Pure Appl. Algebra 93, 57–110 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  91. Sørensen, M., Urzyczyn, P.: Lectures on the Curry-Howard isomorphism, Studies In: Abramsky, Artemov, Gabbay, Kechris, Pillay, Shore (eds.) Logic and the Foundations of Mathematics, vol. 149. Elsevier (2006)

    Google Scholar 

  92. Stern, N.: From ENIAC to UNIVAC: An Appraisal of the Eckert-Mauchly Computers. Digital Press, Bedford, MA (1981)

    Google Scholar 

  93. Swade, D.: The difference engine: Charles Babbage and the quest to build the first computer, Penguin – Putnam (2001)

    MATH  Google Scholar 

  94. Thomsen, M., Gl¨uck, R., Axelsen, H.: Towards designing a reversible processor architecture. Proceedings of the Reversible Computation 2009, ENTCS (to appear)

    Google Scholar 

  95. Yu Vlasov, A.: Programmable quantum networks with pure states. In: Stones, J.E. (ed) Computer Science and Quantum Computing, pp. 33–61. Nova Science Publishers, Inc. (2005)

    Google Scholar 

  96. Wadler, P.: Monads for functional programming. In: Jeuring & Meijer (eds.) Advanced Functional Programming. Springer, LNCS 925 (1995)

    Google Scholar 

  97. Wootters, W., Zurek, W.: A single quantum cannot be cloned. Nature 299, 802–803 (1982)

    Article  ADS  Google Scholar 

Download references

Acknowledgments

The author wishes to thank many individuals, and is very grateful for many discussions with: S. Abramsky and B. Coecke on the categorical foundations program and category theory generally, T. Altenkirch on quantum conditionals, iteration, and programming languages, V. Danos and R. Duncan for interest in an early draft of this paper, S. Braunstein on teleportation and the Choi-Jamioł kowski correspondence from a physicists perspective, and the software problem for quantum computers, K. Martin on the behaviour of quantum algorithms from a domain theory point of view, P. Selinger on functional programming and algebras of combining forms, and P. Scott on logical and categorical interpretations, and connections with lambda calculus.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to P. Hines .

Editor information

Editors and Affiliations

Appendix

Appendix

We consider the conditions required for a state vector to correspond to a unitary map, and show that this is intimately connected with questions of entanglement.

Definition 14

Let H denote a complex Hilbert space with orthonormal (computational) basis \(\{\textbf{e}_i\}_{i=1 .. n}\). Then for each basis vector \(\textbf{e}_i\) we define the left-span of \(\textbf{e}_i\) to be the subspace of \(H\otimes H\) generated by the basis vectors \(\{ e_i\otimes e_j \}_{j=1}^n\). Dually, we define the right-span of \(\textbf{e}_j\) to be the subspace of \(H\otimes H\) generated by the basis vectors \(\{ e_i\otimes e_j\}_{i=1}^n\). We denote these spaces by \(lSpan(\textbf{e}_{\textbf{i}})\) and \(rSpan(\textbf{e}_{\textbf{j}})\) respectively.

Our claim is that the vectors that are the names of unitary maps are exactly those that are equidistant to the left span and the right span of each basis vector e i , and thus maximally entangled.

Theorem 9

Let H denote a complex Hilbert space with orthonormal basis \(\{\textbf{e}_i \} _{i=1..N}\), and let \(M:H\rightarrow H\) denote a linear map. Then the following two conditions are equivalent:

  1. (i)

    M is a unitary map.

  2. (ii)

    For each basis vector e i , the norm of the projection of \(\ulcorner M \urcorner \) onto either lSpan(e i ) or rSpan (e i ) is \(\frac{1}{n}\).

Proof

(\(\textbf{(i)} \Rightarrow \textbf{(ii)}\) By definition of a unitary map, M satisfies

$$MM^\dagger = I \ \ \mathrm{and} \ \ I = M^\dagger M$$

(It is easier to state that \(M^\dagger = M^{-1}\). However, interesting and computationally important C* algebras such as the Kuntz-Krieger algebras of [9] satisfy one-sided versions of these conditions, so we use them separately for future reference). Written in terms of matrix elements, we have that

$$\begin{aligned}( MM^\dagger )_{ik} = \sum_{j=1}^{n} m_{ij}\overline{m_{kj}} = \left\{ \begin{array}{lr} 1 & i=k \\ 0 & i\neq k \end{array} \right. \\ ( M^\dagger M )_{ik} = \sum_{j=1}^{n} m_{ji}\overline{m_{jk}} = \left\{ \begin{array}{lr} 1 & i=k \\ 0 & i\neq k \end{array} \right.\end{aligned}$$

These conditions can also be characterised as “the sum of the norms of the entries in each row is 1, as is the sum of the norms of the entries in each column”.

Moving to the name \(\ulcorner M \urcorner\in H\otimes H\), we have

$$\langle \ulcorner M \urcorner | \ulcorner M \urcorner \rangle = \frac{1}{\sqrt{n}}\frac{1}{\sqrt{n}} = \left( \sum_{\alpha , \beta = 1}^n \left( \sum_{i , j=1}^n \langle \overline{m_{\alpha \beta}} (\textbf{e}_i\otimes \textbf{e}_j) | m_{ij} (\textbf{e}_i\otimes \textbf{e}_j) \rangle \right) \right)$$

Using the Kroneker delta notation, \(\langle \textbf{e}_i\otimes \textbf{e}_j | \textbf{e}_\alpha \otimes \textbf{e}_\beta \rangle = \delta _{\alpha i} \delta _{\beta j} \), so

$$\langle \ulcorner M \urcorner | \ulcorner M \urcorner \rangle = \frac{1}{\sqrt{n}}\frac{1}{\sqrt{n}} = \left( \sum_{\alpha , \beta , i ,j = 1}^n \overline{m_{\alpha \beta}} m_{ij} \delta _{\alpha i} \delta _{\beta j} \right)$$

Hence, by the condition imposed on the matrix elements by the unitarity requirement,

$$\langle \ulcorner M \urcorner | \ulcorner M \urcorner \rangle = \frac{1}{N} \sum_{\alpha , \beta=1}^n \overline{m_{\alpha \beta}} m_{\alpha \beta} = 1$$

So the unitarity of M implies that \(\ulcorner M \urcorner \) has norm 1.

For the next step, observe that we may isolate the individual \(m_{ij}\) by

$$m_{ij} = \sqrt{n}.\langle \textbf{e}_i\otimes \textbf{e}_j | \ulcorner M \urcorner \rangle$$

and so the first unitarity condition gives that

$$1 = \sum_{j=1}^n \frac{1}{\sqrt{n}} \langle \ulcorner M \urcorner | \textbf{e}_i\otimes \textbf{e}_j \rangle \frac{1}{\sqrt{n}} \langle \textbf{e}_i \otimes \textbf{e}_j | \ulcorner M \urcorner \rangle$$

Hence

$$\frac{1}{n}= \sum_{j=1}^n \langle \ulcorner M \urcorner | \textbf{e}_i\otimes \textbf{e}_j \rangle \langle \textbf{e}_i \otimes \textbf{e}_j | \ulcorner M \urcorner \rangle$$

Using Dirac notation, for any orthnormal basis B the identity is given by \(Id=\sum_{b\in B} |\textbf{b}\rangle \langle \textbf{b}|\), and so the inner product of vectors \(\phi , \psi\) may be written as \(\langle \phi | \psi \rangle = \sum_{\textbf{b}\in B} \langle \phi |\textbf{ b} \rangle \langle \textbf{b} | \psi \rangle\). From the definition of the space \(lSpan(\textbf{e}_i)\) in terms of a basis set, we thus deduce that the projection of \(\ulcorner M \urcorner \) onto the space \(lSpan(\textbf{e}_i)\) has norm \(\frac{1}{N}\).

The dual condition about the right spans \(\{ rSpan(\textbf{e}_i) \}_{i=1}^n\) follows from the second unitarity condition.

(ii)(i) Let \(\psi = \ulcorner M \urcorner \) satisfy the left and right span conditions. We may write these fully as

$$\frac{1}{n}= \sum_{j} \langle \psi | \textbf{e}_i\otimes \textbf{e}_j \rangle \langle \textbf{e}_i \otimes \textbf{e}_j | \psi \rangle$$

and

$$\frac{1}{n}= \sum_{j} \langle \psi | \textbf{e}_i\otimes \textbf{e}_j \rangle \langle \textbf{e}_i \otimes \textbf{e}_j | \psi \rangle$$

respectively. The definition of the naming operation \(\ulcorner \ \ \urcorner\) gives that

$$[M ]_{ij} = \sqrt{n} . \langle e_i\otimes e_j | \psi \rangle$$

and almost identical reasoning to above applied to the left span condition gives \( \sum_{j=1}^n [M ]_{ij} . \overline{[M ]_{ij}} = 1\). Similarly, the right span condition gives that

$$\sum_{i=1}^n [M ]_{ij} . \overline{[M ]_{ij}} = 1.$$

From above, these are the two conditions required for unitarity, and hence our result follows.

Interpretation

Although the above is presented abstractly, a quantum computational interpretation is immediate: given a quantum register \(r\in qByte\), and an observation on a single arbitrary qubit with respect to any orthonormal basis \(\{ \textbf{b}_1,\textbf{b}_2\}\), then r is the name of a unitary map exactly when the observation of r gives either b 1 or b 2 with equal probability.

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-VerlagBerlin Heidelberg

About this chapter

Cite this chapter

Hines, P. (2010). Can a Quantum Computer Run the von Neumann Architecture?. In: Coecke, B. (eds) New Structures for Physics. Lecture Notes in Physics, vol 813. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12821-9_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12821-9_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12820-2

  • Online ISBN: 978-3-642-12821-9

  • eBook Packages: Physics and AstronomyPhysics and Astronomy (R0)

Publish with us

Policies and ethics