✦ LIBER ✦

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

✍ Scribed by Noah Linden; Hervé Barjat; Ray Freeman

Book ID: 108312614
Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 97 KB
Volume: 296
Category: Article
ISSN: 0009-2614
DOI: 10.1016/s0009-2614(98)01015-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Implementation of the Deutsch–Jozsa algo

Implementation of the Deutsch–Jozsa algorithm on an ion-trap quantum computer

✍ Gulde, Stephan; Riebe, Mark; Lancaster, Gavin P. T.; Becher, Christoph; Eschner, 📂 Article 📅 2003 🏛 Nature Publishing Group 🌐 English ⚖ 215 KB

Quantum entanglement in the NMR implemen

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

✍ Arvind; Kavita Dorai; Anil Kumar 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 436 KB

An efficient implementation of the direc

An efficient implementation of the direct-SCF algorithm on parallel computer architectures

✍ Martin Feyereisen; Rick A. Kendall 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 764 KB

BLAZE™: An implementation of the Smith-W

BLAZE™: An implementation of the Smith-Waterman sequence comparison algorithm on a massively parallel computer

✍ Douglas L. Brutlag; Jean-Pierre Dautricourt; Ron Diaz; Jeff Fier; Bruce Moxon; R 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 524 KB

An efficient parallel implementation of

An efficient parallel implementation of the Monte Carlo particle simulation algorithm on a network of personal computers

✍ Robert R. van Zyl; Willem J. Perold; Hans Grobler 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 180 KB 👁 3 views

An efficient implementation of the finit

An efficient implementation of the finite-element time-domain algorithm on parallel computers using a finite-element tearing and interconnecting algorithm

✍ Umesh D. Navsariwala; Stephen D. Gedney 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB 👁 3 views

An efficient algorithm for implementing the finite-element ( ) time-domain FETD method on parallel computers is presented. An unconditionally stable implicit FETD algorithm is combined with the ( ) finite-element tearing and interconnecting FETI method. This domain decomposition algorithm con¨erges