A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Fault-tolerant quantum computation with constant error
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Quantum computation and quantum information
Quantum computation and quantum information
Using simulation to assess the feasibility of quantum computing
Using simulation to assess the feasibility of quantum computing
Factorization of a 512-bit RSA modulus
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
How to Steer a Quantum System over a Schrödinger Bridge
Quantum Information Processing
Building quantum wires: the long and the short of it
Proceedings of the 30th annual international symposium on Computer architecture
Datapath and control for quantum wires
ACM Transactions on Architecture and Code Optimization (TACO)
Toward Intelligent Agents on Quantum Computers
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
Quantum networks: from quantum cryptography to quantum architecture
ACM SIGCOMM Computer Communication Review
Improving quantum circuit dependability with reconfigurable quantum gate arrays
Proceedings of the 2nd conference on Computing frontiers
A Quantum Logic Array Microarchitecture: Scalable Quantum Data Movement and Computation
Proceedings of the 38th annual IEEE/ACM International Symposium on Microarchitecture
NANA: A nano-scale active network architecture
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Implementing quantum genetic algorithms: a solution based on Grover's algorithm
Proceedings of the 3rd conference on Computing frontiers
The impact of the nanoscale on computing systems
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Quantum Memory Hierarchies: Efficient Designs to Match Available Parallelism in Quantum Computing
Proceedings of the 33rd annual international symposium on Computer Architecture
Origins and motivations for design rules in QCA
Nano, quantum and molecular computing
Proceedings of the 34th annual international symposium on Computer architecture
Information Free Quantum Bus for Generating Stabiliser States
Quantum Information Processing
High-level interconnect model for the quantum logic array architecture
ACM Journal on Emerging Technologies in Computing Systems (JETC)
A fault tolerant, area efficient architecture for Shor's factoring algorithm
Proceedings of the 36th annual international symposium on Computer architecture
System design for large-scale ion trap quantum information processor
Quantum Information & Computation
SYSTEM MODELING AND ANALYSIS USING COMMUNICATION CHANNELS
Journal of Integrated Design & Process Science
Hi-index | 4.10 |
Quantum computers offer the prospect of computation that scales exponentially with data size. Unfortunately, a single bit error can corrupt an exponential amount of data. Quantum mechanics can seem more suited to science fiction than system engineering, yet small quantum devices of 5 to 7 bits have been built in the laboratory, 100-bit devices are on the drawing table now, and emerging quantum technologies promise even greater scalability. Empirical studies of practical quantum architectures are just beginning to appear in the literature. Elementary architectural concepts are still lacking: How do we provide quantum storage, data paths, classical control circuits, parallelism, and system integration? And, crucially, how can we design architectures to reduce error-correction overhead? The authors describe a proposed architecture that uses code teleportation, quantum memory refresh units, dynamic compilation of quantum programs, and scalable error correction to achieve system- level efficiencies. They assert that their work indicates the underlying technology's reliability is crucial; practical architectures will require quantum technologies with error rates between 10 ?6 and 10 ?9 .