Efficient classical simulation of the semi-classical Quantum Fourier Transform

Simple item page
dc.creatorBrowne, Daniel E.
dc.date2006-12-03
dc.date.accessioned2026-07-07T08:09:40Z
dc.date.available2026-07-07T08:09:40Z
dc.descriptionA number of elegant approaches have been developed for the identification of quantum circuits which can be efficiently simulated on a classical computer. Recently, these methods have been employed to demonstrate the classical simulability of the quantum Fourier transform (QFT). In this note, we show that one can demonstrate a number of simulability results for QFT circuits in a straightforward manner using Griffiths and Niu's semi-classical QFT construction [Phys. Rev. Lett. 76, 3228 (1996)]. We then discuss the consequences of these results in the context of Shor's factorisation algorithm.
dc.description4 pages, 2 figures. Comments welcome
dc.identifierhttps://arxiv.org/abs/quant-ph/0612021
dc.identifierhttp://arxiv.org/abs/quant-ph/0612021
dc.identifierNew J. Phys. 9 146 (2007).
dc.identifierdoi:10.1088/1367-2630/9/5/146
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/131610
dc.subjectQuantum Physics
dc.titleEfficient classical simulation of the semi-classical Quantum Fourier Transform
dc.typetext

Files

Collections

arXiv