classiq 0.37.0__py3-none-any.whl → 0.38.0__py3-none-any.whl

classiq/interface/generator/arith/arithmetic_expression_validator.py

@@ -1,5 +1,6 @@
 import ast
 import builtins
+import re
 from _ast import AST
 from typing import Any, Optional, Set, Tuple, Type, Union
 
@@ -15,6 +16,7 @@ from classiq.exceptions import ClassiqArithmeticError, ClassiqValueError
 DEFAULT_SUPPORTED_FUNC_NAMES: Set[str] = {"CLShift", "CRShift", "min", "max"}
 
 DEFAULT_EXPRESSION_TYPE = "arithmetic"
+IDENITIFIER_REGEX = re.compile(r"[a-zA-Z_][a-zA-Z0-9_]*")
 
 _REPEATED_VARIABLES_ERROR_MESSAGE: str = (
     "Repeated variables in the beginning of an arithmetic expression are not allowed."
@@ -75,17 +77,25 @@ class ExpressionValidator(ast.NodeVisitor):
 
     def validate(self, expression: str) -> None:
         try:
-            ast_expr = ast.parse(expression, filename="", mode=self._mode)
+            adjusted_expression = self._get_adjusted_expression(expression)
+            ast_expr = ast.parse(adjusted_expression, filename="", mode=self._mode)
         except SyntaxError as e:
             raise ClassiqValueError(f"Failed to parse expression {expression!r}") from e
         try:
-            self._ast_obj = AstNodeRewrite().visit(ast_expr)
+            self._ast_obj = self.rewrite_ast(ast_expr)
             self.visit(self._ast_obj)
         except RecursionError as e:
             raise ClassiqValueError(
                 f"Failed to parse expression since it is too long: {expression}"
             ) from e
 
+    @staticmethod
+    def _get_adjusted_expression(expression: str) -> str:
+        # This works around the simplification of the trivial expressions such as a + 0, 1 * a, etc.
+        if IDENITIFIER_REGEX.fullmatch(expression):
+            return f"0 + {expression}"
+        return expression
+
     @property
     def ast_obj(self) -> ast.AST:
         if not self._ast_obj:
@@ -182,6 +192,10 @@ class ExpressionValidator(ast.NodeVisitor):
             self._supported_functions.add(node.name)
         self.generic_visit(node)
 
+    @classmethod
+    def rewrite_ast(cls, expression_ast: AST) -> AST:
+        return expression_ast
+
 
 def validate_expression(
     expression: str,

classiq/interface/generator/arith/arithmetic_operations.py

@@ -1,11 +1,11 @@
-from __future__ import annotations
-
 import abc
 from typing import ClassVar, Iterable, Optional, Tuple
 
 import pydantic
 
-from classiq.interface.generator.arith import argument_utils, number_utils
+from classiq.interface.generator.arith.machine_precision import (
+    DEFAULT_MACHINE_PRECISION,
+)
 from classiq.interface.generator.arith.register_user_input import RegisterArithmeticInfo
 from classiq.interface.generator.function_params import FunctionParams
 
@@ -14,7 +14,7 @@ DEFAULT_GARBAGE_OUT_NAME: str = "extra_qubits"
 
 class ArithmeticOperationParams(FunctionParams):
     output_size: Optional[pydantic.PositiveInt]
-    machine_precision: pydantic.PositiveInt = number_utils.MAX_FRACTION_PLACES
+    machine_precision: pydantic.PositiveInt = DEFAULT_MACHINE_PRECISION
     output_name: ClassVar[str]
     garbage_output_name: ClassVar[str] = DEFAULT_GARBAGE_OUT_NAME
     _result_register: Optional[RegisterArithmeticInfo] = pydantic.PrivateAttr(
@@ -46,11 +46,6 @@ class ArithmeticOperationParams(FunctionParams):
             return suggested_bounds
         return None
 
-    def _compute_fraction_places(self, argument: argument_utils.RegisterOrConst) -> int:
-        return argument_utils.fraction_places(
-            argument, machine_precision=self.machine_precision
-        )
-
     @abc.abstractmethod
-    def get_params_inplace_options(self) -> Iterable[ArithmeticOperationParams]:
+    def get_params_inplace_options(self) -> Iterable["ArithmeticOperationParams"]:
         pass

classiq/interface/generator/arith/ast_node_rewrite.py

@@ -30,7 +30,7 @@ class AstNodeRewrite(ast.NodeTransformer):
         elif hasattr(node, "op"):
             return type(node.op).__name__ + next(self.count_str_gen)
         elif hasattr(node, "func"):
-            return node.func.id
+            return self.extract_node_id(node.func)
         elif hasattr(node, "value"):
             return node.value
         elif hasattr(node, "ops"):

classiq/interface/generator/arith/binary_ops.py

@@ -8,6 +8,7 @@ from typing import (
     Literal,
     Optional,
     Tuple,
+    Type,
     TypeVar,
     Union,
 )
@@ -28,6 +29,7 @@ from classiq.interface.generator.arith.unary_ops import Negation
 from classiq.interface.generator.function_params import get_zero_input_name
 
 from classiq._internals.enum_utils import StrEnum
+from classiq.exceptions import ClassiqValueError
 
 LeftDataT = TypeVar("LeftDataT")
 RightDataT = TypeVar("RightDataT")
@@ -61,23 +63,36 @@ class BinaryOpParams(
         left_arg = values.get("left_arg")
         right_arg = values.get("right_arg")
         if isinstance(left_arg, Numeric) and isinstance(right_arg, Numeric):
-            raise ValueError("One argument must be a register")
+            raise ClassiqValueError("One argument must be a register")
         if left_arg is right_arg and isinstance(left_arg, pydantic.BaseModel):
             # In case both arguments refer to the same object, copy it.
             # This prevents changes performed on one argument to affect the other.
             values["right_arg"] = left_arg.copy(deep=True)
         return values
 
+    def garbage_output_size(self) -> pydantic.NonNegativeInt:
+        return 0
+
     def _create_ios(self) -> None:
         self._inputs = dict()
         if isinstance(self.left_arg, RegisterArithmeticInfo):
             self._inputs[self.left_arg_name] = self.left_arg
         if isinstance(self.right_arg, RegisterArithmeticInfo):
             self._inputs[self.right_arg_name] = self.right_arg
-        zero_input_name = get_zero_input_name(self.output_name)
-        self._zero_inputs = {zero_input_name: self.result_register}
         self._outputs = {**self._inputs, self.output_name: self.result_register}
 
+        garbage_size = self.garbage_output_size()
+        if garbage_size > 0:
+            self._outputs[self.garbage_output_name] = RegisterArithmeticInfo(
+                size=garbage_size
+            )
+
+        zero_input_name = get_zero_input_name(self.output_name)
+        zero_input_size = self.result_register.size + garbage_size
+        self._zero_inputs = {
+            zero_input_name: RegisterArithmeticInfo(size=zero_input_size)
+        }
+
     def is_inplaced(self) -> bool:
         return False
 
@@ -96,18 +111,17 @@ class InplacableBinaryOpParams(
         right_arg = values.get("right_arg")
         inplace_arg: Optional[ArgToInplace] = values.get("inplace_arg")
         if inplace_arg == ArgToInplace.RIGHT and isinstance(right_arg, Numeric):
-            raise ValueError(_NumericArgumentInplaceErrorMessage.format(right_arg))
+            raise ClassiqValueError(
+                _NumericArgumentInplaceErrorMessage.format(right_arg)
+            )
         elif inplace_arg == ArgToInplace.LEFT and isinstance(left_arg, Numeric):
-            raise ValueError(_NumericArgumentInplaceErrorMessage.format(left_arg))
+            raise ClassiqValueError(
+                _NumericArgumentInplaceErrorMessage.format(left_arg)
+            )
         return values
 
     def _create_ios(self) -> None:
         BinaryOpParams._create_ios(self)
-        garbage_size = self.garbage_output_size()
-        if garbage_size > 0:
-            self._outputs[self.garbage_output_name] = RegisterArithmeticInfo(
-                size=garbage_size
-            )
         if self.inplace_arg is None:
             return
         inplace_arg_name = (
@@ -117,7 +131,7 @@ class InplacableBinaryOpParams(
         )
         self._outputs.pop(inplace_arg_name)
 
-        self._set_inplace_zero_inputs(inplace_arg_name, garbage_size)
+        self._set_inplace_zero_inputs(inplace_arg_name, self.garbage_output_size())
 
     def _set_inplace_zero_inputs(
         self, inplace_arg_name: str, garbage_size: int
@@ -193,7 +207,7 @@ class BinaryOpWithIntInputs(BinaryOpParams[RegisterOrInt, RegisterOrInt]):
             and right_arg.fraction_places > 0
         )
         if is_left_arg_float_register or is_right_arg_float_register:
-            raise ValueError(BOOLEAN_OP_WITH_FRACTIONS_ERROR)
+            raise ClassiqValueError(BOOLEAN_OP_WITH_FRACTIONS_ERROR)
         return values
 
     @staticmethod
@@ -251,19 +265,28 @@ class Adder(InplacableBinaryOpParams[RegisterOrConst, RegisterOrConst]):
         ub = argument_utils.upper_bound(self.left_arg) + argument_utils.upper_bound(
             self.right_arg
         )
-        integer_part_size = number_utils.bounds_to_integer_part_size(lb, ub)
         fraction_places = max(
-            self._compute_fraction_places(self.left_arg),
-            self._compute_fraction_places(self.right_arg),
+            argument_utils.fraction_places(self.left_arg),
+            argument_utils.fraction_places(self.right_arg),
         )
-        size_needed = integer_part_size + fraction_places
         return RegisterArithmeticInfo(
-            size=self.output_size or size_needed,
+            size=self.output_size or self._get_output_size(ub, lb, fraction_places),
             fraction_places=fraction_places,
             is_signed=self._include_sign and lb < 0,
             bounds=(lb, ub) if self._include_sign else None,
         )
 
+    def _get_output_size(self, ub: float, lb: float, fraction_places: int) -> int:
+        if isinstance(self.left_arg, float) and self.left_arg == 0.0:
+            assert isinstance(self.right_arg, RegisterArithmeticInfo)
+            return self.right_arg.size
+        elif isinstance(self.right_arg, float) and self.right_arg == 0.0:
+            assert isinstance(self.left_arg, RegisterArithmeticInfo)
+            return self.left_arg.size
+
+        integer_part_size = number_utils.bounds_to_integer_part_size(lb, ub)
+        return integer_part_size + fraction_places
+
 
 class Subtractor(InplacableBinaryOpParams[RegisterOrConst, RegisterOrConst]):
     output_name = "difference"
@@ -275,19 +298,28 @@ class Subtractor(InplacableBinaryOpParams[RegisterOrConst, RegisterOrConst]):
             argument_utils.upper_bound(self.left_arg)
             - argument_utils.lower_bound(self.right_arg),
         )
-        integer_part_size = number_utils.bounds_to_integer_part_size(*bounds)
         fraction_places = max(
-            self._compute_fraction_places(self.left_arg),
-            self._compute_fraction_places(self.right_arg),
+            argument_utils.fraction_places(self.left_arg),
+            argument_utils.fraction_places(self.right_arg),
         )
-        size_needed = integer_part_size + fraction_places
+
         return RegisterArithmeticInfo(
-            size=self.output_size or size_needed,
+            size=self.output_size or self._get_output_size(bounds, fraction_places),
             fraction_places=fraction_places,
             is_signed=self._include_sign and min(bounds) < 0,
             bounds=self._legal_bounds(bounds),
         )
 
+    def _get_output_size(
+        self, bounds: Tuple[float, float], fraction_places: int
+    ) -> int:
+        if isinstance(self.right_arg, float) and self.right_arg == 0:
+            assert isinstance(self.left_arg, RegisterArithmeticInfo)
+            return self.left_arg.size
+        integer_part_size = number_utils.bounds_to_integer_part_size(*bounds)
+        size_needed = integer_part_size + fraction_places
+        return size_needed
+
     def garbage_output_size(self) -> pydantic.NonNegativeInt:
         if not isinstance(self.right_arg, RegisterArithmeticInfo):
             adder_params = Adder(
@@ -327,7 +359,7 @@ class Subtractor(InplacableBinaryOpParams[RegisterOrConst, RegisterOrConst]):
         return self.inplace_arg == ArgToInplace.LEFT
 
     def _expected_negation_output_size(self) -> int:
-        return self._compute_fraction_places(self.right_arg) + min(
+        return argument_utils.fraction_places(self.right_arg) + min(
             self.result_register.integer_part_size,
             number_utils.bounds_to_integer_part_size(
                 *(-bound for bound in argument_utils.bounds(self.right_arg))
@@ -356,31 +388,80 @@ class Subtractor(InplacableBinaryOpParams[RegisterOrConst, RegisterOrConst]):
 class Multiplier(BinaryOpWithFloatInputs):
     output_name = "product"
 
-    def _get_result_register(self) -> RegisterArithmeticInfo:
-        fraction_places = self._compute_fraction_places(
-            self.left_arg
-        ) + self._compute_fraction_places(self.right_arg)
+    def expected_fraction_places(self) -> int:
+        return argument_utils.fraction_places(
+            argument_utils.limit_fraction_places(
+                self.left_arg, machine_precision=self.machine_precision
+            )
+        ) + argument_utils.fraction_places(
+            argument_utils.limit_fraction_places(
+                self.right_arg, machine_precision=self.machine_precision
+            )
+        )
+
+    @staticmethod
+    def _get_bounds(
+        args: Tuple[RegisterOrConst, RegisterOrConst], machine_precision: int
+    ) -> Tuple[float, float]:
         extremal_values = [
             left * right
-            for left in argument_utils.bounds(self.left_arg)
-            for right in argument_utils.bounds(self.right_arg)
+            for left in argument_utils.bounds(args[0])
+            for right in argument_utils.bounds(args[1])
         ]
-        bounds = (min(extremal_values), max(extremal_values))
-        largest_bound = max(bounds, key=abs)
-        integer_places = int(largest_bound).bit_length() + int(largest_bound < 0)
-        extra_sign_bit = int(
-            argument_utils.is_signed(self.left_arg)
-            and argument_utils.is_signed(self.right_arg)
-            and largest_bound > 0
+        return (
+            number_utils.limit_fraction_places(
+                min(extremal_values), machine_precision=machine_precision
+            ),
+            number_utils.limit_fraction_places(
+                max(extremal_values), machine_precision=machine_precision
+            ),
+        )
+
+    def _get_result_register(self) -> RegisterArithmeticInfo:
+        fraction_places = min(self.machine_precision, self.expected_fraction_places())
+        left_arg = argument_utils.limit_fraction_places(
+            self.left_arg, machine_precision=self.machine_precision
         )
+        right_arg = argument_utils.limit_fraction_places(
+            self.right_arg, machine_precision=self.machine_precision
+        )
+        bounds = self._get_bounds((left_arg, right_arg), self.machine_precision)
+
         return RegisterArithmeticInfo(
             size=self.output_size
-            or max(1, integer_places + fraction_places + extra_sign_bit),
+            or self._get_output_size(bounds, fraction_places, left_arg, right_arg),
             fraction_places=fraction_places,
             is_signed=self._include_sign and min(bounds) < 0,
             bounds=self._legal_bounds(bounds),
         )
 
+    @staticmethod
+    def _get_output_size(
+        bounds: Tuple[float, float],
+        fraction_places: int,
+        left_arg: Union[RegisterArithmeticInfo, float],
+        right_arg: Union[RegisterArithmeticInfo, float],
+    ) -> int:
+        if isinstance(left_arg, float) and left_arg == 1.0:
+            assert isinstance(right_arg, RegisterArithmeticInfo)
+            return right_arg.size
+        elif isinstance(right_arg, float) and right_arg == 1.0:
+            assert isinstance(left_arg, RegisterArithmeticInfo)
+            return left_arg.size
+        largest_bound = max(bounds, key=abs)
+        integer_places = int(largest_bound).bit_length() + int(largest_bound < 0)
+        extra_sign_bit = int(
+            argument_utils.is_signed(left_arg)
+            and argument_utils.is_signed(right_arg)
+            and largest_bound > 0
+        )
+        return max(1, integer_places + fraction_places + extra_sign_bit)
+
+    def garbage_output_size(self) -> pydantic.NonNegativeInt:
+        return max(
+            0, self.expected_fraction_places() - self.result_register.fraction_places
+        )
+
 
 class Comparator(BinaryOpWithFloatInputs):
     output_size: Literal[1] = 1
@@ -419,26 +500,53 @@ class Power(BinaryOpParams[RegisterArithmeticInfo, pydantic.PositiveInt]):
     @pydantic.validator("right_arg", pre=True)
     def _validate_legal_power(cls, right_arg: Any) -> pydantic.PositiveInt:
         if not float(right_arg).is_integer():
-            raise ValueError("Power must be an integer")
+            raise ClassiqValueError("Power must be an integer")
         if right_arg <= 0:
-            raise ValueError("Power must be greater than one")
+            raise ClassiqValueError("Power must be greater than one")
         return int(right_arg)
 
+    def expected_fraction_places(self) -> int:
+        return (
+            argument_utils.fraction_places(
+                argument_utils.limit_fraction_places(
+                    self.left_arg, machine_precision=self.machine_precision
+                )
+            )
+            * self.right_arg
+        )
+
     def _get_result_bounds(self) -> Tuple[float, float]:
-        if (self.right_arg % 2) or min(self.left_arg.bounds) >= 0:
+        bounds = [
+            number_utils.limit_fraction_places(
+                bound, machine_precision=self.machine_precision
+            )
+            for bound in self.left_arg.bounds
+        ]
+        if (self.right_arg % 2) or min(bounds) >= 0:
             return (
-                self.left_arg.bounds[0] ** self.right_arg,
-                self.left_arg.bounds[1] ** self.right_arg,
+                number_utils.limit_fraction_places(
+                    bounds[0] ** self.right_arg,
+                    machine_precision=self.machine_precision,
+                ),
+                number_utils.limit_fraction_places(
+                    bounds[1] ** self.right_arg,
+                    machine_precision=self.machine_precision,
+                ),
             )
-        return 0.0, max(abs(bound) for bound in self.left_arg.bounds) ** self.right_arg
+        return 0.0, number_utils.limit_fraction_places(
+            max(abs(bound) for bound in bounds) ** self.right_arg,
+            machine_precision=self.machine_precision,
+        )
 
     def _get_result_register(self) -> RegisterArithmeticInfo:
         if self.output_size:
             return RegisterArithmeticInfo(size=self.output_size)
 
-        fraction_places: int = self.left_arg.fraction_places * self.right_arg
+        fraction_places = min(self.machine_precision, self.expected_fraction_places())
         bounds = self._get_result_bounds()
         size = number_utils.bounds_to_integer_part_size(*bounds) + fraction_places
+        if bounds[0] == bounds[1]:
+            size = 1
         return RegisterArithmeticInfo(
             size=size,
             is_signed=self.left_arg.is_signed and (self.right_arg % 2 == 1),
@@ -446,6 +554,50 @@ class Power(BinaryOpParams[RegisterArithmeticInfo, pydantic.PositiveInt]):
             bounds=bounds,
         )
 
+    def _get_inner_action_garbage_size(
+        self,
+        action_type: Union[Type["Power"], Type[Multiplier]],
+        *,
+        arg: RegisterArithmeticInfo,
+        action_right_arg: RegisterOrConst,
+        compute_power: int
+    ) -> pydantic.NonNegativeInt:
+        inner_compute_power_params = Power(
+            left_arg=arg,
+            right_arg=compute_power,
+            output_size=self.output_size,
+            machine_precision=self.machine_precision,
+        )
+        return action_type(
+            left_arg=inner_compute_power_params.result_register,
+            right_arg=action_right_arg,
+            output_size=self.output_size,
+            machine_precision=self.machine_precision,
+        ).garbage_output_size()
+
+    def garbage_output_size(self) -> pydantic.NonNegativeInt:
+        arg = self.left_arg
+        power = self.right_arg
+        if power == 1:
+            return 0
+        if (
+            power == 2
+            or (arg.size == 1 and arg.fraction_places == 0)
+            or self.output_size == 1
+        ):
+            return max(
+                0,
+                self.expected_fraction_places() - self.result_register.fraction_places,
+            )
+
+        if power % 2 == 0:
+            return self._get_inner_action_garbage_size(
+                Power, arg=arg, action_right_arg=power // 2, compute_power=2
+            )
+        return self._get_inner_action_garbage_size(
+            Multiplier, arg=arg, action_right_arg=arg, compute_power=power - 1
+        )
+
 
 class EffectiveUnaryOpParams(
     InplacableBinaryOpParams[RegisterArithmeticInfo, RightDataT], Generic[RightDataT]
@@ -465,9 +617,9 @@ class LShift(EffectiveUnaryOpParams[pydantic.NonNegativeInt]):
         arg = values.get("left_arg")
         shift = values.get("right_arg")
         if not isinstance(arg, RegisterArithmeticInfo):
-            raise ValueError("left arg must be a RegisterArithmeticInfo")
+            raise ClassiqValueError("left arg must be a RegisterArithmeticInfo")
         if not isinstance(shift, int):
-            raise ValueError("Shift must be an integer")
+            raise ClassiqValueError("Shift must be an integer")
         assert arg.fraction_places - shift <= 0, _FLOATING_POINT_MODULO_ERROR_MESSAGE
         return values
 
@@ -506,9 +658,9 @@ class RShift(EffectiveUnaryOpParams[pydantic.NonNegativeInt]):
         arg = values.get("left_arg")
         shift = values.get("right_arg")
         if not isinstance(arg, RegisterArithmeticInfo):
-            raise ValueError("left arg must be a RegisterArithmeticInfo")
+            raise ClassiqValueError("left arg must be a RegisterArithmeticInfo")
         if not isinstance(shift, int):
-            raise ValueError("Shift must be an integer")
+            raise ClassiqValueError("Shift must be an integer")
         assert (
             cls._shifted_fraction_places(arg=arg, shift=shift) == 0
         ), _FLOATING_POINT_MODULO_ERROR_MESSAGE
@@ -549,7 +701,7 @@ class CyclicShift(EffectiveUnaryOpParams[int]):
             return values
         arg = values.get("left_arg")
         if not isinstance(arg, RegisterArithmeticInfo):
-            raise ValueError("left arg must be a RegisterArithmeticInfo")
+            raise ClassiqValueError("left arg must be a RegisterArithmeticInfo")
         assert arg.fraction_places == 0, _FLOATING_POINT_MODULO_ERROR_MESSAGE
         return values
 
@@ -590,11 +742,7 @@ class Modulo(EffectiveUnaryOpParams[int]):
         values["output_size"] = None
         return 2 ** (repr_qubits)
 
-    @property
-    def result_size(self) -> int:
-        return round(math.log2(self.right_arg))
-
     def _get_result_register(self) -> RegisterArithmeticInfo:
         return RegisterArithmeticInfo(
-            size=self.result_size, is_signed=False, fraction_places=0
+            size=round(math.log2(self.right_arg)), is_signed=False, fraction_places=0
         )

classiq/interface/generator/arith/extremum_operations.py

@@ -15,6 +15,8 @@ from classiq.interface.generator.arith.binary_ops import (
 from classiq.interface.generator.arith.register_user_input import RegisterArithmeticInfo
 from classiq.interface.generator.function_params import get_zero_input_name
 
+from classiq.exceptions import ClassiqValueError
+
 Numeric = (float, int)
 
 
@@ -27,7 +29,7 @@ class Extremum(ArithmeticOperationParams):
         left_arg = values.get("left_arg")
         right_arg = values.get("right_arg")
         if isinstance(left_arg, Numeric) and isinstance(right_arg, Numeric):
-            raise ValueError("One argument must be a register")
+            raise ClassiqValueError("One argument must be a register")
         if left_arg is right_arg and isinstance(left_arg, pydantic.BaseModel):
             # In case both arguments refer to the same object, copy it.
             # This prevents changes performed on one argument from affecting the other.
@@ -61,8 +63,8 @@ class Extremum(ArithmeticOperationParams):
             argument_utils.integer_part_size(self.right_arg),
         )
         fraction_places = max(
-            self._compute_fraction_places(self.left_arg),
-            self._compute_fraction_places(self.right_arg),
+            argument_utils.fraction_places(self.left_arg),
+            argument_utils.fraction_places(self.right_arg),
         )
         required_size = integer_part_size + fraction_places
         bounds = (

classiq/interface/generator/arith/logical_ops.py

@@ -9,6 +9,8 @@ from classiq.interface.generator.arith.arithmetic_operations import (
 from classiq.interface.generator.arith.register_user_input import RegisterArithmeticInfo
 from classiq.interface.generator.function_params import get_zero_input_name
 
+from classiq.exceptions import ClassiqValueError
+
 
 def get_arg_name(idx: int) -> str:
     return f"arg_{idx}"
@@ -25,7 +27,7 @@ class LogicalOps(ArithmeticOperationParams):
     @pydantic.validator("output_size")
     def _validate_output_size(cls, output_size: Optional[int]) -> int:
         if output_size is not None and output_size != 1:
-            raise ValueError("logical operation output size must be 1")
+            raise ClassiqValueError("logical operation output size must be 1")
         return 1
 
     @pydantic.validator("args")
@@ -34,7 +36,7 @@ class LogicalOps(ArithmeticOperationParams):
     ) -> List[RegisterOrConst]:
         for arg_idx, arg in enumerate(arguments):
             if isinstance(arg, RegisterArithmeticInfo) and not arg.is_boolean_register:
-                raise ValueError(
+                raise ClassiqValueError(
                     f"All inputs to logical and must be of size 1 (at argument #{arg_idx})"
                 )
         return arguments

classiq/interface/generator/arith/machine_precision.py

@@ -0,0 +1,3 @@
+from typing import Final
+
+DEFAULT_MACHINE_PRECISION: Final[int] = 8