Requirements for fault-tolerant factoring on an atom-optics quantum computer

62Citations
Citations of this article
42Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Quantum information processing and its associated technologies have reached a pivotal stage in their development, with many experiments having established the basic building blocks. Moving forward, the challenge is to scale up to larger machines capable of performing computational tasks not possible today. This raises questions that need to be urgently addressed, such as what resources these machines will consume and how large will they be. Here we estimate the resources required to execute Shor's factoring algorithm on an atom-optics quantum computer architecture. We determine the runtime and size of the computer as a function of the problem size and physical error rate. Our results suggest that once the physical error rate is low enough to allow quantum error correction, optimization to reduce resources and increase performance will come mostly from integrating algorithms and circuits within the error correction environment, rather than from improving the physical hardware. © 2013 Macmillan Publishers Limited. All rights reserved.

Cite

CITATION STYLE

APA

Devitt, S. J., Stephens, A. M., Munro, W. J., & Nemoto, K. (2013). Requirements for fault-tolerant factoring on an atom-optics quantum computer. Nature Communications, 4. https://doi.org/10.1038/ncomms3524

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free