✦ LIBER ✦

Implementation of the quantum order-finding algorithm on two qudits

✍ Scribed by V. E. Zobov; V. P. Shauro; A. S. Ermilov

Book ID: 110168757
Publisher: SP MAIK Nauka/Interperiodica
Year: 2008
Tongue: English
Weight: 212 KB
Volume: 87
Category: Article
ISSN: 0021-3640
DOI: 10.1134/s0021364008060143

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

An implementation of the Deutsch–Jozsa a

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

✍ Noah Linden; Hervé Barjat; Ray Freeman 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 97 KB

Two approaches to the concurrent impleme

Two approaches to the concurrent implementation of the prime factor algorithm on a hypercube

✍ Aloisio, G. ;Lopinto, E. ;Veneziani, N. ;Fox, G. C. ;Kim, J. S. 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 587 KB

A Higher-Order Compact Method in Space a

A Higher-Order Compact Method in Space and Time Based on Parallel Implementation of the Thomas Algorithm

✍ Alex Povitsky; Philip J. Morris 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 143 KB

In this study we propose a novel method to parallelize high-order compact numerical algorithms for the solution of three-dimensional PDEs in a space-time domain. For such a numerical integration most of the computer time is spent in computation of spatial derivatives at each stage of the Runge-Kutta

Algorithm for finding one of the largest

Algorithm for finding one of the largest common subgraphs of two three-dimensional graph structures

✍ Sumio Masuda; Hiroyuki Yoshioka; Eiichi Tanaka 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 176 KB 👁 1 views

Given two connected graphs G a = (V a , E a ) and G b = (V b , E b ) with three-dimensional structures. Let n a = |V a |, m a = |E a |, n b = |V b |, and m b = |E b |. Let the maxi- mum order of a vertex in G a (G b ) be l a (l b ). Initially this paper offers a method to find a largest common subgr

Performance of a benchmark parallel impl

Performance of a benchmark parallel implementation of the Van Slyke and Wets algorithm for two-stage stochastic programs on the Sequent/Balance

✍ Ariyawansa, K. A. ;Hudson, D. D. 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 1015 KB

We describe a benchmark parallel version of the Van Slyke and Wets (1969) algorithm for two-stage stochastic programs and an implementation of that algorithm on the Sequent/Balance. We also report results of a numerical experiment using random test problems and our implementation. These performance