相关论文: Quantum computation from a quantum logical perspec…
We explore in the framework of Quantum Computation the notion of computability, which holds a central position in Mathematics and Theoretical Computer Science. A quantum algorithm that exploits the quantum adiabatic processes is considered…
Quantum algorithms use the principles of quantum mechanics, as for example quantum superposition, in order to solve particular problems outperforming standard computation. They are developed for cryptography, searching, optimisation,…
Shor's powerful quantum algorithm for factoring represents a major challenge in quantum computation and its full realization will have a large impact on modern cryptography. Here we implement a compiled version of Shor's algorithm in a…
Quantum algorithms for factoring and discrete logarithm have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the possibility of extending this general viewpoint to finding hidden…
Pollard's Rho is a method for solving the integer factorization problem. The strategy searches for a suitable pair of elements belonging to a sequence of natural numbers that given suitable conditions yields a nontrivial factor. In…
We report an experimental demonstration of a complied version of Shor's algorithm using four photonic qubits. We choose the simplest instance of this algorithm, that is, factorization of N=15 in the case that the period $r=2$ and exploit a…
Quantum computers are able to outperform classical algorithms. This was long recognized by the visionary Richard Feynman who pointed out in the 1980s that quantum mechanical problems were better solved with quantum machines. It was only in…
Harrow, Hassidim, and Lloyd showed that for a suitably specified $N \times N$ matrix $A$ and $N$-dimensional vector $\vec{b}$, there is a quantum algorithm that outputs a quantum state proportional to the solution of the linear system of…
In this Letter, we construct the quantum algorithms for the Simon problem and the period-finding problem, which do not require initializing the auxiliary qubits involved in the process of functional evaluation but are as efficient as the…
Shor's quantum factoring algorithm finds the prime factors of a large number exponentially faster than any other known method a task that lies at the heart of modern information security, particularly on the internet. This algorithm…
It is proposed that the ability for a quantum circuit to thermalize under time evolution is a valid way to compute linear algebra problems. The algorithm makes use of the eigenstate thermalization hypothesis and full ergodicity in quantum…
The development of tailored materials for specific applications is an active field of research in chemistry, material science and drug discovery. The number of possible molecules that can be obtained from a set of atomic species grow…
We present a quantum algorithm that additively approximates the value of a tensor network to a certain scale. When combined with existing results, this provides a complete problem for quantum computation. The result is a simple new way of…
The fundamental algebraic concepts of quantum mechanics, as expressed by many authors, are reviewed and translated into the framework of the relatively new non-distributive system of Boolean fractions (also called conditional events or…
Quantum computers are designed to outperform standard computers by running quantum algorithms. Areas in which quantum algorithms can be applied include cryptography, search and optimisation, simulation of quantum systems, and solving large…
Quantum computers promise to efficiently solve important problems that are intractable on a conventional computer. Quantum computational algorithms have the potential to be an exciting new way of studying quantum cosmology. In quantum…
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. In effect, they follow the same logical paradigm as (multi-particle)…
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…
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…
Linear differential equations are ubiquitous in science and engineering. Quantum computers can simulate quantum systems, which are described by a restricted type of linear differential equations. Here we extend quantum simulation algorithms…