g?dZddlmZddlmZmZmZddlmZddl m Z ddl m Z ddl mZddlmZmZmZdd lmZejjGd d eZd S) z*Pass for Hoare logic circuit optimization.)TransformationPass)QuantumRegisterControlledGateGate) DAGCircuit) UnitaryGate) matrix_equal) CircuitError)CZGateCU1GateMCU1Gate) optionalsc|eZdZdZdfd ZdZdZdZdZdZ d Z d Z dd Z d Z dZddZdZdZdZxZS)HoareOptimizerzThis is a transpiler pass using Hoare logic circuit optimization. The inner workings of this are detailed in: https://arxiv.org/abs/1810.00375 cddlm}td|_d|_d|_d|_d|_||_ dS)z Args: size (int): size of gate cache, in number of gates Raises: MissingOptionalLibraryError: if unable to import z3 solver )_gate_extensionN) rsuper__init__solver variablesgatenum gatecachevarnumsize)selfrr __class__s e/granary/edev/quantum/lib/python3.11/site-packages/qiskit/transpiler/passes/optimization/hoare_opt.pyrzHoareOptimizer.__init__s[ &%%%%%     cddl}dt|zdzt|j|z}||}|j|xxdz cc<|j|||S)apAfter each gate generate a new unique variable name for each of the qubits, using scheme: 'q[id]_[gatenum]', e.g. q1_0 -> q1_1 -> q1_2, q2_0 -> q2_1 Args: qubit (Qubit): qubit to generate new variable for Returns: BoolRef: z3 variable of qubit state rNq_r)z3strrBoolrappend)rqubitr%varnamevars r _gen_variablezHoareOptimizer._gen_variable1s  E "S(3t|E/B+C+CCggg Uq  u$$S))) r!cddl}|jD]l}d|j|<g|j|<g|j|<i|j|<||}|j| |mdS)zcreate boolean variables for each qubit and apply qb == 0 condition Args: dag (DAGCircuit): input DAG to get qubits from rN) r%qubitsrrrrr,raddNot)rdagr%qbtxs r _initializezHoareOptimizer._initializeBs  : ' 'C !DL "$DN3 "$DN3 !DK ""3''A KOOBFF1II & & & &  ' 'r!c ddl}g}|D]*}|||+ |j|||j||zn#t$rYnwxYwt|D]P\}} |j|| |||| kQdS)a^create boolean variables for each qubit the gate is applied to and apply the relevant post conditions. a gate rotating out of the z-basis will not have any valid post-conditions, in which case the qubit state is unknown Args: gate (Gate): gate to inspect ctrl_ones (BoolRef): z3 condition asserting all control qubits to 1 trgtqb (list((QuantumRegister, int))): list of target qubits trgtvar (list(BoolRef)): z3 variables corresponding to latest state of target qubits rN) r%r(r,rr/Implies_postconditionsAttributeError enumerater0) rgate ctrl_onestrgtqbtrgtvarr%new_varsr2itvars r _add_postconditionsz"HoareOptimizer._add_postconditionsQs   5 5C OOD..s33 4 4 4 4  KOOBJJy2F$2FS[I[2]^^ _ _ _ _    D !)) P PGAt KOOBJJrvvi'8'8(1+:MNN O O O O P Ps9A// A<;A<c 0ddl}d}|j |j|}t |t r |rt |dkr|j|| ||d|j |j k}|j |j|j| ||d|j |j k}|p|}n|j| ||||j |j k}nL#t$r?|j||j |j k}YnwxYw|j |S)a}use z3 sat solver to determine triviality of gate Args: gate (Gate): gate to inspect ctrl_ones (BoolRef): z3 condition asserting all control qubits to 1 trgtvar (list(BoolRef)): z3 variables corresponding to latest state of target qubits Returns: bool: if gate is trivial rNFr)r%rpush _trivial_if isinstanceboollenr/r0Andcheckunsatpopr8) rr:r;r=r%trivial triv_condsol1sol2s r _test_gatezHoareOptimizer._test_gateks    :(('2I )T** :+W!2!2KOOBFF266)WQZ+H+H$I$IJJJ;,,.."(:DKOO%%%K$$&&&KOOBFF9gaj$A$ABBB;,,.."(:D"ldG y"&&2C2C D DEEE+++--9 6 6 6 KOOI & & &k''))RX5GGG 6" s F11AG:9G:c d}t|j t}| t t t ||j}t|tr| |}t|tttfrf|sd|ddkrX|ddz |d<|d|d||ddzdz|z}| |}|s |ddkX|r) fd|D}| |j||||fS)ause z3 sat solver to determine if all control qubits are in 1 state, and if so replace the Controlled - U by U. Args: gate (Gate): gate to inspect ctrlvar (list(BoolRef)): z3 variables corresponding to latest state of control qubits trgtvar (list(BoolRef)): z3 variables corresponding to latest state of target qubits Returns: Tuple(bool, DAGCircuit, List):: * bool:if controlled gate can be replaced. * DAGCircuit: with U applied to the target qubits. * List: with indices of target qubits. FrrNc g|] }| SrS).0qiqargs r z2HoareOptimizer._remove_control..s,,,2d2h,,,r!)r num_qubitsradd_qreglistrangerGrEr_check_removalr r r apply_operation_back base_gate) rr:ctrlvarr=remover1qb ctrl_varsr.rVs @r _remove_controlzHoareOptimizer._remove_controlsUt//ll T %G do66 7 7 dN + + 2((11F dVWh7 8 8 8 8A1 1#GbeG,wr!uqy{{/CCgM ,,Y77 8A  =,,,,,,,F  $ $T^V < < <sBr!c$ddl}|j|}|j|j|||j|jk}|j|S)Nr) r%rHrrCr/r0rIrJrK)rr_r%r;r`s r r\zHoareOptimizer._check_removals~ BFG$   y))***""$$0  r!cddl}t|}|D]}|j}||\}}}} |j|} |||| \} } }| ro||| } tt| }|j}||\}}}} |j|} | || | }|r| |n|j dkr|jD]@}|j|||j|dz |j||<A|jD];}t'|j||j kr|||<||| || dS)aGtraverse DAG in topological order for each gate check: if any control is 0, or if triviality conditions are satisfied if yes remove gate from dag apply postconditions of gate Args: dag (DAGCircuit): input DAG to optimize in place rNr)r%rZtopological_op_nodesop_seperate_ctrl_trgtrHrcsubstitute_node_with_dagnextitervaluesrPremove_op_noderqargsrr(rrrG_multigate_optrA)rr1r%nodesnoder:r$r_r<r=r; remove_ctrlnew_dag mapped_nodesrLr2s r _traverse_dagzHoareOptimizer._traverse_dags  S--//00 G GD7D*.*B*B4*H*H 'Aw(I&*&:&:4'&R&R #K! - #;;D'JJ D!4!4!6!67788w.2.F.Ft.L.L+7FG"BFG, oodIw??G 6""4((((Q:CCCN3'..t444-1\#->-BDK$T**:66C4>#.//49<<++C555  $ $T9fg F F F F= G Gr!Nc^d}|t|j|dz krd}|j||}|j||dz}||d}||d} |dz }|| kr |D]<} |j| |} |j| | dz|urd}=n#tt f$rYwxYw||g} |r|| r|| ro|dz }| D]g} || |$|j|| |kr*| j D]"} |j|  | #h|t|j|dz kdSdS)aremove gates that have the same set of target qubits, follow each other immediately on these target qubits, and combine to the identity (consider sequences of length 2 for now) Args: dag (DAGCircuit): the directed acyclic graph to run on. qubit (Qubit): qubit cache to inspect from_idx (int): only gates whose indexes in the cache are larger than this value can be removed rrTFN) rGrrhindex IndexError ValueError _is_identity _seq_as_onermrnr`)rr1r)from_idxr?r(node1node2trgtqb1trgtqb2r2idxseqrqs r _remove_successive_identityz*HoareOptimizer._remove_successive_identitys #dnU+,,q000FN5)!,EN5)!a%0E..u55a8G..u55a8G FA'!! "''C.-33E::C~c*3735@@!&' +    %.C =$++C00 =T5E5Ec5J5J =Q==D&&t,,,'4>%+@+F+Ft+L+Lx+W+W#':==C N3/66t<<<<3#dnU+,,q0000000s?CC'&C'ct|dksJ |dj|dj}}n#t$rYdSwxYw|j|j}}|j|j}}t |tr|j}|j }t |tr|j}|j }|tur|tur ||ko|o|S|tur'|turt|d|ddS||ko||kS)adetermine whether the sequence of gates combines to the identity (consider sequences of length 2 for now) Args: sequence (list(DAGOpNode)): gate sequence to inspect Returns: bool: if gate sequence combines to identity rwrrFT) ignore_phase) rGrginverser params definitionrErr^ base_classrrr )rsequencegate1gate2par1par2def1def2s r r{zHoareOptimizer._is_identitys/8}}!!!! #A;>8A;>+A+A+C+C5EE   55 \533ssH~#6#677SSh=P=PRURUW_R`9a9a b b   k!!RX-  r!c\|j|sdS||||t|j||jkr|dS|:d}t ||j|dg}n|j||dd}|D]h}fd|jD}||D];}|j||} | ||| .os#@@@Aq/?/?a/?/?/?r!)max_idxrr) rrrGrsetr/rnupdaterxro) rr1r)rr gates_tbrrqnew_qbr2rs ` r rozHoareOptimizer._multigate_optRsc~e$  F ((eW=== t~e$ % % 1 1go F _GeeG KK   .q12IIu-gkrk:I L LD@@@@@@@F NN6 " " " L LnS)//55##Cc7#KKKK L !%u 5gkmm Dur!c2j}t|tr|j}nd}jd|}j|d} fd|D}fd|D}n,#t $rfd|D}fd|D}YnwxYw||||fS)zqGet the target qubits and control qubits if available, as well as their respective z3 variables. rNcXg|]&}j|j|'SrSrrrTrarqrs r rWz6HoareOptimizer._seperate_ctrl_trgt..0RRRRt~b)$+b/$*?@RRRr!cXg|]&}j|j|'SrSrrs r rWz6HoareOptimizer._seperate_ctrl_trgt..rr!c6g|]}j|dSrrrTrars r rWz6HoareOptimizer._seperate_ctrl_trgt..%???"t~b)"-???r!c6g|]}j|dSrrrs r rWz6HoareOptimizer._seperate_ctrl_trgt..rr!)rgrErnum_ctrl_qubitsrnKeyError)rrqr:numctrlctrlqbr<r_r=s`` r rhz"HoareOptimizer._seperate_ctrl_trgtxsw dN + + *GGGHWH%GHH% @RRRRR6RRRGRRRRR6RRRGG @ @ @???????G???????GGG @11sA''&BBcxddl}||_i|_i|_i|_i|_dS)zUReset HoareOptimize internal state, so it can be run multiple times. rN)r%Solverrrrrr)rr%s r _resetzHoareOptimizer._resets<  iikk   r!c||||||jdkr |jD]}||||S)z Args: dag (DAGCircuit): the directed acyclic graph to run on. Returns: DAGCircuit: Transformed DAG. r)rr4rurr.ro)rr1r2s r runzHoareOptimizer.runss   3 9q==z . .##C---- r!)r)N)NN)__name__ __module__ __qualname____doc__rr,r4rArPrcr\rurr{r|rorhrr __classcell__)rs@r rrs3 $" ' ' 'PPP4###J%%%N   ,G,G,G\$=$=$=$=L / / /D2$E$E$E$EL222&          r!rN)rqiskit.transpiler.basepassesrqiskit.circuitrrrqiskit.dagcircuitrqiskit.circuit.libraryr(qiskit.quantum_info.operators.predicatesr qiskit.circuit.exceptionsr %qiskit.circuit.library.standard_gatesr r r qiskit.utilsr _optionalsHAS_Z3require_in_instancerrSr!r rs10;;;;;;@@@@@@@@@@((((((......AAAAAA222222KKKKKKKKKK000000 &KKKKK'KK'&KKKr!