Classical simulation of quantum algorithms using the tensor product representation
Quantum Physics
2007-05-23 v2
Abstract
Using the tensor product representation in the density matrix renormalization group, we show that a quantum circuit of Grover's algorithm, which has one-qubit unitary gates, generalized Toffoli gates, and projective measurements, can be efficiently simulated by a classical computer. It is possible to simulate quantum circuits with several ten qubits.
Cite
@article{arxiv.quant-ph/0411205,
title = {Classical simulation of quantum algorithms using the tensor product representation},
author = {A. Kawaguchi and K. Shimizu and Y. Tokura and N. Imoto},
journal= {arXiv preprint arXiv:quant-ph/0411205},
year = {2007}
}
Comments
4 pages, 5 figures