5 papers · 1 filter
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…
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…