Name
Title | ||
|---|---|---|
Quantum rotations: a case study in static and dynamic machine-code generation for quantum computers |
Abstract | ||
|---|---|---|
Work in quantum computer architecture has focused on communication, layout and fault tolerance, largely driven by Shor's factorization algorithm. For the first time, we study a larger range of benchmarks and find that another critical issue is the generation of code sequences for quantum rotation operations. Specifically, quantum algorithms require arbitrary rotation angles, while quantum technologies and error correction codes provide only for discrete angles and operators. A sequence of quantum machine instructions must be generated to approximate the arbitrary rotation to the required precision. While previous work has focused exclusively on static compilation, we find that some applications require dynamic code generation and explore the advantages and disadvantages of static and dynamic approaches. We find that static code generation can, in some cases, lead to a terabyte of machine code to support required rotations. We also find that some rotation angles are unknown until run time, requiring dynamic code generation. Dynamic code generation, however, exhibits significant trade-offs in terms of time overhead versus code size. Furthermore, dynamic code generation will be performed on classical (non-quantum) computing resources, which may or may not have a clock speed advantage over the target quantum technology. For example, operations on trapped ions run at kilohertz speeds, but superconducting qubits run at gigahertz speeds. We introduce a new method for compiling arbitrary rotations dynamically, designed to minimize compilation time. The new method reduces compilation time by up to five orders of magnitude while increasing code size by one order of magnitude. We explore the design space formed by these trade-offs of dynamic versus static code generation, code quality, and quantum technology. We introduce several techniques to provide smoother trade-offs for dynamic code generation and evaluate the viability of options in the design space. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1145/2485922.2485937 | ISCA |
Keywords | Field | DocType |
machine code,dynamic machine-code generation,design space,compilation time,dynamic code generation,quantum computer,static code generation,quantum rotation,code quality,quantum technology,code size,code sequence,case study,error correction code,compilers,programming languages,quantum computers | Quantum technology,Computer science,Parallel computing,Quantum computer,Real-time computing,Code generation,Error detection and correction,Quantum algorithm,Machine code,Quantum machine,Quantum convolutional code | Conference |
Volume | Issue | ISSN |
41 | 3 | 0163-5964 |
Citations | PageRank | References |
9 | 0.73 | 12 |
Authors | ||
7 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel Kudrow | 1 | 42 | 2.52 |
| Kenneth Bier | 2 | 9 | 0.73 |
| Zhaoxia Deng | 3 | 21 | 1.98 |
| Diana Franklin | 4 | 332 | 40.85 |
| Yu Tomita | 5 | 19 | 2.06 |
| Kenneth R. Brown | 6 | 29 | 6.08 |
| Frederic T. Chong | 7 | 1428 | 130.07 |