相关论文: Poly-locality in quantum computing
We show how the quantum fast Fourier transform (QFFT) can be made exact for arbitrary orders (first for large primes). For most quantum algorithms only the quantum Fourier transform of order $2^n$ is needed, and this can be done exactly.…
We give a detailed account of the one-way quantum computer, a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states. We prove its universality, describe…
The results of local measurements on some composite quantum systems cannot be reproduced classically. This impossibility, known as quantum nonlocality, represents a milestone in the foundations of quantum theory. Quantum nonlocality is also…
We try to minimize the number of qubits needed to factor an integer of n bits using Shor's algorithm on a quantum computer. We introduce a circuit which uses 2n+3 qubits and O(n^3 lg(n)) elementary quantum gates in a depth of O(n^3) to…
Given a real closed polytope $P$, we first describe the Fourier transform of its indicator function by using iterations of Stokes' theorem. We then use the ensuing Fourier transform formulations, together with the Poisson summation formula,…
In effective models of loop quantum gravity, the onset of quantum effects is controlled by a so-called polymerisation scale. It is sometimes necessary to make this scale phase space dependent in order to obtain sensible physics. A…
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…
The objective of this paper concerns at first the motivation and the method of Shor's algorithm including an excursion into quantum mechanics and quantum computing introducing an algorithmic description of the method. The corner stone of…
Considering its relevance in the field of cryptography, integer factorization is a prominent application where Quantum computers are expected to have a substantial impact. Thanks to Shor's algorithm this peculiar problem can be solved in…
Quantum computers require quantum arithmetic. We provide an explicit construction of quantum networks effecting basic arithmetic operations: from addition to modular exponentiation. Quantum modular exponentiation seems to be the most…
Quantum singular value transformation (QSVT) enables the application of polynomial functions to the singular values of near arbitrary linear operators embedded in unitary transforms, and has been used to unify, simplify, and improve most…
An efficient numerical method is developed using the matrix product formalism for computing the properties at finite energy densities in one-dimensional (1D) many-body localized (MBL) systems. Arguing that any efficient (possibly quantum)…
Fourier transform is an essential ingredient in Shor's factoring algorithm. In the standard quantum circuit model with the gate set $\{\U(2), \textrm{CNOT}\}$, the discrete Fourier transforms $F_N=(\omega^{ij})_{N\times N},i,j=0,1,..., N-1,…
Improving over an earlier construction by Kaye and Zalka, Maslov et al. describe an implementation of Shor's algorithm which can solve the discrete logarithm problem on binary elliptic curves in quadratic depth O(n^2). In this paper we show…
Most quantum algorithms that give an exponential speedup over classical algorithms exploit the Fourier transform in some way. In Shor's algorithm, sampling from the quantum Fourier spectrum is used to discover periodicity of the modular…
In topological quantum computation the geometric details of a particle trajectory are irrelevant; only the topology matters. Taking this one step further, we consider a model of computation that disregards even the topology of the particle…
We investigate the boundary between classical and quantum computational power. This work consists of two parts. First we develop new classical simulation algorithms that are centered on sampling methods. Using these techniques we generate…
The computational efficiency of quantum mechanics can be defined in terms of the qubit circuit model, which is characterized by a few simple properties: each computational gate is a reversible transformation in a connected matrix group;…
The degree of the generators of invariant polynomial rings of is a long standing open problem since the very initial study of the invariant theory in the 19th century. Motivated by its significant role in characterizing multipartite…
Recently, Cai showed that Shor's quantum factoring algorithm fails to factor large integers when the algorithm's quantum Fourier transform (QFT) is corrupted by a vanishing level of random noise on the QFT's precise controlled rotation…