### Abstract

Quantum algorithms can be written down in several forms, one of the most common is the quantum circuit representation using discrete gates. The challenge in assessing the computational cost then becomes counting those gates, with realistic costs assigned to each gate. Moreover, interacting pairs of qubits inside most quantum computers will require moving qubits. In many architectures, this will involve cellular automaton-like swapping of qubits. In general, the depth will be described in number of quantum error correction (QEC) cycles, while the total cost will be space-time ''volume'' consisting of the number of qubits involved over that set of QEC cycles. This implies that accurate estimates can be made only in the context of a particular architecture and error correction mechanism.

Original language | English |
---|---|

Title of host publication | Proceedings of the Asian Test Symposium |

Pages | 50-54 |

Number of pages | 5 |

DOIs | |

Publication status | Published - 2012 |

Event | 2012 IEEE 21st Asian Test Symposium, ATS 2012 - Niigatta, Japan Duration: 2012 Nov 19 → 2012 Nov 22 |

### Other

Other | 2012 IEEE 21st Asian Test Symposium, ATS 2012 |
---|---|

Country | Japan |

City | Niigatta |

Period | 12/11/19 → 12/11/22 |

### Fingerprint

### Keywords

- Compilation
- Optimization
- Quantum computation

### ASJC Scopus subject areas

- Electrical and Electronic Engineering

### Cite this

*Proceedings of the Asian Test Symposium*(pp. 50-54). [6394171] https://doi.org/10.1109/ATS.2012.67

**Counting gates, moving qubits : Evaluating the execution cost of quantum circuits.** / Van Meter, Rodney D.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings of the Asian Test Symposium.*, 6394171, pp. 50-54, 2012 IEEE 21st Asian Test Symposium, ATS 2012, Niigatta, Japan, 12/11/19. https://doi.org/10.1109/ATS.2012.67

}

TY - GEN

T1 - Counting gates, moving qubits

T2 - Evaluating the execution cost of quantum circuits

AU - Van Meter, Rodney D

PY - 2012

Y1 - 2012

N2 - Quantum algorithms can be written down in several forms, one of the most common is the quantum circuit representation using discrete gates. The challenge in assessing the computational cost then becomes counting those gates, with realistic costs assigned to each gate. Moreover, interacting pairs of qubits inside most quantum computers will require moving qubits. In many architectures, this will involve cellular automaton-like swapping of qubits. In general, the depth will be described in number of quantum error correction (QEC) cycles, while the total cost will be space-time ''volume'' consisting of the number of qubits involved over that set of QEC cycles. This implies that accurate estimates can be made only in the context of a particular architecture and error correction mechanism.

AB - Quantum algorithms can be written down in several forms, one of the most common is the quantum circuit representation using discrete gates. The challenge in assessing the computational cost then becomes counting those gates, with realistic costs assigned to each gate. Moreover, interacting pairs of qubits inside most quantum computers will require moving qubits. In many architectures, this will involve cellular automaton-like swapping of qubits. In general, the depth will be described in number of quantum error correction (QEC) cycles, while the total cost will be space-time ''volume'' consisting of the number of qubits involved over that set of QEC cycles. This implies that accurate estimates can be made only in the context of a particular architecture and error correction mechanism.

KW - Compilation

KW - Optimization

KW - Quantum computation

UR - http://www.scopus.com/inward/record.url?scp=84872554292&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84872554292&partnerID=8YFLogxK

U2 - 10.1109/ATS.2012.67

DO - 10.1109/ATS.2012.67

M3 - Conference contribution

SN - 9780769548760

SP - 50

EP - 54

BT - Proceedings of the Asian Test Symposium

ER -