A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Revisiting the simulation of quantum Turing machines by quantum circuits
2019
Proceedings of the Royal Society A
Yao's 1995 publication 'Quantum circuit complexity' in Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, pp. 352-361, proved that quantum Turing machines and quantum circuits are polynomially equivalent computational models: t≥n steps of a quantum Turing machine running on an input of length n can be simulated by a uniformly generated family of quantum circuits with size quadratic in t, and a polynomial-time uniformly generated family of quantum circuits can be
doi:10.1098/rspa.2018.0767
pmid:31293355
pmcid:PMC6598068
fatcat:yruhzdqwoffg3pbctqi5gze5ni