Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Optimal instruction scheduling using integer programming
PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
Quantum computation and quantum information
Quantum computation and quantum information
The effect of communication costs in solid-state quantum computing architectures
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
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
A Quantum Logic Array Microarchitecture: Scalable Quantum Data Movement and Computation
Proceedings of the 38th annual IEEE/ACM International Symposium on Microarchitecture
Interconnection Networks for Scalable Quantum Computers
Proceedings of the 33rd 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
A program transformation and architecture support for quantum uncomputation
Proceedings of the 12th international conference on Architectural support for programming languages and operating systems
Quantum Computing for Computer Architects (Synthesis Lectures on Computer Architecture)
Quantum Computing for Computer Architects (Synthesis Lectures on Computer Architecture)
Towards spin-based quantum computing on liquid helium
Towards spin-based quantum computing on liquid helium
A logarithmic-depth quantum carry-lookahead adder
Quantum Information & Computation
Quantum computing with electrons floating on liquid helium
Quantum Information & Computation
Running a Quantum Circuit at the Speed of Data
ISCA '08 Proceedings of the 35th 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 recent years, quantum computing (QC) research has moved from the realm of theoretical physics and mathematics into real implementations. With many different potential hardware implementations, quantum computer architecture is a rich field with an opportunity to solve interesting new problems and to revisit old ones. This paper presents a QC architecture tailored to physical implementations with highly mobile and persistent quantum bits (qubits). Implementations with qubit coherency times that are much longer than operation times and qubit transportation times that are orders of magnitude faster than operation times lend greater flexibility to the architecture. This is particularly true in the placement and locality of individual qubits. For concreteness, we assume a physical device model based on electron-spin qubits on liquid helium (eSHe). Like many conventional computer architectures, QCs focus on the efficient exposure of parallelism.We present here a QC microarchitecture that enjoys increasing computational parallelism with size and latency scaling only linearly with the number of operations. Although an efficient and high level of parallelism is admirable, quantum hardware is still expensive and difficult to build, so we demonstrate how the software may be optimized to reduce an application's hardware requirements by 25% with no performance loss. Because the majority of a QC's time and resources are devoted to quantum error correction, we also present noise modeling results that evaluate error correction procedures. These results demonstrate that idle qubits in memory need only be refreshedapproximately once every one hundred operation cycles.