Counting gates, moving qubits: Evaluating the execution cost of quantum circuits

研究成果: Conference contribution

抄録

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.

本文言語English
ホスト出版物のタイトルProceedings - 2012 IEEE 21st Asian Test Symposium, ATS 2012
ページ50-54
ページ数5
DOI
出版ステータスPublished - 2012 12 1
イベント2012 IEEE 21st Asian Test Symposium, ATS 2012 - Niigatta, Japan
継続期間: 2012 11 192012 11 22

出版物シリーズ

名前Proceedings of the Asian Test Symposium
ISSN(印刷版)1081-7735

Other

Other2012 IEEE 21st Asian Test Symposium, ATS 2012
CountryJapan
CityNiigatta
Period12/11/1912/11/22

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

フィンガープリント 「Counting gates, moving qubits: Evaluating the execution cost of quantum circuits」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル