[Retracted] Heuristic Reordering Strategy for Quantum Circuit Mapping on LNN Architectures
Algorithm 2
The local heuristic qubit reordering (LHQR) algorithm.
Step 1: For an n-bit quantum circuit G of a non-LNN architecture, find the first non-nearest neighbor gate from left to right;
Step 2: Assign the two qubits of to l1 and l2 respectively, and l1 < l2, let lx = l1 +1;
Step 3: Move the qubit l1 to the position of lx by adding a swap gate, get a new quantum circuit new_G, and calculate the NNC sum of the quantum gate corresponding to in new_G, denoted as new_NNC, lx ++;
Step 4: If lx = l2, go to step7, otherwise, go to step5;
Step 5: Add a SWAP gate in G to move the qubit l1 to the position of lx, get a new quantum circuit new_G_1, and calculate the NNC sum of the quantum gates behind in new_G_1, denoted as new_NNC_1, lx ++;
Step 6: If new_NNC_1 < new_NNC，let new_NNC = new_NNC_1, go to step5;
Step 7: = new_G；
Step 8: Find the non-neighbor gate behind in G, if it exists, assign it to , go to step2, otherwise perform step9;
