Natural Computing

Algorithms on ensemble quantum computers

P. Oscar Boykin, Tal Mor, Vwani Roychowdhury, Farrokh Vatan

Published May 29, 2009• 14 citations

Abstract

In ensemble (or bulk) quantum computation, all computations are performed on an ensemble of computers rather than on a single computer. Measurements of qubits in an individual computer cannot be performed; instead, only expectation values (over the complete ensemble of computers) can be measured. As a result of this limitation on the model of computation, many algorithms cannot be processed directly on such computers, and must be modified, as the common strategy of delaying the measurements usually does not resolve this ensemble-measurement problem. Here we present several new strategies for resolving this problem. Based on these strategies we provide new versions of some of the most important quantum algorithms, versions that are suitable for implementing on ensemble quantum computers, e.g., on liquid NMR quantum computers. These algorithms are Shor's factorization algorithm, Grover's search algorithm (with several marked items), and an algorithm for quantum fault-tolerant computation. The first two algorithms are simply modified using a randomizing and a sorting strategies. For the last algorithm, we develop a classical-quantum hybrid strategy for removing measurements. We use it to present a novel quantum fault-tolerant scheme. More explicitly, we present schemes for fault-tolerant measurement-free implementation of Toffoli and σ(z)(¼) as these operations cannot be implemented "bitwise", and their standard fault-tolerant implementations require measurement.

DOI: 10.1007/s11047-009-9133-0

Related papers

Algorithms on Ensemble Quantum Computers

P. Oscar Boykin, Tal Mor, Vwani Roychowdhury +1 more

In ensemble (or bulk) quantum computation, measurements of qubits in an individual computer cannot be performed. Instead, only expectation values can be measured. As a result of this limitation on the model of computation, various important algorithms cannot be processed directly on such computers, and must be modified. We provide modifications of various existing protocols, including algorithms for universal fault--tolerant computation, Shor's factorization algorithm (which can be extended to any algorithm computing an NP function), and some search algorithms to enable processing them on ensemble quantum computers.

arXiv:quant-ph/9907067Jul 21, 19993 citations

Fault tolerant computation on ensemble quantum computers

P. Oscar Boykin, C.P. Roychowdhury, Tal Mor +1 more

International Conference on Dependable Systems & Networks/ProceedingsJan 1, 20049 citations

Shortening Grover's search algorithm for an expectation value quantum computer

David C. Collins

Quantum algorithms are conventionally formulated for implementation on a single system of qubits amenable to projective measurements. However, in expectation value quantum computation, such as nuclear magnetic resonance realizations, the computer consists of an ensemble of identical qubit-systems amenable only to expectation value measurements. The prevalent strategy in such expectation value implementations of quantum algorithms has been to retain the conventional formulation's unitary operations but modify its initialization and measurement steps appropriately. This naive approach is not optimal for Grover's algorithm and a shortened version for expectation value quantum computers is presented.

arXiv:quant-ph/0209148Sep 26, 20021 citation

Scaling Issues in Ensemble Quantum Algorithms

David C. Collins

Ensembles of quantum systems, such as liquid state NMR, have been proposed as possibilities for implementing quantum algorithms. For such implementations, projective measurement outcomes are replaced by expectation values. Although these are apparently deterministic, we point out that real implementations involve ensembles of nite size, giving probabilistic approximations to expectation values. The performance of such algorithms must be compared to their classical probabilistic counterparts. We discuss proposed scalable ensemble versions of the Deutsch-Jozsa algorithm in this context and show that their performance is worse than the classical probabilistic algorithm. Appears in Phys. Rev. A 68, 052301 (2003) \\Standard " Quantum Computing Implementations on a single quantum system amenable to projective measurements. L-qubit quantum system Pure state preparation Apply algorithm unitary Projective measurement on L0 qubit subsystem Classical computation j ii f : = Ûalg j ii x 2 f0; : : : ; 2L 0 1g with probability xj f 2 Possible solution I For useful algorithms the probability of returning x corresponding to trivial or incorrect solutions is small. I Typically a decomposition Ûalg = Ûm: : : Û1 into simple unitary operations facilitates algorithm implementation. 1 Expectation Value Quantum Computing Implementations using an ensemble of identical, non-interacting quantum systems. Ensemble of L-qubit quantum systems Mixed state preparation Apply algorithm unitary Expectation value (EV) measurements on L0 qubit subsystem

Feb 9, 20150 citations

Modified Grover’s algorithm for an expectation-value quantum computer

David C. Collins

The translation of Grover's search algorithm from its standard version, designed for implementation on a single quantum system amenable to projective measurements, into one suitable for an ensemble of quantum computers, whose outputs are expectation values of observables on individual qubits, is described in detail. A filtering scheme, which effectively determines expectation values on a limited portion of the quantum state, is presented and used to locate a single item for searches involving more than one marked item. A truncated version of Grover's algorithm, requiring fewer steps than the translated standard version but locating marked items just as successfully, is proposed. For quantum computational devices that only return expectation values, the truncated version is superior to its standard counterpart. This indicates that it is possible to modify quantum algorithms so as to reduce the required temporal resources by using the ensemble's spatial resources.

arXiv:quant-ph/0111108Physical Review AMay 7, 200212 citations

Quantum computing under real-world constraints: efficiency of an ensemble quantum algorithm and fighting decoherence by gate design

Y. Yamamoto, Cyrus P. Master

Quantum algorithms for problems such as integer factorization and database search have spurred great interest in quantum computation. However, the construction of scalable quantum computers has proved to be extremely difficult. Among the challenging requirements that must be fulfilled in the “standard model” of quantum computation, one must be able to initialize qubits into known pure states. In addition, quantum computers must be protected from noise due to unwanted interactions with their environment. This work is concerned with two theoretical issues motivated by these difficulties. First, I analyze the efficiency of an algorithm for an alternate model for quantum computation that is motivated by bulk nuclear magnetic resonance. In such ensemble systems, the initial state is not a fiducial pure state, but is instead a maximally-mixed density operator. The algorithm that I consider allows one to estimate the free energy of arbitrary spin-1/2 lattice models. To determine the efficiency of this algorithm, I calculate the computation time required to estimate the free energy to bounded error as a function of the lattice size. In the absence of stochastic fluctuations in the measurement output, it is found that the algorithm is efficient. However, evidence is presented that suggests that the algorithm becomes exponentially sensitive to fluctuations as the lattice size increases. While techniques such as quantum error-correcting codes and decoherence-free subsystem encodings have been devised to mitigate errors due to unwanted environmental couplings, these methods require many additional qubits or complicated encodings. Here, I investigate a simple approach to reduce errors in the quantum search algorithm due to a collective decoherence model. This method takes advantage of the freedom inherent in compiling the search algorithm into fundamental gates. Transition rate calculations and more rigorous quantum master equation simulations are carried out for small-qubit instances to contrast the performance of the original and modified algorithm. It is shown that the expected computational effort can be reduced by 22% for selected five-bit instances of the quantum search algorithm. While this approach does not constitute a general strategy for quantum error-correction, it illustrates the importance of judicious gate design in mitigating decoherence.

Jan 1, 20054 citations