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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish
Title of host publicationProceedings - 2012 IEEE 21st Asian Test Symposium, ATS 2012
Pages50-54
Number of pages5
DOIs
Publication statusPublished - 2012 Dec 1
Event2012 IEEE 21st Asian Test Symposium, ATS 2012 - Niigatta, Japan
Duration: 2012 Nov 192012 Nov 22

Publication series

NameProceedings of the Asian Test Symposium
ISSN (Print)1081-7735

Other

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

Keywords

  • Compilation
  • Optimization
  • Quantum computation

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Counting gates, moving qubits: Evaluating the execution cost of quantum circuits'. Together they form a unique fingerprint.

Cite this