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

数理解析研究所講究録

Implememtation of the Coilins-Kim-Holton Algorithm to Solve the Deutsch's Problem on One-,Two-,and Three-Qubit NMR Quantum Computers (量子情報と量子カオスの数理)

Ushio Sakaguchi, Hiroshi Ozawa, Chikara Amano, Toshio Fukumi, William S. Price

Published Apr 1, 2000• 0 citations
OpenAlex

Related papers

An implementation of the Deutsch–Jozsa algorithm on a three-qubit NMR quantum computer

Noah Linden, Hervé Barjat, Ray Freeman

arXiv:quant-ph/9808039•Chemical Physics Letters•Oct 1, 1998•135 citations

Phase-creation algorithm to solve an extended Deutsch problem with an implementation on an NMR quantum computer (量子情報とその周辺分野の解析的研究 研究集会報告集)

宏 小澤

数理解析研究所講究録•May 1, 2002•0 citations

Implementation of a Deutsch-like quantum algorithm utilizing entanglement at the two-qubit level on an NMR quantum-information processor

Kavita Dorai, Arvind, Anil Kumar

We describe the NMR implementation of a recently proposed quantum algorithm involving quantum entanglement at the level of two qubits. The algorithm solves a generalization of the Deutsch problem, and distinguishes between even and odd functions using fewer function calls than is possible classically. The manipulation of entangled states of the two qubits is essential here, unlike the Deutsch-Jozsa algorithm and Grover's search algorithm for two bits.

arXiv:quant-ph/0006103•Physical Review A•Feb 9, 2001•27 citations

Efficient algorithms for NMR quantum computers with small qubits

Noboru Kunihiro, Shigeru Yamashita

New Generation Computing•Dec 1, 2003•0 citations

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

D. R. Sypher, Ian M. Brereton, Howard M. Wiseman +2 more

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.

arXiv:quant-ph/0112127•Physical Review A•Jul 19, 2002•5 citations

Quantum algorithms for bio-molecular solutions to the satisfiability problem on a quantum computer

Weng-Long Chang, Ting-Ting Ren, Jun Luo +2 more

We demonstrate that the logic computation performed by the DNA-based algorithm for solving general cases of the satisfiability problem can be implemented by our proposed quantum algorithm on the quantum machine proposed by Deutsch. Moreover, we also prove that the logic computation by the bio-molecular operations proposed by Adleman can be implemented by quantum gates (for example, the Hadamard gate, NOT, CNOT, and CCNOT) on the quantum machine. Furthermore, those NP-complete problems solved on a bio-molecular computer are also solvable on a quantum computer. To test our theory, we carry out a three-qubit NMR experiment for solving the simplest satisfiability problem.

IEEE Congress on Evolutionary Computation (CEC)•Jun 1, 2008•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.
We demonstrate that the logic computation performed by the DNA-based algorithm for solving general cases of the satisfiability problem can be implemented by our proposed quantum algorithm on the quantum machine proposed by Deutsch. Moreover, we also prove that the logic computation by the bio-molecular operations proposed by Adleman can be implemented by quantum gates (for example, the Hadamard gate, NOT, CNOT, and CCNOT) on the quantum machine. Furthermore, those NP-complete problems solved on a bio-molecular computer are also solvable on a quantum computer. To test our theory, we carry out a three-qubit NMR experiment for solving the simplest satisfiability problem.