pith. the verified trust layer for science. sign in

arxiv: quant-ph/0611241 · v1 · submitted 2006-11-23 · 🪐 quant-ph

Efficient classical simulation of the approximate quantum Fourier transform

classification 🪐 quant-ph
keywords quantumcircuitsapproximatefouriertransformclassicallyconditionmethod
0
0 comments X p. Extension
read the original abstract

We present a method for classically simulating quantum circuits based on the tensor contraction model of Markov and Shi (quant-ph/0511069). Using this method we are able to classically simulate the approximate quantum Fourier transform in polynomial time. Moreover, our approach allows us to formulate a condition for the composability of simulable quantum circuits. We use this condition to show that any circuit composed of a constant number of approximate quantum Fourier transform circuits and log-depth circuits with limited interaction range can also be efficiently simulated.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.