File size: 17,689 Bytes
b7d9967 |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 |
# This code is part of Qiskit.
#
# (C) Copyright IBM 2020, 2023.
#
# This code is licensed under the Apache License, Version 2.0. You may
# obtain a copy of this license in the LICENSE.txt file in the root directory
# of this source tree or at http://www.apache.org/licenses/LICENSE-2.0.
#
# Any modifications or derivative works of this code must retain this
# copyright notice, and modified files need to carry a notice indicating
# that they have been altered from the originals.
"""StateFn Class"""
from typing import Callable, Dict, List, Optional, Set, Tuple, Union
import numpy as np
from qiskit import QuantumCircuit
from qiskit.circuit import Instruction, ParameterExpression
from qiskit.opflow.operator_base import OperatorBase
from qiskit.quantum_info import Statevector
from qiskit.result import Result
from qiskit.utils.deprecation import deprecate_func
class StateFn(OperatorBase):
r"""
Deprecated: A class for representing state functions and measurements.
State functions are defined to be complex functions over a single binary string (as
compared to an operator, which is defined as a function over two binary strings, or a
function taking a binary function to another binary function). This function may be
called by the eval() method.
Measurements are defined to be functionals over StateFns, taking them to real values.
Generally, this real value is interpreted to represent the probability of some classical
state (binary string) being observed from a probabilistic or quantum system represented
by a StateFn. This leads to the equivalent definition, which is that a measurement m is
a function over binary strings producing StateFns, such that the probability of measuring
a given binary string b from a system with StateFn f is equal to the inner
product between f and m(b).
NOTE: State functions here are not restricted to wave functions, as there is
no requirement of normalization.
"""
def __init_subclass__(cls):
cls.__new__ = lambda cls, *args, **kwargs: super().__new__(cls)
@staticmethod
# pylint: disable=unused-argument
def __new__(
cls,
primitive: Union[
str,
dict,
Result,
list,
np.ndarray,
Statevector,
QuantumCircuit,
Instruction,
OperatorBase,
] = None,
coeff: Union[complex, ParameterExpression] = 1.0,
is_measurement: bool = False,
) -> "StateFn":
"""A factory method to produce the correct type of StateFn subclass
based on the primitive passed in. Primitive, coeff, and is_measurement arguments
are passed into subclass's init() as-is automatically by new().
Args:
primitive: The primitive which defines the behavior of the underlying State function.
coeff: A coefficient by which the state function is multiplied.
is_measurement: Whether the StateFn is a measurement operator
Returns:
The appropriate StateFn subclass for ``primitive``.
Raises:
TypeError: Unsupported primitive type passed.
"""
# Prevents infinite recursion when subclasses are created
if cls.__name__ != StateFn.__name__:
return super().__new__(cls)
# pylint: disable=cyclic-import
if isinstance(primitive, (str, dict, Result)):
from .dict_state_fn import DictStateFn
return DictStateFn.__new__(DictStateFn)
if isinstance(primitive, (list, np.ndarray, Statevector)):
from .vector_state_fn import VectorStateFn
return VectorStateFn.__new__(VectorStateFn)
if isinstance(primitive, (QuantumCircuit, Instruction)):
from .circuit_state_fn import CircuitStateFn
return CircuitStateFn.__new__(CircuitStateFn)
if isinstance(primitive, OperatorBase):
from .operator_state_fn import OperatorStateFn
return OperatorStateFn.__new__(OperatorStateFn)
raise TypeError(
"Unsupported primitive type {} passed into StateFn "
"factory constructor".format(type(primitive))
)
# TODO allow normalization somehow?
@deprecate_func(
since="0.24.0",
additional_msg="For code migration guidelines, visit https://qisk.it/opflow_migration.",
)
def __init__(
self,
primitive: Union[
str,
dict,
Result,
list,
np.ndarray,
Statevector,
QuantumCircuit,
Instruction,
OperatorBase,
] = None,
coeff: Union[complex, ParameterExpression] = 1.0,
is_measurement: bool = False,
) -> None:
"""
Args:
primitive: The primitive which defines the behavior of the underlying State function.
coeff: A coefficient by which the state function is multiplied.
is_measurement: Whether the StateFn is a measurement operator
"""
super().__init__()
self._primitive = primitive
self._is_measurement = is_measurement
self._coeff = coeff
@property
def primitive(self):
"""The primitive which defines the behavior of the underlying State function."""
return self._primitive
@property
def coeff(self) -> Union[complex, ParameterExpression]:
"""A coefficient by which the state function is multiplied."""
return self._coeff
@property
def is_measurement(self) -> bool:
"""Whether the StateFn object is a measurement Operator."""
return self._is_measurement
@property
def settings(self) -> Dict:
"""Return settings."""
return {
"primitive": self._primitive,
"coeff": self._coeff,
"is_measurement": self._is_measurement,
}
def primitive_strings(self) -> Set[str]:
raise NotImplementedError
@property
def num_qubits(self) -> int:
raise NotImplementedError
def add(self, other: OperatorBase) -> OperatorBase:
raise NotImplementedError
def adjoint(self) -> OperatorBase:
raise NotImplementedError
def _expand_dim(self, num_qubits: int) -> "StateFn":
raise NotImplementedError
def permute(self, permutation: List[int]) -> OperatorBase:
"""Permute the qubits of the state function.
Args:
permutation: A list defining where each qubit should be permuted. The qubit at index
j of the circuit should be permuted to position permutation[j].
Returns:
A new StateFn containing the permuted primitive.
"""
raise NotImplementedError
def equals(self, other: OperatorBase) -> bool:
if not isinstance(other, type(self)) or not self.coeff == other.coeff:
return False
return self.primitive == other.primitive
# Will return NotImplementedError if not supported
def mul(self, scalar: Union[complex, ParameterExpression]) -> OperatorBase:
if not isinstance(scalar, (int, float, complex, ParameterExpression)):
raise ValueError(
"Operators can only be scalar multiplied by float or complex, not "
"{} of type {}.".format(scalar, type(scalar))
)
if hasattr(self, "from_operator"):
return self.__class__(
self.primitive,
coeff=self.coeff * scalar,
is_measurement=self.is_measurement,
from_operator=self.from_operator,
)
else:
return self.__class__(
self.primitive, coeff=self.coeff * scalar, is_measurement=self.is_measurement
)
def tensor(self, other: OperatorBase) -> OperatorBase:
r"""
Return tensor product between self and other, overloaded by ``^``.
Note: You must be conscious of Qiskit's big-endian bit printing
convention. Meaning, Plus.tensor(Zero)
produces a \|+⟩ on qubit 0 and a \|0⟩ on qubit 1, or \|+⟩⨂\|0⟩, but
would produce a QuantumCircuit like
\|0⟩--
\|+⟩--
Because Terra prints circuits and results with qubit 0
at the end of the string or circuit.
Args:
other: The ``OperatorBase`` to tensor product with self.
Returns:
An ``OperatorBase`` equivalent to the tensor product of self and other.
"""
raise NotImplementedError
def tensorpower(self, other: int) -> Union[OperatorBase, int]:
if not isinstance(other, int) or other <= 0:
raise TypeError("Tensorpower can only take positive int arguments")
temp = StateFn(
self.primitive, coeff=self.coeff, is_measurement=self.is_measurement
) # type: OperatorBase
for _ in range(other - 1):
temp = temp.tensor(self)
return temp
def _expand_shorter_operator_and_permute(
self, other: OperatorBase, permutation: Optional[List[int]] = None
) -> Tuple[OperatorBase, OperatorBase]:
# pylint: disable=cyclic-import
from ..operator_globals import Zero
if self == StateFn({"0": 1}, is_measurement=True):
# Zero is special - we'll expand it to the correct qubit number.
return StateFn("0" * other.num_qubits, is_measurement=True), other
elif other == Zero:
# Zero is special - we'll expand it to the correct qubit number.
return self, StateFn("0" * self.num_qubits)
return super()._expand_shorter_operator_and_permute(other, permutation)
def to_matrix(self, massive: bool = False) -> np.ndarray:
raise NotImplementedError
def to_density_matrix(self, massive: bool = False) -> np.ndarray:
"""Return matrix representing product of StateFn evaluated on pairs of basis states.
Overridden by child classes.
Args:
massive: Whether to allow large conversions, e.g. creating a matrix representing
over 16 qubits.
Returns:
The NumPy array representing the density matrix of the State function.
Raises:
ValueError: If massive is set to False, and exponentially large computation is needed.
"""
raise NotImplementedError
def compose(
self, other: OperatorBase, permutation: Optional[List[int]] = None, front: bool = False
) -> OperatorBase:
r"""
Composition (Linear algebra-style: A@B(x) = A(B(x))) is not well defined for states
in the binary function model, but is well defined for measurements.
Args:
other: The Operator to compose with self.
permutation: ``List[int]`` which defines permutation on other operator.
front: If front==True, return ``other.compose(self)``.
Returns:
An Operator equivalent to the function composition of self and other.
Raises:
ValueError: If self is not a measurement, it cannot be composed from the right.
"""
# TODO maybe allow outers later to produce density operators or projectors, but not yet.
if not self.is_measurement and not front:
raise ValueError(
"Composition with a Statefunction in the first operand is not defined."
)
new_self, other = self._expand_shorter_operator_and_permute(other, permutation)
if front:
return other.compose(self)
# TODO maybe include some reduction here in the subclasses - vector and Op, op and Op, etc.
from ..primitive_ops.circuit_op import CircuitOp
if self.primitive == {"0" * self.num_qubits: 1.0} and isinstance(other, CircuitOp):
# Returning CircuitStateFn
return StateFn(
other.primitive, is_measurement=self.is_measurement, coeff=self.coeff * other.coeff
)
from ..list_ops.composed_op import ComposedOp
if isinstance(other, ComposedOp):
return ComposedOp([new_self] + other.oplist, coeff=new_self.coeff * other.coeff)
return ComposedOp([new_self, other])
def power(self, exponent: int) -> OperatorBase:
"""Compose with Self Multiple Times, undefined for StateFns.
Args:
exponent: The number of times to compose self with self.
Raises:
ValueError: This function is not defined for StateFns.
"""
raise ValueError("Composition power over Statefunctions or Measurements is not defined.")
def __str__(self) -> str:
prim_str = str(self.primitive)
if self.coeff == 1.0:
return "{}({})".format(
"StateFunction" if not self.is_measurement else "Measurement", self.coeff
)
else:
return "{}({}) * {}".format(
"StateFunction" if not self.is_measurement else "Measurement", self.coeff, prim_str
)
def __repr__(self) -> str:
return "{}({}, coeff={}, is_measurement={})".format(
self.__class__.__name__, repr(self.primitive), self.coeff, self.is_measurement
)
def eval(
self,
front: Optional[
Union[str, Dict[str, complex], np.ndarray, OperatorBase, Statevector]
] = None,
) -> Union[OperatorBase, complex]:
raise NotImplementedError
@property
def parameters(self):
params = set()
if isinstance(self.primitive, (OperatorBase, QuantumCircuit)):
params.update(self.primitive.parameters)
if isinstance(self.coeff, ParameterExpression):
params.update(self.coeff.parameters)
return params
def assign_parameters(self, param_dict: dict) -> OperatorBase:
param_value = self.coeff
if isinstance(self.coeff, ParameterExpression):
unrolled_dict = self._unroll_param_dict(param_dict)
if isinstance(unrolled_dict, list):
from ..list_ops.list_op import ListOp
return ListOp([self.assign_parameters(param_dict) for param_dict in unrolled_dict])
if self.coeff.parameters <= set(unrolled_dict.keys()):
binds = {param: unrolled_dict[param] for param in self.coeff.parameters}
param_value = float(self.coeff.bind(binds))
return self.traverse(lambda x: x.assign_parameters(param_dict), coeff=param_value)
# Try collapsing primitives where possible. Nothing to collapse here.
def reduce(self) -> OperatorBase:
return self
def traverse(
self, convert_fn: Callable, coeff: Optional[Union[complex, ParameterExpression]] = None
) -> OperatorBase:
r"""
Apply the convert_fn to the internal primitive if the primitive is an Operator (as in
the case of ``OperatorStateFn``). Otherwise do nothing. Used by converters.
Args:
convert_fn: The function to apply to the internal OperatorBase.
coeff: A coefficient to multiply by after applying convert_fn.
If it is None, self.coeff is used instead.
Returns:
The converted StateFn.
"""
if coeff is None:
coeff = self.coeff
if isinstance(self.primitive, OperatorBase):
return StateFn(
convert_fn(self.primitive), coeff=coeff, is_measurement=self.is_measurement
)
else:
return self
def to_matrix_op(self, massive: bool = False) -> OperatorBase:
"""Return a ``VectorStateFn`` for this ``StateFn``.
Args:
massive: Whether to allow large conversions, e.g. creating a matrix representing
over 16 qubits.
Returns:
A VectorStateFn equivalent to self.
"""
# pylint: disable=cyclic-import
from .vector_state_fn import VectorStateFn
return VectorStateFn(self.to_matrix(massive=massive), is_measurement=self.is_measurement)
def to_circuit_op(self) -> OperatorBase:
"""Returns a ``CircuitOp`` equivalent to this Operator."""
raise NotImplementedError
# TODO to_dict_op
def sample(
self, shots: int = 1024, massive: bool = False, reverse_endianness: bool = False
) -> Dict[str, float]:
"""Sample the state function as a normalized probability distribution. Returns dict of
bitstrings in order of probability, with values being probability.
Args:
shots: The number of samples to take to approximate the State function.
massive: Whether to allow large conversions, e.g. creating a matrix representing
over 16 qubits.
reverse_endianness: Whether to reverse the endianness of the bitstrings in the return
dict to match Terra's big-endianness.
Returns:
A dict containing pairs sampled strings from the State function and sampling
frequency divided by shots.
"""
raise NotImplementedError
|