On the Influence of Initial Qubit Placement During NISQ Circuit Compilation
Alexandru Paler

TL;DR
This paper investigates how initial qubit placement affects the efficiency of compiling quantum circuits for NISQ devices, introducing a heuristic and cost model that can reduce gate overhead by up to 10%.
Contribution
It presents a novel heuristic and cost model to optimize initial qubit placement, reducing gate overhead during NISQ circuit compilation.
Findings
Cost reductions of up to 10% achieved.
Different initial placements outperform default placements.
Benchmarking with standard compilers shows practical benefits.
Abstract
Noisy Intermediate-Scale Quantum (NISQ) machines are not fault-tolerant, operate few qubits (currently, less than hundred), but are capable of executing interesting computations. Above the quantum supremacy threshold (approx. 60 qubits), NISQ machines are expected to be more powerful than existing classical computers. One of the most stringent problems is that computations (expressed as quantum circuits) have to be adapted (compiled) to the NISQ hardware, because the hardware does not support arbitrary interactions between the qubits. This procedure introduces additional gates (e.g. SWAP gates) into the circuits while leaving the implemented computations unchanged. Each additional gate increases the failure rate of the adapted (compiled) circuits, because the hardware and the circuits are not fault-tolerant. It is reasonable to expect that the placement influences the number of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Low-power high-performance VLSI design · Parallel Computing and Optimization Techniques
