g'dZddlmZddlZddlmZddlmZddl m Z m Z m Z m Z dZdZd Zd Zd Zd Zd ZdZddZdS)a Optimize the synthesis of an n-qubit circuit contains only CX gates for linear nearest neighbor (LNN) connectivity. The depth of the circuit is bounded by 5*n, while the gate count is approximately 2.5*n^2 References: [1]: Kutin, S., Moulton, D. P., Smithline, L. (2007). Computation at a Distance. `arXiv:quant-ph/0701194 `_. ) annotationsN) QiskitError)QuantumCircuit)calc_inverse_matrixcheck_invertible_binary_matrixcol_oprow_opcV|||ft|||dSN)appendr )cx_instructionsmatabs ^/granary/edev/quantum/lib/python3.11/site-packages/qiskit/synthesis/linear/linear_depth_lnn.py_row_op_update_instructionsr$s2Aq6""" 31cD|}|}|}g}ttd|D]}d}ttd|D]$}|||fr|sd}|} t||| %ttd|D]} || | frt |||| |D]<} t || d| dt|| d| d=||fS)NrFT)copyreversedrangerrr ) nrmat_invmat_t mat_inv_tcx_instructions_rowsi found_firstjfirst_jkinsts r_get_lower_triangularr$*sT ((**C HHJJE I eAqkk " "MM %1++&& , ,A1a4y ,","&KGG37+++%1++&& M MA1g: M+,@#q!LLL M %,,ud1gtAw'''y$q'47++++ ) rcg}t|D]>}d}|||dz |z fs|dz }|||dz |z f||?|S)Nrr)rr )rr label_arrrr s r_get_label_arrr'Ns{I 1XX 1q519 %  FA1q519 %  rc||}tjt|t}t |D]\}}||r |||z }||rdSdS)N)dtypeFT)npzeroslenbool enumerate) label_arr_trrowr"indx_kw_neededrow_l_s r_in_linear_combinationr5Yss ^FxC---HcNN33q u: 3 )E"22Hu 4rcLdg|z}t|D] }||||<|Sr )r)rr&r/rs r_get_label_arr_tr7is9&1*K 1XX&&$% IaL!! rc t|||\}}t||}t||}d}d}d} g} | s%d} t||dz dD]} || || dzkrd} t |||| dz|| dzrnt |||| dz|| z || dzrt | || | dznKt |||| || dzr*t | || dz| t | || | dz|| dz|| c|| <|| dz<| s|dz }|dkrd} nd}t | }| %| SNrFrT)r$r'r7rr5rint) rrrrrr&r/ first_qubit empty_layersdonerat_least_one_neededrs r_matrix_to_north_westr@qs -QW==E9q%((I#1i00KKL D!+#{AE1-- P PA|iA...&*#*+y#a!e*iXY\]X]N^__ U+CAJQ,?1q5AQU00Dc1aRSeTTTT+KCFIVWZ[V[L\]]U/0Dc1q5RSTTT/0Dc1aRSeTTT1:1q51A9Q<. ! iA."  A LaLk/** C!+F rcttt|}d}d}d}g}|sd}t||dz dD]}||||dzkrqd}||||dzfst|||dz|t||||dzt|||dz|||dz||c||<||dz<|s|dz }|dkrd}nd}t | }||Sr9)listrrrr;) rrr&r<r=r>rr?rs r_north_west_to_identityrCs[XeAhh''((IKL D+#{AE1-- P PA|iA...&*#1iA../U/0Dc1q5RSTTT+,@#q!a%PPP+,@#q1uaPPP1:1q51A9Q<. ! iA."  A LaLk/** 5+8 rc|td}t|}t|}t |||}t ||}||fS)NT)r)astyper-rr,r@rC)rrmat_cpyrcx_instructions_rows_m2nwcx_instructions_rows_nw2ids r_optimize_cx_circ_depth_5n_linerIscjjDj))G!'**G G A!6a' J J"9G!D!D $&@ @@rrnp.ndarray[bool]returnrcPt|stdt|}t|}t |}|dD]$}||d|d%|dD]$}||d|d%|S)a Synthesize linear reversible circuit for linear nearest-neighbor architectures using Kutin, Moulton, Smithline method. Synthesis algorithm for linear reversible circuits from [1], section 7. This algorithm synthesizes any linear reversible circuit of :math:`n` qubits over a linear nearest-neighbor architecture using CX gates with depth at most :math:`5n`. Args: mat: A boolean invertible matrix. Returns: The synthesized quantum circuit. Raises: QiskitError: if ``mat`` is not invertible. References: 1. Kutin, S., Moulton, D. P., Smithline, L., *Computation at a distance*, Chicago J. Theor. Comput. Sci., vol. 2007, (2007), `arXiv:quant-ph/0701194 `_ z#The input matrix is not invertible.rr)rrr,rIrcx)r num_qubitscx_instqcpairs rsynth_cnot_depth_line_kmsrRs. *# . .A?@@@SJ-c22G  # #B    d1gtAw    d1gtAw Ir)rrJrKr)__doc__ __future__rnumpyr*qiskit.exceptionsrqiskit.circuitr+qiskit.synthesis.linear.linear_matrix_utilsrrrr rr$r'r5r7r@rCrIrRrrrZs+  #""""")))))))))))) !!!H    5 5 5 p& & & RAAA>######r