A Heuristic for Linear Nearest Neighbor Realization of Quantum Circuits by SWAP Gate Insertion Using -Gate Lookahead

Kole, Abhoy; Datta, Kamalika; Sengupta, Indranil

doi:10.1109/jetcas.2016.2528720

Cited by 57 publications

(19 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Most of the previous works [23]- [27] using the second method only adapt for nearest-neighbor connectivity and cannot be directly applicable to actual quantum architectures with nonuniform connections. Recently, publications [14], [28]- [34] that are not restricted to a specific architecture have been released.…”

Section: Introductionmentioning

confidence: 99%

A Hardware-Aware Heuristic for the Qubit Mapping Problem in the NISQ Era

Niu

Suau

Staffelbach

et al. 2020

IEEE Trans. Quantum Eng.

View full text Add to dashboard Cite

Due to several physical limitations in the realization of quantum hardware, today's quantum computers are qualified as noisy intermediate-scale quantum (NISQ) hardware. NISQ hardware is characterized by a small number of qubits (50 to a few hundred) and noisy operations. Moreover, current realizations of superconducting quantum chips do not have the ideal all-to-all connectivity between qubits but rather at most a nearest-neighbor connectivity. All these hardware restrictions add supplementary low-level requirements. They need to be addressed before submitting the quantum circuit to an actual chip. Satisfying these requirements is a tedious task for the programmer. Instead, the task of adapting the quantum circuit to a given hardware is left to the compiler. In this article, we propose a hardware-aware (HA) mapping transition algorithm that takes the calibration data into account with the aim to improve the overall fidelity of the circuit. Evaluation results on IBM quantum hardware show that our HA approach can outperform the state of the art, both in terms of the number of additional gates and circuit fidelity.

show abstract

Section: Introductionmentioning

confidence: 99%

A Hardware-Aware Heuristic for the Qubit Mapping Problem in the NISQ Era

Niu

Suau

Staffelbach

et al. 2020

IEEE Trans. Quantum Eng.

View full text Add to dashboard Cite

show abstract

“…In most cases, some commonly used quantum technologies required in LNN (Linear Nearest Neighbor) [1] architecture that qubits are arranged in a line and only adjacent qubits can interact. In order to achieve the LNN constraint of quantum technology and construct quantum circuits for LNN, so far, many related synthesis algorithms for LNN architecture have been put forward [2][3][4][5][6]. To realize the LNN quantum circuit synthesis method, M Saeedi [2] constructed interaction map, and the algorithm transforms optimization for the qubits interact distance into the problem of Minimum Linear Arrangement (MINLA).…”

Section: Introductionmentioning

confidence: 99%

“…However, this method is not suitable for quantum circuits composed of multiple-qubits quantum gates. Very recently, A Kole [5] showed that an optimization approach for circuit neighbor based on the global ordering. Its applicability is limited although it is suited to NCV library.…”

Section: Introductionmentioning

confidence: 99%

Quantum Circuit Synthesis for Linear Nearest Neighbor Based on the Vector Transformation

Lu¹,

Guan²,

Cheng³

et al. 2017

Proceedings of the 2016 International Forum on Mechanical, Control and Automation (IFMCA 2016)

View full text Add to dashboard Cite

Abstract. In this paper, a synthesis method is proposed based on vector transformation for linear nearest neighbor quantum circuits. Its aim is to construct a linear nearest neighbor quantum circuit, and to reduce the quantum cost of the linear reversible circuit. The vector representation of the sequence of the circuit lines and qubits of quantum gate is given in this method. It realizes the nearest neighbor of the quantum circuit by moving the position of the qubits vector elements, and it does not cause confusion due to comparison and transformation of two vector elements in the circuit. The number of SWAP gates needed to make the quantum circuit nearest neighbors is given, and its correctness is proven. Compared with the current quantum circuit synthesis algorithms, the average optimization rate of the quantum cost is 39.69% for typical benchmark circuits. The algorithm can be applied to all quantum circuits of 2-qubit quantum gates, and can be used in large quantum circuits.

show abstract

“…Direct comparison of our method to obtain nearest-neighbor compliant circuits with existing works could not be performed for primarily three reasons. The existing works [235][236][237][238] focus on determining linear nearest neighbors (LNN), with the objective of reducing number of swap gates. Our proposed method is for obtaining the LNN circuits with minimal depth which is contrary to the goal of reducing swap gate count.…”

Section: Resultsmentioning

confidence: 99%

“…Secondly, the initial placement of the qubit is assumed to be given as input to the problem, but other works consider this as part of the optimization. Finally, most of the existing works decompose the gates into two qubit gates [219,235,236,239]. In our work, we used unmodified circuits from RevLib [231].…”

Section: Resultsmentioning

confidence: 99%

Architectures and automation for beyond-CMOS technologies

Bhattacharjee¹

View full text Add to dashboard Cite

A Heuristic for Linear Nearest Neighbor Realization of Quantum Circuits by SWAP Gate Insertion Using -Gate Lookahead

Cited by 57 publications

References 33 publications

A Hardware-Aware Heuristic for the Qubit Mapping Problem in the NISQ Era

A Hardware-Aware Heuristic for the Qubit Mapping Problem in the NISQ Era

Quantum Circuit Synthesis for Linear Nearest Neighbor Based on the Vector Transformation

Architectures and automation for beyond-CMOS technologies

Contact Info

Product

Resources

About