z ig-SrSSKJr SSKrSSKrSSKrSSKJr SSK J r SSK J r J r SSKJr SSKJrJr \R((aSS KJr "S S 5rS S jrg)z7Synthesize a single qubit gate to a discrete basis set.) annotationsN)QuantumCircuit)Gate)get_standard_gate_name_mappingIGate)deprecate_func)SolovayKitaevSynthesis GateSequence) DAGCircuitc\rSrSrSrSSSSS.SSjjjr\SSj5r\SS j5r\SS j5r \ SS j5r SS jr SSSjjr SSjr\"SSS S9SSj5rSrg) SolovayKitaevDecomposition!zThe Solovay Kitaev discrete decomposition algorithm. This class is called recursively by the transpiler pass, which is why it is separated. See :class:`~qiskit.transpiler.passes.SolovayKitaev` for more information. N F) basis_gatesdepth check_inputc\Uc!Ub [U5n[X#SU5UlOvUb [S5e[ U[ 5(a&USSS:wa[R "US5UlO-URU5n[R"US5UlX0l X@l X l g)a Args: basic_approximations: A specification of the basic SO(3) approximations in terms of discrete gates. At each iteration this algorithm, the remaining error is approximated with the closest sequence of gates in this set. If a ``str``, this specifies a filename from which to load the approximation. If a ``dict``, then this contains ``{gates: effective_SO3_matrix}`` pairs, e.g. ``{"h t": np.array([[0, 0.7071, -0.7071], [0, -0.7071, -0.7071], [-1, 0, 0]]}``. If a list, this contains the same information as the dict, but already converted to :class:`.GateSequence` objects, which contain the SO(3) matrix and gates. Either this parameter, or ``basis_gates`` and ``depth`` can be specified. basis_gates: A list of discrete (i.e., non-parameterized) standard gates. Defaults to ``["h", "t", "tdg"]``. depth: The number of basis gate combinations to consider in the basis set. This determines how fast (and if) the algorithm converges and should be chosen sufficiently high. check_input: If ``True``, perform intermediate steps checking whether the matrices are of expected form. NzNEither basic_approximations or basis_gates + depth can be specified, not both..npyT) normalize_gatesRustSolovayKitaevSynthesis_sk ValueError isinstancestrfrom_basic_approximationsload_basic_approximationsfrom_sequences_depth _check_input _basis_gates)selfbasic_approximationsrrr sequencess h/home/james-whalen/.local/lib/python3.13/site-packages/qiskit/synthesis/discrete_basis/solovay_kitaev.py__init__#SolovayKitaevDecomposition.__init__(s: '&-k: 1+dKXDH  $`  .449Mbc9RV\9\5OO($!::;OP 5DDYPTU ''cUR$)z3The maximum gate depth of the basic approximations.)rr"s r%r SolovayKitaevDecomposition.depth]s{{r(cUR$)z7Whether to perform runtime checks on the internal data.)r r*s r%r&SolovayKitaevDecomposition.check_inputbs   r(cUR$)zaThe basis gate set of the basic approximations. If ``None``, defaults to ``["h", "t", "tdg"]``. )r!r*s r%r&SolovayKitaevDecomposition.basis_gatesgs    r(cN[U[5(a.USSS:wa%[U5nURR 5$[ R "S[S9 [U[5(aU$[U[5(a#[R"USS9R5n/nUR5Hcup4[U[5(aUupVOUSpe[UR55n[ R""XuU5nUR%U5 Me U$) aKLoad basic approximations. Args: data: If a string, specifies the path to the file from where to load the data. If a dictionary, directly specifies the decompositions as ``{gates: matrix}`` or ``{gates: (matrix, global_phase)}``. There, ``gates`` are the names of the gates producing the SO(3) matrix ``matrix``, e.g. ``{"h t": np.array([[0, 0.7071, -0.7071], [0, -0.7071, -0.7071], [-1, 0, 0]]}`` and the ``global_phase`` can be given to account for a global phase difference between the U(2) matrix of the quantum gates and the stored SO(3) matrix. If not given, the ``global_phase`` will be assumed to be 0. Returns: A list of basic approximations as type ``GateSequence``. Raises: ValueError: If the number of gate combinations and associated matrices does not match. rNraIt is suggested to pass basic_approximations in the binary format produced by SolovayKitaevDecomposition.save_basic_approximations, which is more performant than other formats. Other formats are pending deprecation and will be deprecated in a future release.)categoryT) allow_pickler)rrr rget_gate_sequenceswarningswarnPendingDeprecationWarninglistnploaditemitemstuplersplitr from_gates_and_matrixappend) dataskr$ gatestringmatrix_and_phasematrix global_phasegatessequences r%r4SolovayKitaevDecomposition.load_basic_approximationsos* dC T"#Y&%8+D1B66,,. .  :/   dD ! !K dC 774d388:D ,0JJL (J*E22'7$ '7 $J$4$4$67E#99%VH   X &-9r(cbUSSS:Xa [S5eURRU5 g)aSave the basic approximations into a file. This can then be loaded again via the class initializer (preferred) or via :meth:`load_basic_approximations`:: filename = "approximations.bin" sk.save_basic_approximations(filename) new_sk = SolovayKitaevDecomposition(filename) Args: filename: The filename to store the approximations in. Raises: ValueError: If the filename has a `.npy` extension. The format is not `.npy`, and storing as such can cause errors when loading the file again. rNrzeThe basic approximations are not stored in npy format. Choose a different file extension (e.g. .bin).)rrsave_basic_approximations)r"filenames r%rJ4SolovayKitaevDecomposition.save_basic_approximationss9* BC=F "A  **84r(Tc^URnXE:waX@Rl[U[5(aURR X5nOURR X5nXE:waXPRl[R"USS9nU(aSSK J n U"U5$U$)aRun the algorithm. Args: gate_matrix: The single-qubit gate to approximate. Can either be a :class:`.Gate`, where :meth:`.Gate.to_matrix` returns the matrix, or a :math:`2\times 2` unitary matrix representing the gate. recursion_degree: The recursion degree, called :math:`n` in the paper. return_dag: If ``True`` return a :class:`.DAGCircuit`, else a :class:`.QuantumCircuit`. check_input: If ``True`` check that the input matrix is valid for the decomposition. Overrides the class attribute with the same name, but only for this function call. Returns: A one-qubit circuit approximating the ``gate_matrix`` in the specified discrete basis. T legacy_qubitsr)circuit_to_dag) rr do_checksrr synthesizesynthesize_matrixr_from_circuit_dataqiskit.convertersrP) r" gate_matrixrecursion_degree return_dagrself_check_inputr@circuitrPs r%runSolovayKitaevDecomposition.runs, ++  *!,HH  k4 ( (88&&{ED88--kLD  *!1HH  33DM  8!'* *r(c[U[5(aURRU5nOURR U5n[ R "USS9nU$)z(Query a basic approximation of a matrix.TrN)rrrquery_basic_approximation query_basic_approximation_matrixrrT)r"gater@rZs r%r^4SolovayKitaevDecomposition.query_basic_approximationsN dD ! !8855d;D88<[U[5(aU$UT;aTU$[SU35e)NzUnsupported gate: )rrr)r` name_to_gates r% normalize"normalize_gates..normalizes; dD ! !K < % %-dV455r()r`z Gate | strrjr)rrr7map)rFrzrys @r%rr s013LL6 I% &&r()rFzlist[Gate | str]rjz list[Gate])rq __future__rtypingr4numpyr8qiskit.circuit.quantumcircuitrqiskit.circuit.gaterqiskit.circuit.libraryrrqiskit.utils.deprecationr+qiskit._accelerate.synthesis.discrete_basisr rr TYPE_CHECKINGqiskit.dagcircuitr r rrur(r%rsG>" 8$H3  ,f;f;R'r(