Direkt zum Inhalt

Schuch, Norbert ; Siewert, Jens

Programmable networks for quantum algorithms

Article

Schuch, Norbert and Siewert, Jens (2003) Programmable networks for quantum algorithms. Physical Review Letters 91, 027902.

DOI to cite this document: 10.5283/epub.1518


Abstract

The implementation of a quantum computer requires the realization of a large number of N-qubit unitary operations which represent the possible oracles or which are part of the quantum algorithm. Until now there have been no standard ways to uniformly generate whole classes of N-qubit gates. We develop a method to generate arbitrary controlled phase-shift operations with a single network of ...

The implementation of a quantum computer requires the realization of a large number of N-qubit unitary operations which represent the possible oracles or which are part of the quantum algorithm. Until now there have been no standard ways to uniformly generate whole classes of N-qubit gates. We develop a method to generate arbitrary controlled phase-shift operations with a single network of one-qubit and two-qubit operations. This kind of network can be adapted to various physical implementations of quantum computing and is suitable to realize the Deutsch-Jozsa algorithm as well as Grover's search algorithm.



Involved Institutions


Details

Item typeArticle
Journal or Publication TitlePhysical Review Letters
PublisherAMER PHYSICAL SOC
Place of PublicationCOLLEGE PK
Volume91
Page Range027902
DateJuly 2003
Date of publication05 Aug 2009 13:30
InstitutionsPhysics > Institute of Theroretical Physics
Identification Number
ValueType
10.1103/PhysRevLett.91.027902DOI
KeywordsDEUTSCH-JOZSA ALGORITHM; SEARCH ALGORITHM; COMPUTATION; IMPLEMENTATION; COMPUTER; UNIVERSAL; GATES;
Dewey Decimal Classification500 Science > 530 Physics
StatusPublished
RefereedYes, this version has been refereed
Created at the University of RegensburgYes
Item ID1518

Export bibliographical data

Owner only: item control page

nach oben