Abstract: Bent functions are a subset of Boolean functions that have the property of maximum nonlinearity, which conditions their use in cryptography and coding theory. This paper describes and ...

Abstract: This paper describes the Jaya Algorithm and compares its performance with the Genetic Algorithm for optimizing the Himmelblau function and the Rosenbrock function. The Jaya algorithm is ...

Amsterdam’s struggles with its welfare fraud algorithm show us the stakes of deploying AI in situations that directly affect human lives. What Amsterdam’s welfare fraud algorithm taught me about fair ...

ABSTRACT: The alternating direction method of multipliers (ADMM) and its symmetric version are efficient for minimizing two-block separable problems with linear constraints. However, both ADMM and ...

Tensor contradictions are used to solve problems related to different research fields, including model counting, quantum circuits, graph problems, and machine learning. But to minimize the ...

This program is a Deutsch-Jozsa algorithm generalization (you can find 2 qubit case on the Pennylane main page). In this repository, we show the mathematical procedure to generate a unitary matrix, ...

Implementation of Solovay Kitaev Algorithm for approximating any n-qubit gate using gates from library set {H,T,CNOT,S}.