CNOT Gate Mappings to Clifford+T Circuits in IBM Architectures

Almeida, Alexandre A. A. de; Dueck, Gerhard W.; Silva, Alexandre C. R. da

doi:10.1109/ismvl.2019.00010

Cited by 9 publications

(3 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the past, several methods have been developed that tackle this problem [8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23]. All these algorithms follow one of two strategies for satisfying the coupling constraint: using swapping or bridging.…”

Section: State Of the Art And Limitationsmentioning

confidence: 99%

“…State-of-the-art approaches (such as introduced in [8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23]) employ swapping as well as bridging schemes to satisfy the coupling constraint for a given operation if required. While they are working reasonably well for smaller architectures, they lead to substantial additional costs when large distances in growing architectures have to be covered.…”

Section: Introductionmentioning

confidence: 99%

“…The number of CNOT operations required to realize bridging grows exponentially by 3•2 −2 gates with respect to the distance of the target and the control qubit. Several approaches utilizing bridging have been developed [10,[16][17][18]22], but typically approaches using swapping result in cheaper mapped circuits since, the overhead with swapping grows only linear with respect to this distance. Hence, swapping approaches are considered more practical for larger quantum architectures.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Exploiting Quantum Teleportation in Quantum Circuit Mapping

Hillmich¹,

Zulehner²,

Wille³

2020

Preprint

View full text Add to dashboard Cite

Quantum computers are constantly growing in their number of qubits, but continue to suffer from restrictions such as the limited pairs of qubits that may interact with each other. Thus far, this problem is addressed by mapping and moving qubits to suitable positions for the interaction (known as quantum circuit mapping). However, this movement requires additional gates to be incorporated into the circuit, whose number should be kept as small as possible since each gate increases the likelihood of errors and decoherence. State-of-the-art mapping methods utilize swapping and bridging to move the qubits along the static paths of the coupling map-solving this problem without exploiting all means the quantum domain has to offer. In this paper, we propose to additionally exploit quantum teleportation as a possible complementary method. Quantum teleportation conceptually allows to move the state of a qubit over arbitrary long distances with constant overhead-providing the potential of determining cheaper mappings. The potential is demonstrated by a case study on the IBM Q Tokyo architecture which already shows promising improvements. With the emergence of larger quantum computing architectures, quantum teleportation will become more effective in generating cheaper mappings.

show abstract