The complexity of quantum circuit mapping with fixed parameters
type: Item
instance of: scholarly article
title: The complexity of quantum circuit mapping with fixed parameters
author: Pengcheng Zhu
author: Shenggen Zheng
author: Lihua Wei
author: Shiguang Feng
author: Xueyun Cheng
author: Zhi-jin Guan
published in: Quantum Information Processing
publication date: 2022-12-09T00:00:00Z
full work available at URL: https://arxiv.org/abs/2207.08438
Mathematics Subject Classification ID: 81P68
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 68Q12
zbMATH DE Number: 7631813
zbMATH Keywords: qubit mapping
zbMATH Keywords: quantum circuit transformation
zbMATH Keywords: parameterized complexity
zbMATH Keywords: NISQ device
MaRDI profile type: Publication
OpenAlex ID: W4307648408
cites work: Efficient distributed quantum computing
cites work: Quantum advantage with shallow circuits
cites work: Q5089148
cites work: Parametrized complexity theory.
cites work: Q4198056
cites work: Some simplified NP-complete graph problems
cites work: Hamiltonian properties of triangular grid graphs
cites work: Hamilton Paths in Grid Graphs
cites work: Qubit Mapping Based on Subgraph Isomorphism and Filtered Depth-Limited Search
cites work: Q3392273
cites work: Fundamentals of Computation Theory
cites work: Exact global reordering for nearest neighbor quantum circuits using \({\mathrm {A}}^{*}\)
DOI: 10.1007/S11128-022-03698-0
description: scientific article; zbMATH DE number 7631813