pauli_pow_combination: pow_pauli_combination

In henry090/Cirq: Interface to 'Cirq'

Description

Computes non-negative integer power of single-qubit Pauli combination.

Usage

pauli_pow_combination(ai, ax, ay, az, exponent)

Arguments

ai	ai
ax	ax
ay	ay
az	az
exponent	exponent

Value

Returns scalar coefficients bi, bx, by, bz such that bi I + bx X + by Y + bz Z = (ai I + ax X + ay Y + az Z)^exponent Correctness of the formulas below follows from the binomial expansion and the fact that for any real or complex vector (ax, ay, az) and any non-negative integer k: [ax X + ay Y + az Z]^(2k) = (ax^2 + ay^2 + az^2)^k I

See Also

Other Pauli and Clifford groups: clifford_single_qubit_gate(), clifford_state(), clifford_tableau(), pauli_base_dense_string(), pauli_basis(), pauli_dense_string(), pauli_gate_like(), pauli_interaction_gate(), pauli_mutable_dense_string(), pauli_string_gate_operation(), pauli_string(), pauli_sum_like(), pauli_sum(), pauli_transform(), pauli()

henry090/Cirq documentation built on June 13, 2020, 1:28 a.m.