On the Power of Quantum Computation
SIAM Journal on Computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Quantum computing
Quantum computation and quantum information
Quantum computation and quantum information
Modeling quantum computing in Haskell
Haskell '03 Proceedings of the 2003 ACM SIGPLAN workshop on Haskell
Towards a quantum programming language
Mathematical Structures in Computer Science
A Functional Quantum Programming Language
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
A lambda calculus for quantum computation with classical control
Mathematical Structures in Computer Science
Structuring quantum effects: superoperators as arrows
Mathematical Structures in Computer Science
Quantum programming languages: survey and bibliography
Mathematical Structures in Computer Science
An Introduction to Quantum Computing
An Introduction to Quantum Computing
A Survey of Quantum Programming Languages: History, Methods, and Tools
ICQNM '08 Proceedings of the Second International Conference on Quantum, Nano and Micro Technologies (ICQNM 2008)
Mathematics of Quantum Computation and Quantum Technology
Mathematics of Quantum Computation and Quantum Technology
On the power of quantum computation
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Quantum walks: a comprehensive review
Quantum Information Processing
Hi-index | 0.02 |
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.