cirq-core 1.2.0.dev20230630133613__py3-none-any.whl → 1.2.0.dev20230705194247__py3-none-any.whl

cirq/_version.py

@@ -1 +1 @@
-__version__ = "1.2.0.dev20230630133613"
+__version__ = "1.2.0.dev20230705194247"

cirq/sim/state_vector_simulator.py

@@ -20,6 +20,7 @@ import numpy as np
 
 from cirq import _compat, ops, value, qis
 from cirq.sim import simulator, state_vector, simulator_base
+from cirq.protocols import qid_shape
 
 if TYPE_CHECKING:
     import cirq
@@ -31,7 +32,7 @@ TStateVectorStepResult = TypeVar('TStateVectorStepResult', bound='StateVectorSte
 class SimulatesIntermediateStateVector(
     Generic[TStateVectorStepResult],
     simulator_base.SimulatorBase[
-        TStateVectorStepResult, 'cirq.StateVectorTrialResult', 'cirq.StateVectorSimulationState',
+        TStateVectorStepResult, 'cirq.StateVectorTrialResult', 'cirq.StateVectorSimulationState'
     ],
     simulator.SimulatesAmplitudes,
     metaclass=abc.ABCMeta,
@@ -172,7 +173,7 @@ class StateVectorTrialResult(
             size = np.prod(shape, dtype=np.int64)
             final = final.reshape(size)
             if len([1 for e in final if abs(e) > 0.001]) < 16:
-                state_vector = qis.dirac_notation(final, 3)
+                state_vector = qis.dirac_notation(final, 3, qid_shape(substate.qubits))
             else:
                 state_vector = str(final)
             label = f'qubits: {substate.qubits}' if substate.qubits else 'phase:'

cirq/sim/state_vector_simulator_test.py

@@ -159,6 +159,28 @@ def test_str_big():
     assert 'output vector: [0.03125+0.j 0.03125+0.j 0.03125+0.j ..' in str(result)
 
 
+def test_str_qudit():
+    qutrit = cirq.LineQid(0, dimension=3)
+    final_simulator_state = cirq.StateVectorSimulationState(
+        prng=np.random.RandomState(0),
+        qubits=[qutrit],
+        initial_state=np.array([0, 0, 1]),
+        dtype=np.complex64,
+    )
+    result = cirq.StateVectorTrialResult(cirq.ParamResolver(), {}, final_simulator_state)
+    assert "|2⟩" in str(result)
+
+    ququart = cirq.LineQid(0, dimension=4)
+    final_simulator_state = cirq.StateVectorSimulationState(
+        prng=np.random.RandomState(0),
+        qubits=[ququart],
+        initial_state=np.array([0, 1, 0, 0]),
+        dtype=np.complex64,
+    )
+    result = cirq.StateVectorTrialResult(cirq.ParamResolver(), {}, final_simulator_state)
+    assert "|1⟩" in str(result)
+
+
 def test_pretty_print():
     final_simulator_state = cirq.StateVectorSimulationState(
         available_buffer=np.array([1]),

cirq/transformers/__init__.py

@@ -37,6 +37,7 @@ from cirq.transformers.analytical_decompositions import (
     two_qubit_matrix_to_diagonal_and_cz_operations,
     two_qubit_matrix_to_ion_operations,
     two_qubit_matrix_to_sqrt_iswap_operations,
+    unitary_to_pauli_string,
 )
 
 from cirq.transformers.heuristic_decompositions import (

cirq/transformers/analytical_decompositions/__init__.py

@@ -71,3 +71,7 @@ from cirq.transformers.analytical_decompositions.two_qubit_state_preparation imp
 from cirq.transformers.analytical_decompositions.single_to_two_qubit_isometry import (
     two_qubit_matrix_to_cz_isometry,
 )
+
+from cirq.transformers.analytical_decompositions.pauli_string_decomposition import (
+    unitary_to_pauli_string,
+)

cirq/transformers/analytical_decompositions/pauli_string_decomposition.py

@@ -0,0 +1,130 @@
+# Copyright 2023 The Cirq Developers
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     https://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+
+from typing import Optional, Tuple, cast
+
+import numpy as np
+import numpy.typing as npt
+
+from cirq.ops import DensePauliString
+from cirq import protocols
+
+
+def _argmax(V: npt.NDArray) -> Tuple[int, float]:
+    """Returns a tuple (index of max number, max number)."""
+    V = (V * V.conj()).real
+    idx_max = np.argmax(V)
+    V[idx_max] = 0
+    return cast(int, idx_max), np.max(V)
+
+
+def _validate_decomposition(decomposition: DensePauliString, U: npt.NDArray, eps: float) -> bool:
+    """Returns whether the max absolute value of the elementwise difference is less than eps."""
+    got = protocols.unitary(decomposition)
+    return np.abs(got - U).max() < eps
+
+
+def _fast_walsh_hadamard_transform(V: npt.NDArray) -> None:
+    """Fast Walsh–Hadamard Transform of an array."""
+    m = len(V)
+    n = m.bit_length() - 1
+    for h in [2**i for i in range(n)]:
+        for i in range(0, m, h * 2):
+            for j in range(i, i + h):
+                x = V[j]
+                y = V[j + h]
+                V[j] = x + y
+                V[j + h] = x - y
+
+
+def _conjugate_with_hadamard(U: npt.NDArray) -> npt.NDArray:
+    """Applies HcUH in O(n4^n) instead of O(8^n)."""
+
+    U = np.copy(U.T)
+    for i in range(U.shape[1]):
+        _fast_walsh_hadamard_transform(U[:, i])
+    U = U.T
+    for i in range(U.shape[1]):
+        _fast_walsh_hadamard_transform(U[:, i])
+    return U
+
+
+def unitary_to_pauli_string(U: npt.NDArray, eps: float = 1e-15) -> Optional[DensePauliString]:
+    """Attempts to find a pauli string (with possible phase) equivalent to U up to eps.
+
+        Based on this answer https://shorturl.at/aA079.
+        Let x_mask be the index of the maximum number of the first column of U
+        and z_mask be the index of the maximum number of the first column of H†UH
+        each of these indicies is n-bits long where U is 2^n x 2^n.
+
+        These two indices/masks encode in binary the indices of the qubits that
+        have I, X, Y, Z acting on them as follows:
+        x_mask[i] == 1 and z_mask[i] == 0: X acts on the ith qubit
+        x_mask[i] == 0 and z_mask[i] == 1: Z acts on the ith qubit
+        x_mask[i] == 1 and z_mask[i] == 1: Y acts on the ith qubit
+        x_mask[i] == 0 and z_mask[i] == 0: I acts on the ith qubit
+
+    Args:
+        U: A square array whose dimension is a power of 2.
+        eps: numbers smaller than `eps` are considered zero.
+
+    Returns:
+        A DensePauliString of None.
+
+    Raises:
+        ValueError: if U is not square with a power of 2 dimension.
+    """
+
+    if len(U.shape) != 2 or U.shape[0] != U.shape[1]:
+        raise ValueError(f'Input has a non-square shape {U}')
+    n = U.shape[0].bit_length() - 1
+    if U.shape[0] != 2**n:
+        raise ValueError(f'Input dimension {U.shape[0]} isn\'t a power of 2')
+
+    x_msk, second_largest = _argmax(U[:, 0])
+    if second_largest > eps:
+        return None
+    U_z = _conjugate_with_hadamard(U)
+    z_msk, second_largest = _argmax(U_z[:, 0])
+    if second_largest > eps:
+        return None
+
+    def select(i):
+        """Returns the gate that acts on the ith qubit."""
+        has_x = (x_msk >> i) & 1
+        has_z = (z_msk >> i) & 1
+        # The mapping is:
+        #   - has_x and not has_z => X
+        #   - not has_x and has_z => Z
+        #   - has_x and has_z => Y
+        #   - not has_x and not has_z => I
+        gate_table = ['IX', 'ZY']
+        return gate_table[has_z][has_x]
+
+    decomposition = DensePauliString(''.join(select(i) for i in reversed(range(n))))
+
+    guess = protocols.unitary(decomposition)
+    if np.abs(guess[x_msk, 0]) < eps:
+        return None
+    phase = U[x_msk, 0] / guess[x_msk, 0]
+    phase /= np.abs(phase)  # Make sure |phase| = 1 to avoid rounding issues.
+
+    decomposition = DensePauliString(
+        ''.join(select(i) for i in reversed(range(n))), coefficient=phase
+    )
+
+    if not _validate_decomposition(decomposition, U, eps):
+        return None
+
+    return decomposition

cirq/transformers/analytical_decompositions/pauli_string_decomposition_test.py

@@ -0,0 +1,58 @@
+# Copyright 2023 The Cirq Developers
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     https://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+
+from typing import cast
+import itertools
+import cmath
+import pytest
+
+import numpy as np
+
+from cirq.ops import DensePauliString, T
+from cirq import protocols
+from cirq.transformers.analytical_decompositions import unitary_to_pauli_string
+
+
+@pytest.mark.parametrize('phase', [cmath.exp(i * 2 * cmath.pi / 5 * 1j) for i in range(5)])
+@pytest.mark.parametrize(
+    'pauli_string', [''.join(p) for p in itertools.product(['', 'I', 'X', 'Y', 'Z'], repeat=4)]
+)
+def test_unitary_to_pauli_string(pauli_string: str, phase: complex):
+    want = DensePauliString(pauli_string, coefficient=phase)
+    got = unitary_to_pauli_string(protocols.unitary(want))
+    assert got is not None
+    assert np.all(want.pauli_mask == got.pauli_mask)
+    assert np.isclose(cast(np.complex128, want.coefficient), cast(np.complex128, got.coefficient))
+
+
+def test_unitary_to_pauli_string_non_pauli_input():
+    got = unitary_to_pauli_string(protocols.unitary(T))
+    assert got is None
+
+    got = unitary_to_pauli_string(np.array([[1, 0], [1, 0]]))
+    assert got is None
+
+    got = unitary_to_pauli_string(np.array([[1, 1], [0, 2]]))
+    assert got is None
+
+    got = unitary_to_pauli_string(np.array([[0, 0.5], [1, -1]]), eps=1.1)
+    assert got is None
+
+
+def test_invalid_input():
+    with pytest.raises(ValueError, match='Input has a non-square shape.*'):
+        _ = unitary_to_pauli_string(np.zeros((2, 3)))
+
+    with pytest.raises(ValueError, match='Input dimension [0-9]* isn\'t a power of 2'):
+        _ = unitary_to_pauli_string(np.zeros((3, 3)))

{cirq_core-1.2.0.dev20230630133613.dist-info → cirq_core-1.2.0.dev20230705194247.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: cirq-core
-Version: 1.2.0.dev20230630133613
+Version: 1.2.0.dev20230705194247
 Summary: A framework for creating, editing, and invoking Noisy Intermediate Scale Quantum (NISQ) circuits.
 Home-page: http://github.com/quantumlib/cirq
 Author: The Cirq Developers

{cirq_core-1.2.0.dev20230630133613.dist-info → cirq_core-1.2.0.dev20230705194247.dist-info}/RECORD

@@ -4,7 +4,7 @@ cirq/_compat_test.py,sha256=yaTzjrXRFRHRZ5mom2NFrGP-1SeV7AlnH4fMmL5Jeps,33945
 cirq/_doc.py,sha256=yDyWUD_2JDS0gShfGRb-rdqRt9-WeL7DhkqX7np0Nko,2879
 cirq/_import.py,sha256=p9gMHJscbtDDkfHOaulvd3Aer0pwUF5AXpL89XR8dNw,8402
 cirq/_import_test.py,sha256=6K_v0riZJXOXUphHNkGA8MY-JcmGlezFaGmvrNhm3OQ,1015
-cirq/_version.py,sha256=H_qyFa81Pjb3TyM5w-ZYVt0mu_CTA0e9Q0NDIa3qVXY,40
+cirq/_version.py,sha256=7EpdLIjdUQ2IgIxJTP_baIEvsey7f3wXAogT8XmQInY,40
 cirq/_version_test.py,sha256=ZM9GLAiU02rzyJQ_HOT2o_tZixJ0lMXs4tCkOareqTA,133
 cirq/conftest.py,sha256=mHCDs5--u17oLFDAfIlkTS4TRGSc35eLnZ2CXuIuB7I,1175
 cirq/json_resolver_cache.py,sha256=JJiO1dhHsEqYClUv68eg-hiOzbb_C1QiQ-BCcvoe4Ck,13067
@@ -897,8 +897,8 @@ cirq/sim/sparse_simulator_test.py,sha256=3EAeCHUQeKllAAtdw14X592zBsGQY_vwfIYK-gE
 cirq/sim/state_vector.py,sha256=N6N9EELlW66UaLTBaq62ms0XkfIK7CzN9SBM7t52dXo,13428
 cirq/sim/state_vector_simulation_state.py,sha256=ZTmRdf9J--L3hISroWmW9vgqPvj13s99I2axIgV5x7o,17631
 cirq/sim/state_vector_simulation_state_test.py,sha256=UtGMIurlV6N74nX7qoVnGoRhwF35-ghDEIP7Mj5AXmI,9841
-cirq/sim/state_vector_simulator.py,sha256=d_6s5cBgUVCSCgx6yxzKYlbRp-e9BBfFmlZetN8MIS8,7465
-cirq/sim/state_vector_simulator_test.py,sha256=Xl6v_WghJGZtEEK7EHw_1QGoXCVbnvKhVu1K8OJ5D24,7098
+cirq/sim/state_vector_simulator.py,sha256=L2S0xyUGqRcVgYdzYef0gVREVZVIDcCXPclVbIJEpPE,7529
+cirq/sim/state_vector_simulator_test.py,sha256=wJq1OZRzKokeM9cJyaJXi6wHH2qi97h0HmJlYOEBDzU,7864
 cirq/sim/state_vector_test.py,sha256=OjhAL2tWqJWstHV8RvJYQVqg95zm0PcS9nQKrLOhMmQ,16934
 cirq/sim/clifford/__init__.py,sha256=lD7l6JuE5n0xwvOYNYH-giCH3qAEVH1SUwDrZM1jKKY,636
 cirq/sim/clifford/clifford_simulator.py,sha256=6M69sv6IbtJTOk5ZE8CGWiILf6Ee2sCEALiZaw9NmvQ,9735
@@ -999,7 +999,7 @@ cirq/testing/test_data/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3
 cirq/testing/test_data/test_module_missing_json_test_data/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 cirq/testing/test_data/test_module_missing_testspec/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 cirq/testing/test_data/test_module_missing_testspec/json_test_data/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-cirq/transformers/__init__.py,sha256=fMY29-7n94Wg8oaoRTrUyfMLiqd2QUsdZyxQ7Cw4aDM,3714
+cirq/transformers/__init__.py,sha256=FEYuMxJSn1mW_616HKdb5Ruf_JDNFIjZKPtHTNlJdQ0,3743
 cirq/transformers/align.py,sha256=B4DuX84DWd4tLfMH21JviMZSOFYu7KCOMSEMALYsQpw,2727
 cirq/transformers/align_test.py,sha256=M4etT2cgESv1RdkKASguiGxEuqY7kmI1IswjSi-1jjY,7174
 cirq/transformers/drop_empty_moments.py,sha256=Rtn_BrpwkLXyZBdLzwdnsnEGWTdYuf1xOPakzbpv7-w,1517
@@ -1028,13 +1028,15 @@ cirq/transformers/transformer_api.py,sha256=beDdouAulWeg4SQRwAjgc5H1jrKD0maYY32X
 cirq/transformers/transformer_api_test.py,sha256=f-Vup0VCUvTqJKm5kWHf6xet7sFTerLMGYzJHy8Rc5s,13045
 cirq/transformers/transformer_primitives.py,sha256=0QKiY2pEBzIfGsE4y5fGSfJlehOvHzIVaj10eNyHt8A,31574
 cirq/transformers/transformer_primitives_test.py,sha256=pJhCN28Tev7F04waYRtTlgJEY8fqtBcYJZDPSPUAWLw,41319
-cirq/transformers/analytical_decompositions/__init__.py,sha256=irRBgRfMlIxOoZ6fPM3PM1rKrnLXDYJcp-HfpUlMGe0,2566
+cirq/transformers/analytical_decompositions/__init__.py,sha256=jUSQkbrFMGRi3ez_TXw8c487dJ_cTF-157JAQcIxUg4,2683
 cirq/transformers/analytical_decompositions/clifford_decomposition.py,sha256=DsuuP91pm2dX0CO4rWwmJAJyAfuXMcA1UJK0g8krp7k,6726
 cirq/transformers/analytical_decompositions/clifford_decomposition_test.py,sha256=AAZh_9vEb5f2E_EItPZTlMRNdv0d47AwqTn4BytX0UI,7102
 cirq/transformers/analytical_decompositions/controlled_gate_decomposition.py,sha256=P-ge3093ayMAEiIf-X_Yv_UuEWkVBEEvJUKobhlXVuA,8554
 cirq/transformers/analytical_decompositions/controlled_gate_decomposition_test.py,sha256=Pc1vNvRxcYJEERASHbCqPX1bqImGd7FzWnQcUcIo_YU,4950
 cirq/transformers/analytical_decompositions/cphase_to_fsim.py,sha256=RDg0wzYa_YXBJepCgloD_OIwTOwNco98dqGoe0UsnhI,9108
 cirq/transformers/analytical_decompositions/cphase_to_fsim_test.py,sha256=bwZa0BDclAd1sX3bD-GdNF2MO5DtH7mw2YLppEK0LG0,5568
+cirq/transformers/analytical_decompositions/pauli_string_decomposition.py,sha256=bU9IoY0igVZTmF_wsTdTxAfqPKWyqZ14Gt2AJoK5D_4,4524
+cirq/transformers/analytical_decompositions/pauli_string_decomposition_test.py,sha256=qpFODpCJrE9piYLWR1FzweTn3v80EvLCV-PP2fbHcoE,2112
 cirq/transformers/analytical_decompositions/quantum_shannon_decomposition.py,sha256=-ovbhXHeuGcqu1XQd6ZNV3yDrO3JeAEoA_6z5IlPXxE,8326
 cirq/transformers/analytical_decompositions/quantum_shannon_decomposition_test.py,sha256=Q_CGIfaelZEvmTtmkbaPdBosGwqQQjjypAs2DNMCT54,4158
 cirq/transformers/analytical_decompositions/single_qubit_decompositions.py,sha256=iAPdMwHKM1B3mJtQWH-iNjR-VkzhkUDFC23f8kjXY6M,8436
@@ -1136,8 +1138,8 @@ cirq/work/sampler.py,sha256=JVv1vvfa6EgFiR3UeDk44U186dCrioH2NZXueCgsb9w,19828
 cirq/work/sampler_test.py,sha256=zo1Hj6sn6fLs_WZMxYRApBqgBsldmptn74NL0jhNukc,12325
 cirq/work/zeros_sampler.py,sha256=D3hbNZC-jXKuNAWg2OUiUuT8pmDV_WFnEfMank6In4o,2357
 cirq/work/zeros_sampler_test.py,sha256=JIkpBBFPJe5Ba4142vzogyWyboG1Q1ZAm0UVGgOoZn8,3279
-cirq_core-1.2.0.dev20230630133613.dist-info/LICENSE,sha256=tAkwu8-AdEyGxGoSvJ2gVmQdcicWw3j1ZZueVV74M-E,11357
-cirq_core-1.2.0.dev20230630133613.dist-info/METADATA,sha256=7eaSnkJXjd5mFtGDtcXBV5AR1-YcoBzMG6mSzI242rE,2095
-cirq_core-1.2.0.dev20230630133613.dist-info/WHEEL,sha256=pkctZYzUS4AYVn6dJ-7367OJZivF2e8RA9b_ZBjif18,92
-cirq_core-1.2.0.dev20230630133613.dist-info/top_level.txt,sha256=Sz9iOxHU0IEMLSFGwiwOCaN2e9K-jFbBbtpPN1hB73g,5
-cirq_core-1.2.0.dev20230630133613.dist-info/RECORD,,
+cirq_core-1.2.0.dev20230705194247.dist-info/LICENSE,sha256=tAkwu8-AdEyGxGoSvJ2gVmQdcicWw3j1ZZueVV74M-E,11357
+cirq_core-1.2.0.dev20230705194247.dist-info/METADATA,sha256=lJ79DZSV9U2TMMwvinF-uDKEfXlCVj0qxRBW6QbiPB8,2095
+cirq_core-1.2.0.dev20230705194247.dist-info/WHEEL,sha256=pkctZYzUS4AYVn6dJ-7367OJZivF2e8RA9b_ZBjif18,92
+cirq_core-1.2.0.dev20230705194247.dist-info/top_level.txt,sha256=Sz9iOxHU0IEMLSFGwiwOCaN2e9K-jFbBbtpPN1hB73g,5
+cirq_core-1.2.0.dev20230705194247.dist-info/RECORD,,