Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0112127 · Physical Review A

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

D. R. Sypher, Ian M. Brereton, Howard M. Wiseman, B. L. Hollis, B. C. Travaglione

Published Jul 19, 2002• 5 citations
arXivHTMLPDF

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.

DOI
10.1103/physreva.66.012306

Related papers

ROM-based computation: quantum versus classical

B. C. Travaglione, Michael A. Nielsen, Howard M. Wiseman +1 more

We introduce a model of computation based on \emph{read only memory} (ROM), which allows us to compare the space-efficiency of reversible, error-free classical computation with reversible, error-free quantum computation. We show that a ROM-based quantum computer with one writable qubit is universal, whilst two writable bits are required for a universal classical ROM-based computer. We also comment on the time-efficiency advantages of quantum computation within this model.

arXiv:quant-ph/0109016•Quantum Information and Computation•Jun 1, 2002•22 citations

Simulation of NMR implementation of Deutsch-Jozsa algorithm

Varun Chappidi, Soumya Ganguly

Quantum Computation is slowly evolving as the next big innovation that would change the entire way we perceive the world around us. Even though many scientists are actively researching on it, one main hurdle is that a physical quantum computer is not readily available to everyone to work on. The present paper computationally simulates a quantum algorithm using nuclear magnetic resonance on four different kinds of molecules and shows that the spectra obtained are similar to the experimental results. Computational simulations like these would allow researchers to verify their quantum algorithms using NMR without actually having a physical device hence overcoming the hurdle.

IEEE International Advance Computing Conference•Feb 1, 2014•1 citation

Implementation of a quantum algorithm on a nuclear magnetic resonance quantum computer

J. A. Jones, M. Mosca

Quantum computing shows great promise for the solution of many difficult problems, such as the simulation of quantum systems and the factorization of large numbers. While the theory of quantum computing is fairly well understood, it has proved difficult to implement quantum computers in real physical systems. It has recently been shown that nuclear magnetic resonance (NMR) can be used to implement small quantum computers using the spin states of nuclei in carefully chosen small molecules. Here we demonstrate the use of a NMR quantum computer based on the pyrimidine base cytosine, and the implementation of a quantum algorithm to solve Deutsch’s problem (distinguishing between constant and balanced functions). This is the first successful implementation of a quantum algorithm on any physical system.

arXiv:quant-ph/9801027•The Journal of Chemical Physics•Aug 1, 1998•399 citations

Implementation of adiabatic Deutsch-Jozsa algorithm by Nuclear Magnetic Resonance

Avik Mitra, Arindam Ghosh, Ranabir Das +2 more

Quantum adiabatic algorithms is a method of solving computational problems by evolving the ground state of a slowly varying Hamiltonian. The technique uses evolution of the ground state of a slowly varying Hamiltonian to reach the required output state. The adiabatic Deutsch-Jozsa algorithm given be Saurya Das, Randy Kobes and Gabor Kunstatter [Phys. Rev. A. 65, 062301 (2002)], shows how the Deutsch-Jozsa algorithm can be implemented in N^{1/2} steps, where N=2^n and n is the number of qubits, using local adiabatic evolution. In this paper we report the experimental implementation of the adiabatic Deutsch-Jozsa algorithm in a two qubit quantum information processor by Nuclear Magnetic Resonance.

•Mar 5, 2005•0 citations

A Nuclear Magnetic Resonance Implementation of a Classical Deutsch-Jozsa Algorithm

Alastair A. Abbott, Matthias Bechmann, Cristian S. Calude +1 more

Nuclear magnetic resonance (NMR) has been widely used as a demonstrative medium for showcasing the ability for quantum computations to outperform classical ones. A large number of such experiments performed have been implementations of the Deutsch-Jozsa algorithm. It is known, however, that in some cases the Deutsch-Jozsa problem can be solved classically using as many queries to the black-box as in the quantum solution. In this paper we describe experiments in which we take the contrasting approach of using NMR as a classical computing medium, treating the nuclear spin vectors classically and utilising an alternative embedding of bits into the physical medium. This allows us to determine the actual Boolean function computed by the black-box for the n=1,2 cases, as opposed to only the nature (balanced or constant) as conventional quantum algorithms do. Discussion of these experiments leads to some clarification of the complications surrounding the comparison of different quantum algorithms, particularly black-box type algorithms.

arXiv:1110.0177•Oct 2, 2011•1 citation

Quantum information processing(QIP) and realization using nuclear magnetic resonance

Da Wei

This paper presents our theoretical and nuclear magnetic resonance(NMR) experimental work on several QIPs including quantum super dense coding(QSDC),quantum algorithms,quantum error correction,and decoherence-free subspace.The main contents are,(1) Using NMR technique,we realize two kinds of QSDC.The experimental results show that QSDC only needs to transfer(N-1) qubits during transmitting N bits classical information;(2) On NMR quantum computers,we realize three kinds of quantum algorithms that include four-qubit summing algorithm,four-qubit Deutsch-like algorithm and seven-qubit Deutsch-Jozsa algorithm;(3) We present a quantum error correction scheme based on quantum cloning.This scheme shows the relationship between quantum cloning and quantum error correction;(4) To avoid decoherence in quantum algorithms,we construct a decoherence-free subspace(DFS) by using multiple quantum coherences.The validity of this DFS is also experimentally verified on our NMR quantum computers.The DFS makes the three unaddressed protons in a CH_3 group distinguished in two-dimensional(2D) NMR.It can protect against more error operators.This idea may provide new insights into extending the number of qubits in the sense that it effectively utilizes the magnetically equivalent nuclei.

Journal of the Graduate School of the Chinese Academy of Sciences•Jan 1, 2007•0 citations
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.
Quantum Computation is slowly evolving as the next big innovation that would change the entire way we perceive the world around us. Even though many scientists are actively researching on it, one main hurdle is that a physical quantum computer is not readily available to everyone to work on. The present paper computationally simulates a quantum algorithm using nuclear magnetic resonance on four different kinds of molecules and shows that the spectra obtained are similar to the experimental results. Computational simulations like these would allow researchers to verify their quantum algorithms using NMR without actually having a physical device hence overcoming the hurdle.
Quantum computing shows great promise for the solution of many difficult problems, such as the simulation of quantum systems and the factorization of large numbers. While the theory of quantum computing is fairly well understood, it has proved difficult to implement quantum computers in real physical systems. It has recently been shown that nuclear magnetic resonance (NMR) can be used to implement small quantum computers using the spin states of nuclei in carefully chosen small molecules. Here we demonstrate the use of a NMR quantum computer based on the pyrimidine base cytosine, and the implementation of a quantum algorithm to solve Deutsch’s problem (distinguishing between constant and balanced functions). This is the first successful implementation of a quantum algorithm on any physical system.
Quantum adiabatic algorithms is a method of solving computational problems by evolving the ground state of a slowly varying Hamiltonian. The technique uses evolution of the ground state of a slowly varying Hamiltonian to reach the required output state. The adiabatic Deutsch-Jozsa algorithm given be Saurya Das, Randy Kobes and Gabor Kunstatter [Phys. Rev. A. 65, 062301 (2002)], shows how the Deutsch-Jozsa algorithm can be implemented in N^{1/2} steps, where N=2^n and n is the number of qubits, using local adiabatic evolution. In this paper we report the experimental implementation of the adiabatic Deutsch-Jozsa algorithm in a two qubit quantum information processor by Nuclear Magnetic Resonance.
Nuclear magnetic resonance (NMR) has been widely used as a demonstrative medium for showcasing the ability for quantum computations to outperform classical ones. A large number of such experiments performed have been implementations of the Deutsch-Jozsa algorithm. It is known, however, that in some cases the Deutsch-Jozsa problem can be solved classically using as many queries to the black-box as in the quantum solution. In this paper we describe experiments in which we take the contrasting approach of using NMR as a classical computing medium, treating the nuclear spin vectors classically and utilising an alternative embedding of bits into the physical medium. This allows us to determine the actual Boolean function computed by the black-box for the n=1,2 cases, as opposed to only the nature (balanced or constant) as conventional quantum algorithms do. Discussion of these experiments leads to some clarification of the complications surrounding the comparison of different quantum algorithms, particularly black-box type algorithms.
This paper presents our theoretical and nuclear magnetic resonance(NMR) experimental work on several QIPs including quantum super dense coding(QSDC),quantum algorithms,quantum error correction,and decoherence-free subspace.The main contents are,(1) Using NMR technique,we realize two kinds of QSDC.The experimental results show that QSDC only needs to transfer(N-1) qubits during transmitting N bits classical information;(2) On NMR quantum computers,we realize three kinds of quantum algorithms that include four-qubit summing algorithm,four-qubit Deutsch-like algorithm and seven-qubit Deutsch-Jozsa algorithm;(3) We present a quantum error correction scheme based on quantum cloning.This scheme shows the relationship between quantum cloning and quantum error correction;(4) To avoid decoherence in quantum algorithms,we construct a decoherence-free subspace(DFS) by using multiple quantum coherences.The validity of this DFS is also experimentally verified on our NMR quantum computers.The DFS makes the three unaddressed protons in a CH_3 group distinguished in two-dimensional(2D) NMR.It can protect against more error operators.This idea may provide new insights into extending the number of qubits in the sense that it effectively utilizes the magnetically equivalent nuclei.