Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Quantum computation and quantum information
Quantum computation and quantum information
Building quantum wires: the long and the short of it
Proceedings of the 30th annual international symposium on Computer architecture
Proceedings of the 32nd annual international symposium on Computer Architecture
Quantum Memory Hierarchies: Efficient Designs to Match Available Parallelism in Quantum Computing
Proceedings of the 33rd annual international symposium on Computer Architecture
Implementation of Shor's algorithm on a linear nearest neighbour qubit array
Quantum Information & Computation
A fault tolerant, area efficient architecture for Shor's factoring algorithm
Proceedings of the 36th annual international symposium on Computer architecture
Quantum rotations: a case study in static and dynamic machine-code generation for quantum computers
Proceedings of the 40th Annual International Symposium on Computer Architecture
| Hi-index | 0.00 |
In this paper we present the first ever systematic design space exploration of microcoded software fault tolerant ion-trap quantum computers. This exploration reveals the critical importance of a well-tuned microcode for providing high performance and ensuring system reliability. In addition, we find that, despite recent advances in the reliability of quantum memory, the impact of errors due to stored quantum data is now, and will continue to be, a major source of systemic error. Finally, our exploration reveals a single design which out performs all others we considered in run time, fidelity and area. For completeness our design space exploration includes designs from prior work and we find a novel design that is 1/2 the size, 3 times as fast, and an order of magnitude more reliable.