REVIEW 2 cited by
A Depth-Aware Swap Insertion Scheme for the Qubit Mapping Problem
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
The rapid progress of physical implementation of quantum computers paved the way of realising the design of tools to help users write quantum programs for any given quantum devices. The physical constraints inherent to the current NISQ architectures prevent most quantum algorithms from being directly executed on quantum devices. To enable two-qubit gates in the algorithm, existing works focus on inserting SWAP gates to dynamically remap logical qubits to physical qubits. However, their schemes lack the consideration of the depth of generated quantum circuits. In this work, we propose a depth-aware SWAP insertion scheme for qubit mapping problem in the NISQ era.
Forward citations
Cited by 2 Pith papers
-
Leveraging Phase Polynomials for Quantum Circuit Optimization
A quantum circuit optimizer, PhasePoly, co-optimizes phase and output parity matrices and merges phase-polynomial blocks across gate barriers, reducing total gates by 34.9% and CNOT gates by 28.5% on average.
-
AI-Powered Algorithm-Centric Quantum Processor Topology Design
An RL-based system, Qtailor, designs a circuit-specific qubit topology and reports compiled-circuit depth reductions of 5-46% over a fixed 10x10 grid baseline.
Discussion (0). Continue with ORCID to comment.