Results 31 to 40 of about 61 (48)
Forum of Mathematics, PiIn 1994, Shor introduced his famous quantum algorithm to factor integers and compute discrete logarithms in polynomial time. In 2023, Regev proposed a multidimensional version of Shor’s algorithm that requires far fewer quantum gates.
Cédric Pilatte
doaj +1 more source
El problema del subgrup amagat [PDF]
, 2022 Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2022, Director: Artur Travesa i Grau[en] The hidden subgroup problem is a theoretical formalism which encompasses some problems of great importance, like ...
Serrallonga Rosell, Guillem
core
Lifting query complexity to time-space complexity for two-way finite automata
, 2023 Time-space tradeoff has been studied in a variety of models, such as Turing machines, branching programs, and finite automata, etc. While communication complexity as a technique has been applied to study finite automata, it seems it has not been used to ...
Gruska, Jozef +4 more
core
Algunas variantes del algoritmo cuántico de Shor [PDF]
, 2022 Treballs Finals de Grau d'Enginyeria Informàtica, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2022, Director: Luis Victor Dieulefait[en] The aim of this project is to study the Shor’s factorization algorithm, as well as some of its variants,
Cano Pradas, Juan
core
Vector finite fields of characteristic two as algebraic support of multivariate cryptography [PDF]
The central issue of the development of the multivariate public key algorithms is the design of reversible non-linear mappings of $n$-dimensional vectors over a finite field, which can be represented in a form of a set of power polynomials. For the first
Alexandr Moldovyan, Nikolay Moldovyan
core +1 more source
Pöschl-Teller potentials based solution to Hilbert's tenth problem
Ingeniería y Ciencia, 2006 Los hipercomputadores computan funciones o números, o en general solucionan problemas que no pueden ser computados o solucionados por una máquina de Turing. Se presenta una adaptación del algoritmo cuántico hipercomputacional propuesto por Tien D.
Andrés Sicard, Juan Ospina
doaj
Hidden Symmetry Subgroup Problems [PDF]
, 2013 We advocate a new approach for addressing hidden structure problems and finding efficient quantum algorithms. We introduce and investigate the hidden symmetry subgroup problem (HSSP), which is a generalization of the well-studied hidden subgroup problem (
Decker, Thomas +3 more
core +1 more source
Certified Quantum Computation in Isabelle/HOL. [PDF]
J Autom Reason, 2021 Bordg A, Lachnitt H, He Y.
europepmc +1 more source
Developing and Assessing the Validity and Reliability of an Iranian Food Security Questionnaire [PDF]
, 2019 Background: Food insecurity has a considerable impact on the social, physical, and psychological well-being of people and there is no food security assessment tool specific for Iranians. This study aimed to develop and assess the validity and reliability
Azadbakht, Leila +5 more
core
A multi-channel quantum image representation model with qubit sequences for quantum-inspired image and image retrieval [PDF]
Quantum image processing (QIP) has become one of the most significant fields in quantum computing (QC); it merges quantum mechanics with image processing to improve classical image-processing speed, which involves various operations to advance quantum ...
Nadia M. G. Al-Saidi +4 more
core +1 more source