The Complexity of Quantum Circuit Mapping with Fixed Parameters
| Autor: | Pengcheng Zhu, Shenggen Zheng, Lihua Wei, Xueyun Cheng, Zhijin Guan, Shiguang Feng |
|---|---|
| Rok vydání: | 2022 |
| Předmět: |
FOS: Computer and information sciences
Quantum Physics FOS: Physical sciences Statistical and Nonlinear Physics Computational Complexity (cs.CC) Theoretical Computer Science Electronic Optical and Magnetic Materials Computer Science - Computational Complexity Computer Science::Hardware Architecture Computer Science::Emerging Technologies Modeling and Simulation Signal Processing Electrical and Electronic Engineering Quantum Physics (quant-ph) |
| DOI: | 10.48550/arxiv.2207.08438 |
| Popis: | A quantum circuit must be preprocessed before implementing on NISQ devices due to the connectivity constraint. Quantum circuit mapping (QCM) transforms the circuit into an equivalent one that is compliant with the NISQ device's architecture constraint by adding SWAP gates. The QCM problem asks the minimal number of auxiliary SWAP gates, and is NP-complete. The complexity of QCM with fixed parameters is studied in the paper. We give an exact algorithm for QCM, and show that the algorithm runs in polynomial time if the NISQ device's architecture is fixed. If the number of qubits of the quantum circuit is fixed, we show that the QCM problem is NL-complete by a reduction from the undirected shortest path problem. Moreover, the fixed-parameter complexity of QCM is W[1]-hard when parameterized by the number of qubits of the quantum circuit. We prove the result by a reduction from the clique problem. If taking the depth of the quantum circuits and the coupling graphs as parameters, we show that the QCM problem is still NP-complete over shallow quantum circuits, and planar, bipartite and degree bounded coupling graphs. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|