This paper provides necessary and sufficient conditions for constructing a universal
quantum computer over continuous variables. As an example, it is shown how a universal …

It is shown that the Fourier transform preceding the final measurement in Shor's algorithm for
factorization on a quantum computer can be carried out in a semiclassical way by using the …

If the bits of computers are someday scaled down to the size of individual atoms, quantum
mechanical effects may profoundly change the nature of computation itself. The wave …

Universal Quantum Simulators Page 1 33. G. Felsenfeld et al., J. Am. Chem. Soc. 79, 2023 (1957);
AG Letai et al., Biochemistry 27, 9108 (1988). 34. M. Riley, Microbiol. Rev. 57, 862 (1993) …

A constructive method for simulating small-scale quantum circuits by use of linear optical
devices is presented. It relies on the representation of several quantum bits by a single …

Quantum computing promises to solve problems which are intractable on digital computers.
Highly parallel quantum algorithms can decrease the computational time for some problems …

After a brief introduction to the principles and promise of quantum information processing,
the requirements for the physical implementation of quantum computation are discussed …

In the last few years, theoretical study of quantum systems serving as computational devices
has achieved tremendous progress. We now have strong theoretical evidence that quantum …

We propose an implementation of a quantum computer to solve Deutsch's problem, which
requires exponential time on a classical computer but only linear time with quantum …

Abstract 1 Qubits, gates and networks Consider the two binary strings, 011,(1.1) 111.(1.2)
The first one can represent, for example, the number 3 (in binary) and the second one the …