Related papers: An efficient high dimensional quantum Schur transf…
We describe an efficient quantum algorithm for computing discrete logarithms in semigroups using Shor's algorithms for period finding and discrete log as subroutines. Thus proposed cryptosystems based on the presumed hardness of discrete…
The Witten index counts the difference in the number of bosonic and fermionic states of a quantum mechanical system. The Schur index, which can be defined for theories with at least $\mathcal{N}=2$ supersymmetry in four dimensions is a…
In this paper we define the shifted Schur process as a measure on sequences of strict partitions. This process is a generalization of the shifted Schur measure introduced in [TW] and [Mat] and is a shifted version of the Schur process…
We say a sequence $f_0, f_1, f_2, \ldots$ of symmetric functions is Schur log-concave if $f_n^2 - f_{n-1}f_{n+1}$ is Schur positive for all $n\ge1$. We conjecture that a very general class of sequences of Schur functions satisfies this…
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of O(log n + log log (1/epsilon)) on the circuit depth for computing an approximation of the QFT with respect to the modulus 2^n…
Shor's factoring algorithm is one of the most anticipated applications of quantum computing. However, the limited capabilities of today's quantum computers only permit a study of Shor's algorithm for very small numbers. Here we show how…
The aim of this work is to show a brand-new way of making deterministic Quantum Computing (short QC), in the sense of Theory of Calculability, by meaning of unitary evolution. We start from the original Shor's Algorithm to explain how the…
In this Letter, we present a physical scheme for implementing the discrete quantum Fourier transform in a coupled semiconductor double quantum dot system. The main controlled-R gate operation can be decomposed into many simple and feasible…
The Discrete Fourier Transform (DFT) is central to the analysis of uniformly sampled signals, yet many practical applications involve non-uniform sampling, requiring the Non-Uniform Discrete Fourier Transform (NUDFT). While quantum…
We present quantum algorithms for the simulation of quantum systems in one spatial dimension, which result in quantum speedups that range from superpolynomial to polynomial. We first describe a method to simulate the evolution of the…
Quantum computation may well be performed with the use of electric circuits. Especially, the Schr\"{o}dinger equation can be simulated by the lumped-element model of transmission lines, which is applicable to low-frequency electric…
Gaussian unitary transformations are generated by quadratic Hamiltonians, i.e., Hamiltonians containing quadratic terms in creations and annihilation operators, and are heavily used in many areas of quantum physics, ranging from quantum…
Shor's algorithm (SA) is a quantum algorithm for factoring integers. Since SA has polynomial complexity while the best classical factoring algorithms are sub-exponential, SA is cited as evidence that quantum computers are more powerful than…
Unknown unitary inversion is a fundamental primitive in quantum computing and physics. Although recent work has demonstrated that quantum algorithms can invert arbitrary unknown unitaries without accessing their classical descriptions,…
Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central problem solved by Shor's factoring algorithm. We suggest an…
We obtain descriptions of central operator-valued Schur and Herz-Schur multipliers, akin to a classical characterisation due to Grothendieck, that reveals a close link between central (linear) multipliers and bilinear multipliers into the…
We have taken significant steps towards the realization of a practical quantum computer: using nuclear spins and magnetic resonance techniques at room temperature, we provided proof of principle of quantum computing in a series of…
The purpose of this note was to give a proof that Shor's algorithm for period search is polynomial using only the standard $2^{n}$ quantum Fourier thansform and some simple trigonometry. There is an error that was pointed out to the author…
In this paper we develop the generalised Schur theory offered in the recent paper by the second author in dimension one case, and apply it to obtain a new explicit parametrisation of torsion free rank one sheaves on projective irreducible…
The security of messages encoded via the widely used RSA public key encryption system rests on the enormous computational effort required to find the prime factors of a large number N using classical (i.e., conventional) computers. In 1994,…