z ip"|SrSSKrSSKrSSKrSSKJr SSKJrJr SSK r SSK J r J r "SS5r"S S 5rg) z8A class for parsing and synthesizing boolean expressionsN)isfile)UnionCallable)BooleanExpressionEvalVisitor%BooleanExpressionArgsCollectorVisitorcx\rSrSrSrSrS\S\4SjrS\ \ \ 4Sjr S \ \\ \ 4S\ 4S jrS\4S jrS rg ) TruthTableaA simple implementation of a truth table for a boolean function The truth table is built from a callable which takes an assignment, which is a tuple of boolean values of a fixed given length (the number of bits of the truth table) and returns a boolean value. For a number of bits at most `EXPLICIT_REP_THRESHOLD` the values of the table are explicitly computed and stored. Otherwise, the values are computed on the fly and stored in a dictionary. funcnum_bitsc*XlX lURUR:*UlUR(aL[R "UR 5Vs/sHo0RU5PM sn[S9Ulg0Ul gs snf)N)dtype) r rEXPLICIT_REP_THRESHOLDexplicit_storagenparrayall_assignmentsboolvaluesimplicit_values)selfr r assignments e/home/james-whalen/.local/lib/python3.13/site-packages/qiskit/synthesis/boolean/boolean_expression.py__init__TruthTable.__init__+ss  $ 1L1L L  ((9=9M9M9OP9O::&9OPDK $&D QsBreturnc[R"SS/URS9Vs/sHn[[ U55PM sn$s snf)zqReturn an ordered list of all assignments, ordered from right to left i.e. 000, 100, 010, 110, 001, 101, 011, 111FT)repeat) itertoolsproductrtuplereversed)rrs rrTruthTable.all_assignments7sH (// dmmT T  (:& 'T   sAkeyc[U[5(a SU5nUR(a*[S[ U555nUR U$UR RXRU55$)Nc3*# UH oS:gv M g7f0N.0bits r )TruthTable.__getitem__..As-##:c3B# UHupU(dMSU-v M g7f)Nr+)r-nr.s rr/r0Cs?vq3dads  ) isinstancestrrsum enumeraterr setdefaultr )rr&s r __getitem__TruthTable.__getitem__?sd c3  --C  ?3??C;;s# #''223 #G Gc^TR(a)SRU4SjTR555$STRS3$)Nc3@># UHnTU(aSOSv M g7f)1r*Nr+)r- assignemntrs rr/%TruthTable.__str__..Js!CYZtJ'S0CYszTruth table on z bits (implicit representation))rjoinrrrs`r__str__TruthTable.__str__HsI  77CGCWCWCY %T]]O3RS Sr<)rr rrrN)__name__ __module__ __qualname____firstlineno____doc__rrintrlistr#rrrr6r:rE__static_attributes__r+r<rr r sk#  &X & & eDk!2 HuS%+%56H4HTTr<r c\rSrSrSrSS\S\SS4SjjrS\\\ 4S\ 4S jr \ S\ 4S j5rSS \4S jjr\S \4Sj5r\S\4Sj5rSrg)BooleanExpressionQzA Boolean ExpressionN expression var_orderrcXl[R"U5Ul[ 5nUR UR5 UR 5Ul[UR5Ul Ubp[UR5[U5- n[U5S:a[SSRU535eURRURS9 SUlg)a Args: expression (str): The logical expression string. name (str): Optional. Instruction gate name. Otherwise part of the expression is going to be used. var_order(list): A list with the order in which variables will be created. (default: by appearance) Nrz"var_order missing the variable(s) z, )r&)rRastparseexpression_astrvisitget_sorted_argsargslenrset ValueErrorrCsortindex truth_table_)rrRrSargs_collector missing_argss rrBooleanExpression.__init__Ts%!ii 3>@T001"224 DII  tyy>C N:L< 1$ #EdiiP\F]E^!_`` IINNyN / r< bitstringcJUR[U5:wa$[S[U5SUR35e[U[5(a SU5n[ 5n[ [URU55Ul URUR5$)zEvaluate the expression on a bitstring. This evaluation is done classically. Args: bitstring: The bitstring for which to evaluate, either as a string of 0 and 1 or a tuple of booleans. Returns: bool: result of the evaluation. z7bitstring length differs from the number of variables (z != c3*# UH oS:gv M g7fr)r+r,s rr/-BooleanExpression.simulate..|s9yyr1) rr[r]r5r6rdictziprZ arg_valuesrXrW)rrd eval_visitors rsimulateBooleanExpression.simulatejs ==C N * N#4 8  i % %9y9I35 "&s499i'@"A !!$"5"566r<c~URc%[URUR5UlUR$)zGenerates the full truth table for the expression Returns: dict: A dictionary mapping boolean assignments to the boolean result )r`r rlrrDs r truth_tableBooleanExpression.truth_tables3    $ *4==$-- HD    r< circuit_typecSSKJnJnJn U"UR5R nUS:XaU"XPR S-5$US:XaU"XPR 5$[S5e)a|Synthesize the logic network into a :class:`~qiskit.circuit.QuantumCircuit`. There are two common types of circuits for a boolean function :math:`f(x)`: 1. **Bit-flip oracles** which compute: .. math:: |x\rangle|y\rangle |-> |x\rangle|f(x)\oplusy\rangle 2. **Phase-flip** oracles which compute: .. math:: |x\rangle |-> (-1)^{f(x)}|x\rangle By default the bit-flip oracle is generated. Args: circuit_type: which type of oracle to create, 'bit' or 'phase' flip oracle. Returns: QuantumCircuit: A circuit implementing the logic network. Raises: ValueError: If ``circuit_type`` is not either 'bit' or 'phase'. r)synth_bit_oracle_from_esopsynth_phase_oracle_from_esop EsopGeneratorr.phasez.'circuit_type' must be either 'bit' or 'phase')boolean_expression_synthrsrtruroesoprr])rrqrsrtrurxs rsynthBooleanExpression.synthsc4  T--.33 5 -dMMA4EF F 7 "/mmD DIJJr<dimacsc[R"S5n[R"S5nURS5Vs/sHo3R5PM nnUVs/sH$o3R S5(aMUS:wdM"UPM& nnUR US5nU(d [ S5e[[UR55upg[U5Vs/sH nSUS -3PM n n/n US S H\nURU5n [U 5S:Xd U S S :waM.U RU S S V s/sHn [U 5PM sn 5 M^ U V Vs/sH?n S RU Vs/sHoS:aSOSU [U5S - 3PM! sn5PMA nn nSRUV s/sH n SU S3PM sn 5n[!UU S9$s snfs snfs snfs sn fs snfs snn fs sn f)zCreate a BooleanExpression from a string in the DIMACS format. Args: dimacs : A string in DIMACS format. Returns: BooleanExpression: A gate for the input string Raises: ValueError: If the string is not formatted according to DIMACS rules zp\s+cnf\s+(\d+)\s+(\d+)z(-?\d+) cr>rz"First line must start with 'p cnf'xrNr*z | ~z & ())rS)recompilesplitstrip startswithmatchr]maprLgroupsrangefindallr[appendrCabsrP)r{ header_regex clause_regexlinelines header_matchnum_vars_i variablesclausesliteralsr~clauselitclause_stringsexprs r from_dimacsBooleanExpression.from_dimacsszz"<= zz*- *0,,t*<=*<$*<=" "T//#*>D42:DU  $))%(3 AB B#|2245 (-h81q1Y 8!"ID#++D1H8}!Xb\S%8 NNHSbM:MqCFM: ; " ! JJV\]V\s'3r29SXaZ3H2IJV\] ^!  zz^<^Qqc8^<= ;;)> 9 ;] =sBGG<GGG":G' G14&G, G17G7,G1filenamec[U5(d[SUS35e[US5nUR5nSSS5 [R W5$!,(df  N#=f)zCreate a BooleanExpression from a file in the DIMACS format. Args: filename: A file in DIMACS format. Returns: BooleanExpression: A gate for the input string Raises: FileNotFoundError: If filename is not found. z The file z does not exists.rN)rFileNotFoundErroropenreadrPr)r dimacs_filer{s rfrom_dimacs_file"BooleanExpression.from_dimacs_files]h#iz9J$KL L (C K %%'F! ,,V44! s A A()rZrRrWrr`)N)r.)rGrHrIrJrKr6rMrrr#rrlpropertyrhrory staticmethodrrrNr+r<rrPrPQs!3!4!4!,7%U "377.!T!!'K#'KR!rs:?  " 2T2TjW5W5r<