Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
The Mathematica book (4th edition)
The Mathematica book (4th edition)
Quantum computation and quantum information
Quantum computation and quantum information
Quantum Computer Science: An Introduction
Quantum Computer Science: An Introduction
Quantum computing and polynomial equations over the finite field Z2
Quantum Information & Computation
The circuit model of quantum computation and its simulation with mathematica
MMCP'11 Proceedings of the 2011 international conference on Mathematical Modeling and Computational Science
| Hi-index | 0.00 |
In this paper we briefly describe a Mathematica package for simulation of quantum circuits and illustrate some of its features by simple examples. Unlike other Mathematica -based quantum simulators, our program provides a user-friendly graphical interface for generating quantum circuits and computing the circuit unitary matrices. It can be used for designing and testing different quantum algorithms. As an example we consider a quantum circuit implementing Grover's search algorithm and show that it gives a quadratic speed-up in solving the search problem.