Since Richard Feynman introduced the notion of quantum computation in 1982, various models of "quantum computers" have been proposed (R. Feynman, 1992). These models include quantum Turing machines and quantum circuits. We define another quantum computational model, one dimensional quantum cellular automata, and demonstrate that any quantum Turing machine can be efficiently simulated by a one dimensional quantum cellular automaton with constant slowdown. This can be accomplished by consideration of a restricted class of one dimensional quantum cellular automata called one dimensional partitioned quantum cellular automata. We also show that any one dimensional partitioned quantum cellular automaton can be simulated by a quantum Turing machine with linear slowdown, but the problem of efficiently simulating an arbitrary one dimensional quantum cellular automaton with a quantum Turing machine is left open. From this discussion, some interesting facts concerning these models are easily deduced.
The possibility of cloning a
d-dimensional quantum system without an ancilla is explored, extending on the economical phase-covariant cloning machine for qubits found in Phys. Rev. A 60, 2764 (1999). We prove the impossibility of constructing an economical version of the optimal universal $1\ensuremath{\rightarrow}2$ cloning machine in any dimension. We also show, using an ansatz on the generic form of cloning machines, that the
d-dimensional $1\ensuremath{\rightarrow}2$ phase-covariant cloner, which optimally clones all balanced superpositions with arbitrary phases, can be realized economically only in dimension
d=2. The used ansatz is supported by numerical evidence up to
d=7. An economical phase-covariant cloner can nevertheless be constructed for
d>2, albeit with a slightly lower fidelity than that of the optimal cloner requiring an ancilla. Finally, using again an ansatz on cloning machines, we show that an economical version of the $1\ensuremath{\rightarrow}2$ Fourier-covariant cloner, which optimally clones the computational basis and its Fourier transform, is also possible only in dimension
d=2.
While exact cloning of an unknown quantum state is prohibited by the linearity of quantum mechanics, approximate cloning is possible and has been used, e.g., to derive limits on the security of quantum communication protocols. In the case of asymmetric cloning, the information from the input state is distributed asymmetrically between the different output states. Here, we consider asymmetric phase-covariant cloning, where the goal is to optimally transfer the phase information from a single input qubit to different output qubits. We construct an optimal quantum cloning machine for two qubits that does not require ancilla qubits and implement it on an NMR quantum information processor.
We derive the optimal $N\ensuremath{\rightarrow}M$ phase-covariant quantum cloning for equatorial states in dimension
d with
M=kd+N,
k integer. The cloning maps are optimal for both global and single-qudit fidelity. The map is achieved by an ``economical'' cloning machine, which works without ancilla.