相关论文: The modular multiplication operator and the quanti…
It is widely known that the lower bound for the algorithmic complexity of square matrix multiplication resorts to at least $n^2$ arithmetic operations. The justification builds upon the following reasoning: given that there are $2 n^2$…
The execution cost of quantum algorithms is typically quantified through asymptotic gate counts and qubit register sizes, yet these metrics do not directly capture which genuinely quantum resources, and in what amount, must be created and…
Grothendieck's inequalities for operators and bilinear forms imply some factorization results for complex m x n matrices. Based on the theory of operator spaces and completely bounded mappings we present norm optimal versions of these…
A refinement of Shor's Algorithm for determining order is introduced, which determines a divisor of the order after any one run of a quantum computer with almost absolute certainty. The information garnered from each run is accumulated to…
In this paper we investigate the parallelization of two modular algorithms. In fact, we consider the modular computation of Gr\"obner bases (resp. standard bases) and the modular computation of the associated primes of a zero-dimensional…
There have been several algorithms designed to optimise matrix multiplication. From schoolbook method with complexity $O(n^3)$ to advanced tensor-based tools with time complexity $O(n^{2.3728639})$ (lowest possible bound achieved), a lot of…
Although widely used in practice, the behavior and accuracy of the popular module identification technique called modularity maximization is not well understood in practical contexts. Here, we present a broad characterization of its…
Quantum algorithms are a very promising field. However, creating and manipulating these kind of algorithms is a very complex task, specially for software engineers used to work at higher abstraction levels. The work presented here is part…
A binary mapping from Fock space of bosonic state to qubits is given. Based on the binary mapping, we construte an algorithm of qubitization of bosons with complexity O(log(N)). As an example, the algorithm of qubitization of bosons in…
We observe structure in the sequences of quotients and remainders of the Euclidean algorithm with two families of inputs. Analyzing the remainders, we obtain new algorithms for computing modular inverses and representating prime numbers by…
This paper reports on the experimental implementation of the quantum baker's map via a three bit nuclear magnetic resonance (NMR) quantum information processor. The experiments tested the sensitivity of the quantum chaotic map to…
We report a proof-of-concept demonstration of a quantum order-finding algorithm for factoring the integer 21. Our demonstration involves the use of a compiled version of the quantum phase estimation routine, and builds upon a previous…
We investigate the sparsity of the Gabor-matrix representation of Fourier integral operators with a phase having quadratic growth. It is known that such an infinite matrix is sparse and well organized, being in fact concentrated along the…
The assumed computationally difficulty of factoring large integers forms the basis of security for RSA public-key cryptography, which specifically relies on products of two large primes or semi-primes. The best-known factoring algorithms…
We investigate two types of boundedness criteria for bilinear Fourier multiplier operators with symbols with bounded partial derivatives of all (or sufficiently many) orders. Theorems of the first type explicitly prescribe only a certain…
There exists a Hamiltonian formulation of the factorisation problem which also needs the definition of a factorisation ensemble (a set to which factorable numbers, $N'=x'y'$, having the same trivial factorisation algorithmic complexity,…
In this paper, we will consider matrices with entries in the space of operators $\mathcal{B}(H)$, where $H$ is a separable Hilbert space, and consider the class of (left or right) Schur multipliers that can be approached in the multiplier…
The introduction of Schur multipliers into the context of Double Operator Integrals (DOIs) was proposed by V. V. Peller in 1985. This work extends theorem on Schur multipliers from measurable functions to their closure space and generalizes…
Quantum computing devices are believed to be powerful in solving the prime factorization problem, which is at the heart of widely deployed public-key cryptographic tools. However, the implementation of Shor's quantum factorization algorithm…
We prove the boundedness of a general class of multipliers and Fourier multipliers, in particular of the Hilbert transform, on quasi-Banach modulation spaces. We also deduce boundedness for multiplications and convolutions for elements in…