Related papers: Poly-locality in quantum computing
We present a polynomial quantum algorithm for the Abelian stabilizer problem which includes both factoring and the discrete logarithm. Thus we extend famous Shor's results. Our method is based on a procedure for measuring an eigenvalue of a…
There is a folkloric belief that a depth-$\Theta(m)$ quantum circuit is needed to estimate the trace of the product of $m$ density matrices (i.e., a multivariate trace), a subroutine crucial to applications in condensed matter and quantum…
The notion of Fourier transform is among the more important tools in analysis, which has been generalized in abstract harmonic analysis to the level of abelian locally compact groups. The aim of this paper is to further generalize the…
Recently, Halder \emph{et al.} [Phys. Rev. Lett. \textbf{122}, 040403 (2019)] proposed the concept strong nonlocality without entanglement: an orthogonal set of fully product states in multipartite quantum systems that is locally…
The model of local Turing machines is introduced, including classical and quantum ones, in the framework of matrix-product states. The locality refers to the fact that at any instance of the computation the heads of a Turing machine have…
We introduce a quantum algorithm to perform the Laplace transform on quantum computers. Already, the quantum Fourier transform (QFT) is the cornerstone of many quantum algorithms, but the Laplace transform or its discrete version has not…
Quantum mechanics requires the operation of quantum computers to be unitary, and thus makes it important to have general techniques for developing fast quantum algorithms for computing unitary transforms. A quantum routine for computing a…
We define an approximate version of the Fourier transform on $2^L$ elements, which is computationally attractive in a certain setting, and which may find application to the problem of factoring integers with a quantum computer as is…
Is quantum mechanics (QM) local or nonlocal? Different formulations/interpretations (FI) of QM, with or without hidden variables, suggest different answers. Different FI's can be viewed as different algorithms, which leads us to propose an…
Multiple polylogarithms are periods of variations of mixed Tate motives. Conjecturally, they deliver all such periods. We introduce deformations of multiple polylogarithms depending on a complex parameter h. We call them quantum…
Local Fourier analysis is a strong and well-established tool for analyzing the convergence of numerical methods for partial differential equations. The key idea of local Fourier analysis is to represent the occurring functions in terms of a…
The quantum singular value transformation has revolutionised quantum algorithms. By applying a polynomial to an arbitrary matrix, it provides a unifying picture of quantum algorithms. However, polynomials are restricted to definite parity…
We introduce a fresh scheme based on the local hidden variable models to quantify nonlocality for arbitrarily high-dimensional quantum systems. Our scheme explores the minimal amount of white noise that must be added to the system in order…
A multipartite system comprised of $n$ subsystems, each of which is described with `local variables' in ${\mathbb Z}(d)$ and with a $d$-dimensional Hilbert space $H(d)$, is considered. Local Fourier transforms in each subsystem are defined…
The mathematical problem of localizing modular functors to neighborhoods of points is shown to be closely related to the physical problem of engineering a local Hamiltonian for a computationally universal quantum medium. For genus $=0$…
Many quantum algorithms can be represented in a form of a classical circuit positioned between quantum Fourier transformations. Motivated by the search for new quantum algorithms, we turn to circuits where the latter transformation is…
We study the algebra of complex polynomials which remain invariant under the action of the local Clifford group under conjugation. Within this algebra, we consider the linear spaces of homogeneous polynomials degree by degree and construct…
Quantum computing has attracted a lot of attention in recent years. It is one of the promising candidates for the next-generation computing paradigms. Basically, there are two technical lines to realize quantum computing. One is composing…
We show that the presented real-number quantum theories, compatible with the independent source assumption, require the inclusion of a nonlocal map. This means that if the independent source assumption holds, in these models, complex-number…
We identify a sub-class of BQP that captures certain structural commonalities among many quantum algorithms including Shor's algorithms. This class does not contain all of BQP (e.g. Grover's algorithm does not fall into this class). Our…