Zobrazeno 1 - 10
of 148
pro vyhledávání: '"Ivanyos, Gábor"'
Bell sampling is a simple yet powerful measurement primitive that has recently attracted a lot of attention, and has proven to be a valuable tool in studying stabiliser states. Unfortunately, however, it is known that Bell sampling fails when used on
Externí odkaz:
http://arxiv.org/abs/2405.06357
Autor:
Imran, Muhammad, Ivanyos, Gábor
The semidirect discrete logarithm problem (SDLP) is the following analogue of the standard discrete logarithm problem in the semidirect product semigroup $G\rtimes \mathrm{End}(G)$ for a finite semigroup $G$. Given $g\in G, \sigma\in \mathrm{End}(G)$
Externí odkaz:
http://arxiv.org/abs/2312.14028
Autor:
Chen, Mingjie, Imran, Muhammad, Ivanyos, Gábor, Kutas, Péter, Leroux, Antonin, Petit, Christophe
The Isogeny to Endomorphism Ring Problem (IsERP) asks to compute the endomorphism ring of the codomain of an isogeny between supersingular curves in characteristic $p$ given only a representation for this isogeny, i.e. some data and an algorithm to e
Externí odkaz:
http://arxiv.org/abs/2305.19897
Autor:
Imran, Muhammad, Ivanyos, Gabor
We propose a method for solving the hidden subgroup problem in nilpotent groups. The main idea is iteratively transforming the hidden subgroup to its images in the quotient groups by the members of a central series, eventually to its image in the com
Externí odkaz:
http://arxiv.org/abs/2304.08376
Autor:
Imran, Muhammad, Ivanyos, Gabor
We present a polynomial time exact quantum algorithm for the hidden subgroup problem in $Z_{m^k}^n$. The algorithm uses the quantum Fourier transform modulo m and does not require factorization of m. For smooth m, i.e., when the prime factors of m ar
Externí odkaz:
http://arxiv.org/abs/2202.04047
One approach to make progress on the symbolic determinant identity testing (SDIT) problem is to study the structure of singular matrix spaces. After settling the non-commutative rank problem (Garg-Gurvits-Oliveira-Wigderson, Found. Comput. Math. 2020
Externí odkaz:
http://arxiv.org/abs/2109.06403
We investigate the computational complexity of the discrete logarithm, the computational Diffie-Hellman and the decisional Diffie-Hellman problems in some identity black-box groups G_{p,t}, where p is a prime number and t is a positive integer. These
Externí odkaz:
http://arxiv.org/abs/1911.01662
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Let $\mathbb{F}_q$ be the finite field of size $q$ and let $\ell: \mathbb{F}_q^n \to \mathbb{F}_q$ be a linear function. We introduce the {\em Learning From Subset} problem LFS$(q,n,d)$ of learning $\ell$, given samples $u \in \mathbb{F}_q^n$ from a
Externí odkaz:
http://arxiv.org/abs/1806.09660
Publikováno v:
32nd Conference on Computational Complexity (CCC 2017), Leibniz International Proceedings in Informatics (LIPIcs) 79, pp. 30:1-30:24 (2017)
The complexity class PPA consists of NP-search problems which are reducible to the parity principle in undirected graphs. It contains a wide variety of interesting problems from graph theory, combinatorics, algebra and number theory, but only a few o
Externí odkaz:
http://arxiv.org/abs/1710.08602