文章基本信息

标题：On the Robustness of Bucket Brigade Quantum RAM
本地全文：下载
作者：Srinivasan Arunachalam ; Vlad Gheorghiu ; Tomas Jochym-O'Connor 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2015
卷号：44
页码：226-244
DOI：10.4230/LIPIcs.TQC.2015.226
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：We study the robustness of the bucket brigade quantum random access memory model introduced by Giovannetti, Lloyd, and Maccone [Phys. Rev. Lett., 2008]. Due to a result of Regev and Schiff [ICALP, 2008], we show that for a class of error models the error rate per gate in the bucket brigade quantum memory has to be of order o(2^{-n/2}) (where N=2^n is the size of the memory) whenever the memory is used as an oracle for the quantum searching problem. We conjecture that this is the case for any realistic error model that will be encountered in practice, and that for algorithms with super-polynomially many oracle queries the error rate must be super-polynomially small, which further motivates the need for quantum error correction. We introduce a circuit model for the quantum bucket brigade architecture and argue that quantum error correction for the circuit causes the quantum bucket brigade architecture to lose its primary advantage of a small number of "active" gates, since all components have to be actively error corrected.
关键词：Quantum Mechanics; Quantum Memories; Quantum Error Correction