کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
421988 684999 2008 9 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
An Algorithmic Construction of Quantum Circuits of High Descriptive Complexity
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
An Algorithmic Construction of Quantum Circuits of High Descriptive Complexity
چکیده انگلیسی

We discuss an algorithmic construction which, for any finite but universal set of computable quantum gates and a given measurement basis, will produce a rational quantum circuit whose shortest ϵ-approximations from products of instances of the gates have sizes which grow at least exponentially in the input sizes of the circuits and logarithmically in the reciprocal of ϵ. We also discuss the constructive content of the Solovay-Kitaev theorem by considering the algorithmic enumeration of all quantum circuits of a given input size.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Theoretical Computer Science - Volume 221, 25 December 2008, Pages 61-69