Related papers: The modular multiplication operator and the quanti…
It is well-known that if T is a D_m-D_n bimodule map on the m by n complex matrices, then T is a Schur multiplier and $\|T\|_{cb}=\|T\|$. If n=2 and T is merely assumed to be a right D_2-module map, then we show that $\|T\|_{cb}=\|T\|$.…
We give necessary and sufficient conditions for a Schur map to be a homomorphism, with some generalizations to the infinite-dimensional case. In the finite-dimensional case, we find that a Schur multiplier distributes over matrix…
With the goal of providing the foundations for a rigorous study of modules of bicomplex holomorphic functions, we develop a general theory of functional analysis with bicomplex scalars. Even though the basic properties of bicomplex number…
Quantum multi-programming is a method utilizing contemporary noisy intermediate-scale quantum computers by executing multiple quantum circuits concurrently. Despite early research on it, the research remains on quantum gates or small-size…
Classical models of computation traditionally resort to halting schemes in order to enquire about the state of a computation. In such schemes, a computational process is responsible for signalling an end of a calculation by setting a halt…
The Schur transform is a unitary operator that block diagonalizes the action of the symmetric and unitary groups on an $n$ fold tensor product $V^{\otimes n}$ of a vector space $V$ of dimension $d$. Bacon, Chuang and Harrow \cite{BCH07}…
A linear map $u\colon \ E\to F$ between operator spaces is called completely co-bounded if it is completely bounded as a map from $E$ to the opposite of $F$. We give several simple results about completely co-bounded Schur multipliers on…
Large $N$ but non-planar limits of ${\cal N}=4$ super Yang-Mills theory can be described using restricted Schur polynomials. Previous investigations demonstrate that the action of the one loop dilatation operator on restricted Schur…
We propose new primal-dual decomposition algorithms for solving systems of inclusions involving sums of linearly composed maximally monotone operators. The principal innovation in these algorithms is that they are block-iterative in the…
Shor and Grover demonstrated that a quantum computer can outperform any classical computer in factoring numbers and in searching a database by exploiting the parallelism of quantum mechanics. Whereas Shor's algorithm requires both…
In this note we describe a simple and intriguing observation: the quantum Fourier transform (QFT) over $Z_q$, which is considered the most ``quantum'' part of Shor's algorithm, can in fact be simulated efficiently by classical computers.…
We consider how to optimize memory use and computation time in operating a quantum computer. In particular, we estimate the number of memory qubits and the number of operations required to perform factorization, using the algorithm…
We report on the current state of factoring integers on both digital and analog quantum computers. For digital quantum computers, we study the effect of errors for which one can formally prove that Shor's factoring algorithm fails. For…
The conventional Quantum Fourier Transform, with exponential speedup compared to the classical Fast Fourier Transform, has played an important role in quantum computation as a vital part of many quantum algorithms (most prominently, the…
In this work, we study the classical problem of maximizing a submodular function subject to a matroid constraint. We develop deterministic algorithms that are very parsimonious with respect to querying the submodular function, for both the…
We present a novel set of reversible modular multipliers applicable to quantum computing, derived from three classical techniques: 1) traditional integer division, 2) Montgomery residue arithmetic, and 3) Barrett reduction. Each multiplier…
Grothendieck's inequalities for operators and bilinear forms imply some factorization results for complex m x n matrices. The theory of operator spaces provides a set up which describes 4 norm optimal factorizations of Grothendieck's sort.…
We give algorithms to factorize large integers in the duality computer. We provide three duality algorithms for factorization based on a naive factorization method, the Shor algorithm in quantum computing, and the Fermat's method in…
A method for the semiclassical quantization of chaotic maps is proposed, which is based on harmonic inversion. The power of the technique is demonstrated for the baker's map as a prototype example of a chaotic map.
We show that the quantum baker's map, a prototypical map invented for theoretical studies of quantum chaos, has a very simple realization in terms of quantum gates. Chaos in the quantum baker's map could be investigated experimentally on a…