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

Physical Review A

Experimental demonstration of deterministic one-way quantum computation on a NMR quantum computer

Chenyong Ju, Jing Zhu, Xinhua Peng, Bo Chong, Xianyi Zhou, Jiangfeng Du

Published Jan 25, 2010• 12 citations
Publisher

Abstract

One-way quantum computing is an important and novel approach to quantum computation. By exploiting the existing particle-particle interactions, we report an experimental realization of the complete process of deterministic one-way quantum Deutsch-Josza algorithm in NMR, including graph state preparation, single-qubit measurements, and feed-forward corrections. The findings in our experiment may shed light on the future scalable one-way quantum computation.

DOI
10.1103/physreva.81.012322

Related papers

Experimental demonstration of deterministic one-way quantum computing on a NMR quantum computer

Chenyong Ju, Jing Zhu, Xinhua Peng +3 more

One-way quantum computing is an important and novel approach to quantum computation. By exploiting the existing particle-particle interactions, we report the first experimental realization of the complete process of deterministic one-way quantum Deutsch-Josza algorithm in NMR, including graph state preparation, single-qubit measurements and feed-forward corrections. The findings in our experiment may shed light on the future scalable one-way quantum computation.

arXiv:0806.0907•Jun 5, 2008•0 citations

Experimental demonstration of one-way quantum computation on an ensemble quantum computer

Chenyong Ju, Jing Zhu, Xinhua Peng +3 more

One-way quantum computing is an important and novel approach to quantum computation. By exploiting the existing particle-particle interactions, we report the first experimental realization of the complete process of deterministic one-way quantum Deutsch-Josza algorithm in NMR, including graph state preparation, single-qubit measurements and feed-forward corrections. The findings in our experiment may shed light on the future scalable one-way quantum computation.

•Jun 5, 2008•0 citations

Experimental Realization of Deutsch’s Algorithm in a One-Way Quantum Computer

Mark Tame, Robert Prevedel, Mauro Paternostro +3 more

We report the first experimental demonstration of an all-optical one-way implementation of Deutsch's quantum algorithm on a four-qubit cluster state. All the possible configurations of a balanced or constant function acting on a two-qubit register are realized within the measurement-based model for quantum computation. The experimental results are in excellent agreement with the theoretical model, therefore demonstrating the successful performance of the algorithm.

arXiv:quant-ph/0611186•Physical Review Letters•Apr 2, 2007•124 citations

Quantum entanglement in the NMR implementation of the Deutsch-Jozsa algorithm

Arvind, *, Kavita Dorai, Anil Kumar

A scheme to execute an \\eta-bit Deutsch-Jozsa (DJ) algorithm using \\eta qubits has been implemented for up to three qubits on an NMR quantum computer. For the one- and the two-bit Deutsch problem, the qubits do not get entangled, and the NMR implementation is achieved without using spin-spin interactions. It is for the three-bit case, that the manipulation of entangled states becomes essential. The interactions through scalar J-couplings in NMR spin systems have been exploited to implement entangling transformations required for the three bit DJ algorithm.

•May 1, 2001•13 citations

A prototype quantum computer using nuclear spins in liquid solution

James S. Harris, Isaac L. Chuang, Matthias Steffen

Quantum computers can potentially solve real and relevant mathematical and physical problems that are intractable using classical machines. However, the experimental realization of quantum computers represents a significant challenge, because several opposing experimental requirements must be met. A set of coupled quantum bits must be manipulated and measured while coherently retaining entangled quantum states. Yet the manipulation and measurement processes almost inevitably lead to the decay of these fragile states. This thesis work takes significant steps towards building a practical quantum computer using nuclear spins and liquid state nuclear magnetic resonance (NMR) techniques. I present experimental results for proof of principle of quantum computing in a series of small implementations of quantum algorithms, culminating in the implementation of an adiabatic quantum optimization algorithm. The performance of adiabatic algorithms compared with classical optimization methods is unknown, but small quantum computers could provide crucial insight into answering this question. Furthermore, adiabatic algorithms also shed new light on the usefulness of quantum resources for computational tasks and hence they represent an important class of algorithms. The second part of this thesis presents several methods developed for improving the control over NMR quantum computing experiments. Even though liquid state NMR quantum computers have well known and accepted scaling limitations, the developed tools are of general use. I will show how several tools are directly transferable to two other implementations of quantum computers; one using optical methods and the other using loops of superconducting material. This work provides insight into what is needed to build a practical quantum computer, and delivers several tools and techniques that will be useful in future large-scale implementations of quantum computers.

•Jan 1, 2003•1 citation

Deterministic one-way logic gates on a cloud quantum computer

Zhi-Peng Yang, Huan-Yu Ku, Alakesh Baishya +6 more

One-way quantum computing is a promising candidate for fault-tolerant quantum computing. Here, we propose protocols to realize a deterministic one-way controlled-not (cnot) gate and one-way $X$ rotations on current quantum-computing platforms. By applying a delayed-choice scheme, we overcome a limit of most currently available quantum computers, which are unable to implement further operations on measured qubits or operations conditioned on measurement results from other qubits. Moreover, we decrease the error rate of the one-way logic gates, compared to the original protocol using local operations and classical communication. In addition, we apply our deterministic one-way cnot gate in the Deutsch-Jozsa algorithm to show the feasibility of our proposal. We demonstrate all these one-way gates and algorithms by running experiments on the cloud quantum-computing platform IBM Quantum Experience.

arXiv:2108.03865•Physical Review A•Apr 18, 2022•13 citations
One-way quantum computing is an important and novel approach to quantum computation. By exploiting the existing particle-particle interactions, we report an experimental realization of the complete process of deterministic one-way quantum Deutsch-Josza algorithm in NMR, including graph state preparation, single-qubit measurements, and feed-forward corrections. The findings in our experiment may shed light on the future scalable one-way quantum computation.
A scheme to execute an \\eta-bit Deutsch-Jozsa (DJ) algorithm using \\eta qubits has been implemented for up to three qubits on an NMR quantum computer. For the one- and the two-bit Deutsch problem, the qubits do not get entangled, and the NMR implementation is achieved without using spin-spin interactions. It is for the three-bit case, that the manipulation of entangled states becomes essential. The interactions through scalar J-couplings in NMR spin systems have been exploited to implement entangling transformations required for the three bit DJ algorithm.
Quantum computers can potentially solve real and relevant mathematical and physical problems that are intractable using classical machines. However, the experimental realization of quantum computers represents a significant challenge, because several opposing experimental requirements must be met. A set of coupled quantum bits must be manipulated and measured while coherently retaining entangled quantum states. Yet the manipulation and measurement processes almost inevitably lead to the decay of these fragile states. This thesis work takes significant steps towards building a practical quantum computer using nuclear spins and liquid state nuclear magnetic resonance (NMR) techniques. I present experimental results for proof of principle of quantum computing in a series of small implementations of quantum algorithms, culminating in the implementation of an adiabatic quantum optimization algorithm. The performance of adiabatic algorithms compared with classical optimization methods is unknown, but small quantum computers could provide crucial insight into answering this question. Furthermore, adiabatic algorithms also shed new light on the usefulness of quantum resources for computational tasks and hence they represent an important class of algorithms. The second part of this thesis presents several methods developed for improving the control over NMR quantum computing experiments. Even though liquid state NMR quantum computers have well known and accepted scaling limitations, the developed tools are of general use. I will show how several tools are directly transferable to two other implementations of quantum computers; one using optical methods and the other using loops of superconducting material. This work provides insight into what is needed to build a practical quantum computer, and delivers several tools and techniques that will be useful in future large-scale implementations of quantum computers.
One-way quantum computing is a promising candidate for fault-tolerant quantum computing. Here, we propose protocols to realize a deterministic one-way controlled-not (cnot) gate and one-way XXX rotations on current quantum-computing platforms. By applying a delayed-choice scheme, we overcome a limit of most currently available quantum computers, which are unable to implement further operations on measured qubits or operations conditioned on measurement results from other qubits. Moreover, we decrease the error rate of the one-way logic gates, compared to the original protocol using local operations and classical communication. In addition, we apply our deterministic one-way cnot gate in the Deutsch-Jozsa algorithm to show the feasibility of our proposal. We demonstrate all these one-way gates and algorithms by running experiments on the cloud quantum-computing platform IBM Quantum Experience.