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
Proceedings of the 38th annual Design Automation Conference
Quantum computation and quantum information
Quantum computation and quantum information
Datapath and control for quantum wires
ACM Transactions on Architecture and Code Optimization (TACO)
| Hi-index | 0.00 |
Quantum computing is a new and promising technology with the potential of exponentially powerful computation - if only a large-scale one can be built. There are several challenges in building a large-scale quantum computer - fabrication, verification, and architecture. The power of quantum computing comes from the ability to store a complex state in a single bit. This also what makes quantum systems difficult to build, verify, and design. Quantum states are fragile, so fabrication must be precise, and bits must often operate at very low temperatures. Unfortunately, the complete state may not be measured precisely, so verification is difficult. Imagine verifying an operation that is expected to not always get the same answer, but only an answer with a particular probability! Finally, errors occur much more often than with classical computing, making error correction the dominant task that quantum architectures need to perform well. We provide a basic tutorial of quantum computation for the system designer and examine the fundamental design and verification issues in constructing scalable quantum computers. We find the primary issues to be the verification of precise fabrication constraints, the design of quantum communication mechanisms, and the design of classical control circuitry for quantum operation.