A review on reversible quantum adders

F Orts, G Ortega, EF Combarro, EM Garzón - Journal of Network and …, 2020 - Elsevier
Reversible adders are essential circuits in quantum computing systems. They are a
fundamental part of the algorithms implemented for such systems, where Shor's celebrated …

Functional quantum abstract detecting systems

G Lugilde, EF Combarro, IF Rúa - Quantum Information Processing, 2024 - Springer
Quantum abstract detecting systems (QADS) provide a common framework to address
detection problems in quantum computers. A particular QADS family, that of combinatorial …

Quantum abstract detecting systems

EF Combarro, J Ranilla, IF Rúa - Quantum Information Processing, 2020 - Springer
In this paper, we study Quantum Abstract Detecting Systems (QADS), that generalize some
key characteristics of the operators used in Grover's algorithm, a wide variety of quantum …

On protocols for increasing the uniformity of random bits generated with noisy quantum computers

EF Combarro, F Carminati, S Vallecorsa… - The Journal of …, 2021 - Springer
Generating random numbers is important for many real-world applications, including
cryptography, statistical sampling and Monte Carlo simulations. Quantum systems subject to …

[HTML][HTML] Quantum walks for the determination of commutativity of finite dimensional algebras

EF Combarro, J Ranilla, IF Rúa - Journal of Computational and Applied …, 2019 - Elsevier
Quantum walks provide a framework for the construction of quantum algorithms. Based on
this approach, we consider different walks for testing the commutativity of a finite …

Experiments testing the commutativity of finite‐dimensional algebras with a quantum adiabatic algorithm

EF Combarro, J Ranilla, IF Rúa - … and Mathematical Methods, 2019 - Wiley Online Library
Determining whether a given algebra is commutative or not is important in the study of these
algebraic objects in general and in the classification of semifields in particular. The best …

Quantum Algorithms for Algebraic Structures

JM Hernández Caceres - 2024 - digibuo.uniovi.es
La computación cuántica es un paradigma de computación bien asentado desde el punto
de vista teórico [NC11] y prometedor desde el punto de vista práctico [Aea19]. Por otra …

[PDF][PDF] Efficient quantum algorithms to find substructures on finite algebras.

JMH Cáceres, IF Rúa, EF Combarro - Quantum Inf. Comput., 2023 - rintonpress.com
When classifying a collection of finite algebras (for instance, in the computational
classification of finite semifields), an important task is the determination of substructures …

An Approach to the Classification of Finite Semifields by Quantum Computing Check for updates

JMH Cáceres, IF Rúa - … Algebras and Related Topics: NAART II …, 2023 - books.google.com
Finite semifields are finite nonassociative rings with an identity element, such that the set of
nonzero elements is a loop under the product. Their number of elements is a prime power …

Performance of c++ language code in quantum computing environment

RR Narsapur, R Arora, MK Shah… - Machine Learning and …, 2020 - Springer
This paper considers the execution of different C++ language program codes based on
simple program, functions, class inheritance, recursion and file handling under Quantum …