Repository | Book | Chapter
(2009) Quantum interaction, Dordrecht, Springer.
Quantum computing is an extremely promising research combining theoretical and experimental quantum physics, mathematics, quantum information theory and computer science. Classical simulation of quantum computations will cover part of the gap between the theoretical mathematical formulation of quantum mechanics and the realization of quantum computers. One of the most important problems in "quantum computer science" is the development of new symbolic languages for quantum computing and the adaptation of existing symbolic languages for classical computing to quantum algorithms. The present paper is devoted to the adaptation of the Mathematica symbolic language to known quantum algorithms and corresponding simulation on the classical computer. Concretely we shall represent in the Mathematica symbolic language Simon's algorithm, the Deutsch-Josza algorithm, Grover's algorithm, Shor's algorithm and quantum error-correcting codes. We shall see that the same framework can be used for all these algorithms. This framework will contain the characteristic property of the symbolic language representation of quantum computing and it will be a straightforward matter to include this framework in future algorithms.
Publication details
DOI: 10.1007/978-3-642-00834-4_14
Full citation:
Nyman, P. (2009)., A symbolic classical computer language for simulation of quantum algorithms, in P. Bruza, D. A. Sofge & W. F. Lawless (eds.), Quantum interaction, Dordrecht, Springer, pp. 158-173.
This document is unfortunately not available for download at the moment.