z i)hSrSSKJr SSKJrJr SSKJr SSKJ r "SS\5r "SS \5r g ) zPhase Oracle object.) annotations)QuantumCircuitGate)BooleanExpression)deprecate_funcct^\rSrSrSr\"SSSS9S S U4Sjjj5rS Sjr\SS j5r S r U=r $) PhaseOracleaPhase Oracle. The Phase Oracle object constructs circuits for any arbitrary input logical expressions. A logical expression is composed of logical operators `&` (logical `AND`), `|` (logical `OR`), `~` (logical `NOT`), and `^` (logical `XOR`). as well as symbols for literals (variables). For example, `'a & b'`, and `(v0 | ~v1) & (~v2 & v3)` are both valid string representation of boolean logical expressions. A phase oracle for a boolean function `f(x)` performs the following quantum operation: .. math:: |x\rangle \mapsto (-1)^{f(x)}|x\rangle For convenience, this oracle, in addition to parsing arbitrary logical expressions, also supports input strings in the `DIMACS CNF format `__, which is the standard format for specifying SATisfiability (SAT) problem instances in `Conjunctive Normal Form (CNF) `__, which is a conjunction of one or more clauses, where a clause is a disjunction of one or more literals. See :meth:`qiskit.circuit.library.phase_oracle.PhaseOracle.from_dimacs_file`. From 16 variables on, possible performance issues should be expected when using the default synthesizer. z2.2z=Use the class qiskit.circuit.library.PhaseOracleGate instead.z in Qiskit 3.0)sinceadditional_msgremoval_timelinec>[U[5(a [XS9nXlURR SS9n[ TU]URSS9 URUSSS9 g ) z Args: expression: A Python-like boolean expression string or a `BooleanExpression` object. var_order: A list with the order in which variables will be created. (default: by appearance)  var_orderphase circuit_type Phase Oracle)nameTF)inplacecopyN) isinstancestrrboolean_expressionsynthsuper__init__ num_qubitscompose)self expressionroracle __class__s ]/home/james-whalen/.local/lib/python3.13/site-packages/qiskit/circuit/library/phase_oracle.pyrPhaseOracle.__init__5se" j# & &*:KJ",((..G.D **@ VT 6cDURRUSSS25$)a,Evaluate the oracle on a bitstring. This evaluation is done classically without any quantum circuit. Args: bitstring: The bitstring for which to evaluate. The input bitstring is expected to be in little-endian order. Returns: True if the bitstring is a good state, False otherwise. N)rsimulate)r bitstrings r$evaluate_bitstringPhaseOracle.evaluate_bitstringOs#&&// $B$@@r&c>[R"U5nU"U5$)aCreate a PhaseOracle from the string in the DIMACS format. It is possible to build a PhaseOracle from a file in `DIMACS CNF format `__, which is the standard format for specifying SATisfiability (SAT) problem instances in `Conjunctive Normal Form (CNF) `__, which is a conjunction of one or more clauses, where a clause is a disjunction of one or more literals. The following is an example of a CNF expressed in the DIMACS format: .. code:: text c DIMACS CNF file with 3 satisfying assignments: 1 -2 3, -1 -2 -3, 1 2 -3. p cnf 3 5 -1 -2 -3 0 1 -2 3 0 1 2 -3 0 1 -2 -3 0 -1 2 3 0 The first line, following the `c` character, is a comment. The second line specifies that the CNF is over three boolean variables --- let us call them :math:`x_1, x_2, x_3`, and contains five clauses. The five clauses, listed afterwards, are implicitly joined by the logical `AND` operator, :math:`\land`, while the variables in each clause, represented by their indices, are implicitly disjoined by the logical `OR` operator, :math:`lor`. The :math:`-` symbol preceding a boolean variable index corresponds to the logical `NOT` operator, :math:`lnot`. Character `0` (zero) marks the end of each clause. Essentially, the code above corresponds to the following CNF: :math:`(\lnot x_1 \lor \lnot x_2 \lor \lnot x_3) \land (x_1 \lor \lnot x_2 \lor x_3) \land (x_1 \lor x_2 \lor \lnot x_3) \land (x_1 \lor \lnot x_2 \lor \lnot x_3) \land (\lnot x_1 \lor x_2 \lor x_3)`. Args: filename: A file in DIMACS format. Returns: PhaseOracle: A quantum circuit with a phase oracle. rfrom_dimacs_fileclsfilenameexprs r$r/PhaseOracle.from_dimacs_file\Z!11(;4yr&)r)N)r!str | BooleanExpressionrlist[str] | NonereturnNone)r*rr8bool)r2r) __name__ __module__ __qualname____firstlineno____doc__rrr+ classmethodr/__static_attributes__ __classcell__r#s@r$r r se:V('+7+7$7  7  7* A--r&r c`^\rSrSrSrSSU4SjjjrSr\S Sj5rSr U=r $) PhaseOracleGateaImplements a phase oracle. The Phase Oracle Gate object constructs circuits for any arbitrary input logical expressions. A logical expression is composed of logical operators `&` (logical `AND`), `|` (logical `OR`), `~` (logical `NOT`), and `^` (logical `XOR`). as well as symbols for literals (variables). For example, `'a & b'`, and `(v0 | ~v1) & (~v2 & v3)` are both valid string representation of boolean logical expressions. A phase oracle for a boolean function `f(x)` performs the following quantum operation: .. math:: |x\rangle \mapsto (-1)^{f(x)}|x\rangle For convenience, this oracle, in addition to parsing arbitrary logical expressions, also supports input strings in the `DIMACS CNF format `__, which is the standard format for specifying SATisfiability (SAT) problem instances in `Conjunctive Normal Form (CNF) `__, which is a conjunction of one or more clauses, where a clause is a disjunction of one or more literals. See :meth:`qiskit.circuit.library.phase_oracle.PhaseOracleGate.from_dimacs_file`. From 16 variables on, possible performance issues should be expected when using the default synthesizer. c>Uc1[U[5(a[U5S:aUSSS-OUnOSn[U[5(a [XS9nXl[ TU]SURR/US9 g)a Args: expression: A Python-like boolean expression string or a `BooleanExpression` object. var_order: A list with the order in which variables will be created. (default: by appearance) label: A label for the gate to display in visualizations. Per default, the label is set to display the textual represntation of the boolean expression (truncated if needed) Nz...zBoolean Expressionrr)rrparamslabel)rrlenrrrrnum_bits)r r!rrJr#s r$rPhaseOracleGate.__init__s =*c**58_r5ICR50z, j# & &*:KJ", ..77  r&c@URRSS9Ulg)z'Defined by the synthesized phase oraclerrN)rr definition)r s r$_definePhaseOracleGate._defines1177W7Mr&c>[R"U5nU"U5$)aCreate a PhaseOracle from the string in the DIMACS format. It is possible to build a PhaseOracle from a file in `DIMACS CNF format `__, which is the standard format for specifying SATisfiability (SAT) problem instances in `Conjunctive Normal Form (CNF) `__, which is a conjunction of one or more clauses, where a clause is a disjunction of one or more literals. The following is an example of a CNF expressed in the DIMACS format: .. code:: text c DIMACS CNF file with 3 satisfying assignments: 1 -2 3, -1 -2 -3, 1 2 -3. p cnf 3 5 -1 -2 -3 0 1 -2 3 0 1 2 -3 0 1 -2 -3 0 -1 2 3 0 The first line, following the `c` character, is a comment. The second line specifies that the CNF is over three boolean variables --- let us call them :math:`x_1, x_2, x_3`, and contains five clauses. The five clauses, listed afterwards, are implicitly joined by the logical `AND` operator, :math:`\land`, while the variables in each clause, represented by their indices, are implicitly disjoined by the logical `OR` operator, :math:`\lor`. The :math:`-` symbol preceding a boolean variable index corresponds to the logical `NOT` operator, :math:`\lnot`. Character `0` (zero) marks the end of each clause. Essentially, the code above corresponds to the following CNF: :math:`(\lnot x_1 \lor \lnot x_2 \lor \lnot x_3) \land (x_1 \lor \lnot x_2 \lor x_3) \land (x_1 \lor x_2 \lor \lnot x_3) \land (x_1 \lor \lnot x_2 \lor \lnot x_3) \land (\lnot x_1 \lor x_2 \lor x_3)`. Args: filename: A file in DIMACS format. Returns: PhaseOracleGate: A quantum circuit with a phase oracle. r.r0s r$r/ PhaseOracleGate.from_dimacs_filer5r&)rrO)NN)r!r6rr7rJz str | Noner8r9)r2rr8rE) r;r<r=r>r?rrPr@r/rArBrCs@r$rErEs[@'+  + $      >N--r&rEN) r? __future__rqiskit.circuitrr+qiskit.synthesis.boolean.boolean_expressionrqiskit.utils.deprecationrr rEr&r$rYs3"/I3s.slodor&