Related papers: On quantum computation of Kloosterman sums
An outstanding problem in quantum computing is the calculation of entanglement, for which no closed-form algorithm exists. Here we solve that problem, and demonstrate the utility of a quantum neural computer, by showing, in simulation, that…
Quantum cloning machine for arbitrary mixed states in symmetric subspace is proposed. This quantum cloning machine can be used to copy part of the output state of another quantum cloning machine and is useful in quantum computation and…
The main features of quantum computing are described in the framework of spin resonance methods. Stress is put on the fact that quantum computing is in itself nothing but a re-interpretation (fruitful indeed) of well-known concepts. The…
Recently there has been a large number of works on bilinear sums with Kloosterman sums and on sums of Kloosterman sums twisted by arithmetic functions. Motivated by these, we consider several related new questions about sums of Kloosterman…
Quantum process tomography (QPT) methods aim at identifying a given quantum process. The present paper focuses on the estimation of a unitary process. This class is of particular interest because quantum mechanics postulates that the…
This article is a short introduction to and review of the cluster-state model of quantum computation, in which coherent quantum information processing is accomplished via a sequence of single-qubit measurements applied to a fixed quantum…
We discuss a model for quantum computing with initially mixed states. Although such a computer is known to be less powerful than a quantum computer operating with pure (entangled) states, it may efficiently solve some problems for which no…
We describe an algorithm for quantum state tomography that converges in polynomial time to an estimate, together with a rigorous error bound on the fidelity between the estimate and the true state. The result suggests that state tomography…
We introduce two kinds of quantum algorithms to explore microcanonical and canonical properties of many-body systems. The first one is a hybrid quantum algorithm that, given an efficiently preparable state, computes expectation values in a…
In this paper, we give quantum algorithms for two fundamental computation problems: solving polynomial systems over finite fields and optimization where the arguments of the objective function and constraints take values from a finite field…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…
We discuss the usefulness of quantum cloning and present examples of quantum computation tasks for which cloning offers an advantage which cannot be matched by any approach that does not resort to it. In these quantum computations, we need…
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…
We prove, using combinatorics and Kloosterman sum technology that if $A \subset {\Bbb F}_q$, a finite field with $q$ elements, and $q^{{1/2}} \lesssim |A| \lesssim q^{{7/10}}$, then $\max \{|A+A|, |A \cdot A|\} \gtrsim…
The cluster state model for quantum computation [Phys. Rev. Lett. 86, 5188] outlines a scheme that allows one to use measurement on a large set of entangled quantum systems in what is known as a cluster state to undertake quantum…
Quantum state tomography is a technique in quantum information science used to reconstruct the density matrix of an unknown quantum state, providing complete information about the quantum state. It is of significant importance in fields…
In this thesis, we investigate whether quantum algorithms can be used in the field of machine learning for both long and near term quantum computers. We will first recall the fundamentals of machine learning and quantum computing and then…
Quantum computing is a promising new area of computing with quantum algorithms offering a potential speedup over classical algorithms if fault tolerant quantum computers can be built. One of the first applications of the classical computer…
Systems of spin 1, such as triplet pairs of spin-1/2 fermions (like orthohydrogen nuclei) make useful three-terminal elements for quantum computation, and when interconnected by qubit equality relations are universal for quantum…
A quantum computer is a hypothetical device in which the laws of quantum mechanics are used to introduce a degree of parallelism into computations and which could therefore significantly improve on the computational speed of a classical…