Classical simulation of quantum algorithms using the tensor product representation

Simple item page
dc.creatorKawaguchi, A.
dc.creatorShimizu, K.
dc.creatorTokura, Y.
dc.creatorImoto, N.
dc.date2004-11-30
dc.date2005-05-23
dc.date.accessioned2026-07-07T06:11:39Z
dc.date.available2026-07-07T06:11:39Z
dc.descriptionUsing 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.
dc.description4 pages, 5 figures
dc.identifierhttps://arxiv.org/abs/quant-ph/0411205
dc.identifierhttp://arxiv.org/abs/quant-ph/0411205
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/92545
dc.subjectQuantum Physics
dc.titleClassical simulation of quantum algorithms using the tensor product representation
dc.typetext

Files

Collections

arXiv