Please use this identifier to cite or link to this item:
Scopus Web of Science® Altmetric
Type: Journal article
Title: Construction of a universal quantum computer
Author: Lagana, A.
Lohe, M.
Von Smekal, L.
Citation: Physical Review A: Atomic, Molecular and Optical Physics, 2009; 79(5):2322-1-2322-11
Publisher: American Physical Soc
Issue Date: 2009
ISSN: 1050-2947
Statement of
Antonio A. Lagana, M. A. Lohe, and Lorenz von Smekal
Abstract: We construct a universal quantum computer following Deutsch’s original proposal of a universal quantum Turing machine (UQTM). Like Deutsch’s UQTM, our machine can emulate any classical Turing machine and can execute any algorithm that can be implemented in the quantum gate array framework but under the control of a quantum program, and hence is universal. We present the architecture of the machine, which consists of a memory tape and a processor and describe the observables that comprise the registers of the processor and the instruction set, which includes a set of operations that can approximate any unitary operation to any desired accuracy and hence is quantum computationally universal. We present the unitary evolution operators that act on the machine to achieve universal computation and discuss each of them in detail and specify and discuss explicit program halting and concatenation schemes. We define and describe a set of primitive programs in order to demonstrate the universal nature of the machine. These primitive programs facilitate the implementation of more complex algorithms and we demonstrate their use by presenting a program that computes the NAND function, thereby also showing that the machine can compute any classically computable function.
Keywords: Quantum gates
Turing machines
Rights: © 2009 The American Physical Society
DOI: 10.1103/PhysRevA.79.052322
Published version:
Appears in Collections:Aurora harvest 5
Physics publications

Files in This Item:
File Description SizeFormat 
hdl_55035.pdfPublished version 155.99 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.