Read-only-memory-based quantum computation: Experimental explorations using nuclear magnetic resonance and future prospects

Sypher, DR, Brereton, IM, Wiseman, HM, Hollis, BL and Travaglione, BC (2002) Read-only-memory-based quantum computation: Experimental explorations using nuclear magnetic resonance and future prospects. Physical Review A, 66 1: 123061-1230611. doi:10.1103/PhysRevA.66.012306

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads
UQ61590_OA.pdf Full text (open access) application/pdf 143.01KB 4

Author Sypher, DR
Brereton, IM
Wiseman, HM
Hollis, BL
Travaglione, BC
Title Read-only-memory-based quantum computation: Experimental explorations using nuclear magnetic resonance and future prospects
Journal name Physical Review A   Check publisher's open access policy
ISSN 1050-2947
Publication date 2002
Sub-type Article (original research)
DOI 10.1103/PhysRevA.66.012306
Open Access Status File (Publisher version)
Volume 66
Issue 1
Start page 123061
End page 1230611
Total pages 11
Editor B Crasemann
Place of publication United States
Publisher American Physical Society
Collection year 2002
Language eng
Subject C1
240201 Theoretical Physics
780102 Physical sciences
Abstract Read-only-memory-based (ROM-based) quantum computation (QC) is an alternative to oracle-based QC. It has the advantages of being less magical, and being more suited to implementing space-efficient computation (i.e., computation using the minimum number of writable qubits). Here we consider a number of small (one- and two-qubit) quantum algorithms illustrating different aspects of ROM-based QC. They are: (a) a one-qubit algorithm to solve the Deutsch problem; (b) a one-qubit binary multiplication algorithm; (c) a two-qubit controlled binary multiplication algorithm; and (d) a two-qubit ROM-based version of the Deutsch-Jozsa algorithm. For each algorithm we present experimental verification using nuclear magnetic resonance ensemble QC. The average fidelities for the implementation were in the ranges 0.9-0.97 for the one-qubit algorithms, and 0.84-0.94 for the two-qubit algorithms. We conclude with a discussion of future prospects for ROM-based quantum computation. We propose a four-qubit algorithm, using Grover's iterate, for solving a miniature real-world problem relating to the lengths of paths in a network.
Keyword Optics
Physics, Atomic, Molecular & Chemical
Deutsch-jozsa Algorithm
Search Algorithm
Implementation
Computer
Entanglement
Q-Index Code C1

Document type: Journal Article
Sub-type: Article (original research)
Collections: Excellence in Research Australia (ERA) - Collection
Centre for Advanced Imaging Publications
 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in Thomson Reuters Web of Science Article
Scopus Citation Count Cited 0 times in Scopus Article
Google Scholar Search Google Scholar
Created: Tue, 14 Aug 2007, 17:17:08 EST