English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Quantum information processing and its associated technologies has reached aninteresting and timely stage in their development where many differentexperiments have been performed establishing the basic building blocks. Thechallenge moving forward is to scale up to larger sized quantum machinescapable of performing tasks not possible today. This raises a number ofinteresting questions like: How big will these machines need to be? how manyresources will they consume? This needs to be urgently addressed. Here weestimate the resources required to execute Shor's factoring algorithm on adistributed atom-optics quantum computer architecture. We determine the runtimeand requisite size of the quantum computer as a function of the problem sizeand physical error rate. Our results suggest that once experimental accuracyreaches levels below the fault-tolerant threshold, further optimisation ofcomputational performance and resources is largely an issue of how thealgorithm and circuits are implemented, rather than the physical quantumhardware

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