10 papers
Approximate Homomorphisms and Convergent Representations in Transducers
Santiago Cifuentes
We study the stability of minimal representations of controlled stochastic processes (in particular, transducers) under perturbations. This question is motivated by recent experime…
Beyond Shapley: Efficient Computation of Asymmetric Shapley Values
Ezequiel Companeetz, Santiago Cifuentes, Sergio Abriola
We address the problem of explainability in machine learning models through feature attribution methods. In particular, we consider a variant of Shapley values known as Asymmetric…
Complexity of detecting large coefficients in the Pauli basis
Santiago Cifuentes
We study the problem of deciding, given a mechanism to prepare a quantum state and a value , whether there is some non-identity Pauli matrix such that $|Tr…
Variational Quantum Models for Knowledge Graph Embeddings on NISQ Devices
Guido Bellomo, Martín Santesteban, Patricio Bruno +2
Variational Quantum Algorithms (VQAs) combine quantum circuits with classical optimization to tackle problems that may benefit from the capabilities of near-term quantum hardware.…
Measuring the largest coefficients of a quantum state
Nicolás Ciancaglini, Santiago Cifuentes, Guido Bellomo +2
We introduce a hierarchical algorithm for identifying the indices of the largest Pauli coefficients of an unknown -qubit quantum state, either those exceeding a threshold or the…
Characterizing normality via automata and random matrix products
Laurent Bienvenu, Santiago Cifuentes, Hugo Gimbert
For a fixed alphabet A, an infinite sequence X is said to be normal if every word w over A appears in X with the same frequency as any other word of the same length. A classical re…
General Agents Contain World Models, even under Partial Observability and Stochasticity
Santiago Cifuentes
Deciding whether an agent possesses a model of its surrounding world is a fundamental step toward understanding its capabilities and limitations. In [10], it was shown that, within…
Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms
Tomás Capdevielle, Santiago Cifuentes
Given a classification model and a prediction for some input, there are heuristic strategies for ranking features according to their importance in regard to the prediction. One com…
Quantum computational complexity of matrix functions
Santiago Cifuentes, Samson Wang, Thais L. Silva +2
We investigate the dividing line between classical and quantum computational power in estimating properties of matrix functions. More precisely, we study the computational complexi…
Towards exact algorithmic proofs of maximal mutually unbiased bases sets in arbitrary integer dimension
Santiago Cifuentes, Nicolás Ciancaglini, Guido Bellomo +2
In this paper, we explore the concept of Mutually Unbiased Bases (MUBs) in discrete quantum systems. It is known that for dimensions that are powers of prime numbers, there exi…