z i6SrSSKJr SSKrSSKrSSKJr SSKJr SSK r SSK J r SSK JrJr SSKJr SS KJr SS KJr SS KJr S S KJrJrJr S SKJr S SKJr Sr "SS5r!g)zG Driver for a synthesis routine which emits optimal XX-based circuits. ) annotationsN) itemgetter)Callable)QuantumCircuit)RXXGateRZXGate) QiskitError)Operator)ONE_QUBIT_EULER_BASIS_GATES)TwoQubitWeylDecomposition)apply_reflection apply_shiftcanonical_xx_circuit)EPSILON) XXPolytopec |Uup#nUupVnSSSS[R"X%- 5S-[R"X6- 5S--[R"XG- 5S--[R"X%- 5S-[R"X6- 5S--[R"XG- 5S------- $)zg Computes the infidelity distance between two points p, q expressed in positive canonical coordinates. r g?)mathcossin)pqa0b0c0a1b1c1s l/home/james-whalen/.local/lib/python3.13/site-packages/qiskit/synthesis/two_qubit/xx_decompose/decomposer.py_average_infidelityr#$s JBBJBB v HHRW  "TXXbg%6!%; ;dhhrw>OST>T Thhrw1$txx'8A'==@QUV@VV W   c\rSrSrSrS S Sjjr\S5rSr\S5r SSjr \SS j5r SSS jjr S r g) XXDecomposer7a A class for optimal decomposition of 2-qubit unitaries into 2-qubit basis gates of ``XX`` type (i.e., each locally equivalent to :math:`CAN(\alpha, 0, 0)` for a possibly varying :math:`alpha`). Args: basis_fidelity: available strengths and fidelity of each. Can be either (1) a dictionary mapping ``XX`` angle values to fidelity at that angle; or (2) a single float ``f``, interpreted as ``{pi: f, pi/2: f/2, pi/3: f/3}``. euler_basis: Basis string provided to :class:`.OneQubitEulerDecomposer` for 1Q synthesis. Defaults to ``"U"``. embodiments: A dictionary mapping interaction strengths alpha to native circuits which embody the gate :math:`CAN(\alpha, 0, 0)`. Strengths are taken so that :math:`\pi/2` represents the class of a full :class:`.CXGate`. backup_optimizer: If supplied, defers synthesis to this callable when :class:`.XXDecomposer` has no efficient decomposition of its own. Useful for special cases involving 2 or 3 applications of :math:`XX(\pi/2)`, in which case standard synthesis methods provide lower 1Q gate count. .. note:: If ``embodiments`` is not passed, or if an entry is missing, it will be populated as needed using the method ``_default_embodiment``. .. automethod:: __call__ NcSSKJn U"[U5UlUbUO0UlX@lXl[[URR55[55nUH/n[UR5S:XdMURUl O# [[ R"S- 5UlUR%5 g)Nr)Optimize1qGatesDecompositionr)?qiskit.transpiler.passes.optimization.optimize_1q_decompositionr)r _decomposer1q embodimentsbackup_optimizerbasis_fidelitynextitervaluesrlenqubits operationgaternppi_check_embodiments)selfr. euler_basisr,r-r)embodiment_circuit instructions r"__init__XXDecomposer.__init__Qs ::UVa:bc*5*A;r 0,"$t'7'7'>'>'@"A>CST-K;%%&!+'11 .   *DI !r$c[S5nURS5 URUSS5 URS5 U$)z If the user does not provide a custom implementation of XX(strength), then this routine defines a default implementation using RZX. rrr )rhrzx)strength xx_circuits r"_default_embodiment XXDecomposer._default_embodimentls< $A&   QxA& Qr$cSSKJn URR5HIup#[ [ U55n[ U5nU"XE5S[ - :dM9[SUSUS35e g)z Checks that `self.embodiments` is populated with legal circuit embodiments: the key-value pair (angle, circuit) satisfies Operator(circuit) approx RXX(angle).to_matrix(). r)average_gate_fidelityr z"RXX embodiment provided for angle z disagrees with RXXGate()N)&qiskit.quantum_info.operators.measuresrGr,itemsr rrr )r9rGangle embodimentactual purporteds r"r8XXDecomposer._check_embodiments|sp Q!%!1!1!7!7!9 Egen-F ,I$V7!g+E!8?WX]W^^_` ":r$c/SQS/pCn/n[R"US/45 [R"U5n[ U5S:Xa%[ U5S:Xa [ S5e[ S5e[R "U5upg[R"UVs/sHoS- PM sn6n U RU5n U[X 5-n X:aXUpCnU RU5(aOSUR5H<up[ U5S:Xd XS::dM[R"XVU -X|/-45 M> GMX#US.$s snf) a Finds the cheapest sequence of `available_strengths` which supports the best approximation to `canonical_coordinate`. Returns a dictionary with keys "cost", "point", and "operations". NOTE: `canonical_coordinate` is a positive canonical coordinate. `strengths` is a dictionary mapping the available strengths to their (infidelity) costs, with the strengths themselves normalized so that pi/2 represents CX = RZX(pi/2). rrr?rzOAttempting to synthesize entangling gate with no controlled gates in basis set.z>Unable to synthesize a 2q unitary with the supplied basis set.r)pointcostsequence) heapqheappushr6arrayr2r heappoprfrom_strengthsnearestr#memberrJ)canonical_coordinateavailable_strengths best_point best_cost best_sequencepriority_queue sequence_costrVxstrength_polytopecandidate_pointcandidate_costrB extra_costs r"_best_decomposition XXDecomposer._best_decompositionsU09#r}  ~2w/!xx(<=>"a'*+q0%i""bcc&+mmN&C #M * 9 98;T8aE8;T U /778LMO*-@$.N)7FX`}  ''(<==(;(A(A(C$x=A%b\)ANN&)CXPZEZ([)D-8$MRR%4+>+>!%!=!= ">"  77w?:IJ/Q',0/J ": eeai&)+VAY CF%/w $C  $ $V D% ! /446 6 ##A'?'?'BC C6  'z+N ruuqy"%%!)RUUQY?"%%!)RUUUVYAWX X%%15beeai@@L((W^(_ _   G8 + .q 1    ,  % %g1vt % D  "%%! -'G!/q 1 &67G&S #A !!,Y !B A|Q  % %&7&?&?&A4 % P   ,  % %g1vt % D  "%%! -  % %l&:&:& > wK s O"86O')r+r-r.r,r5)rRUNN)r.z dict | floatr:strr,z"dict[float, QuantumCircuit] | Noner-z$Callable[..., QuantumCircuit] | None)rsOperator | np.ndarray)F)NTF) rsrr.zdict | float | Nonerboolrrreturnr)__name__ __module__ __qualname____firstlineno____doc__r= staticmethodrDr8rjrwrqr__static_attributes__r$r"r&r&7s6(+:>AE "$""8 " ? "6   *S*SX"$;;6/3  `&`,` `  `  ``r$r&)"r __future__rrWroperatorrtypingrnumpyr6qiskit.circuit.quantumcircuitr%qiskit.circuit.library.standard_gatesrrqiskit.exceptionsr qiskit.quantum_info.operatorsr .qiskit.synthesis.one_qubit.one_qubit_decomposer .qiskit.synthesis.two_qubit.two_qubit_decomposer circuitsrrr utilitiesr polytopesrr#r&rr$r"rsM# 8B)2VTII!&MMr$