Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Efficient classical simulation of the semi-classical Quantum Fourier
  Transform   A 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.

1
The categories of this paper are: cs
20
The categories of this paper are: acc-phys
6
The categories of this paper are: astro-ph
17
The categories of this paper are: q-fin
0
The categories of this paper are: hep-ph
36
The categories of this paper are: cmp-lg
3
The categories of this paper are: physics
18
The categories of this paper are: econ
29
The categories of this paper are: funct-an
21
The categories of this paper are: adap-org
34
The categories of this paper are: chem-ph
12
The categories of this paper are: nucl-th
14
The categories of this paper are: math-ph
35
The categories of this paper are: mtrl-th
37
The categories of this paper are: supr-con
32
The categories of this paper are: atom-ph