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

Matrix-product-state simulation of an extended Brüschweiler bulk-ensemble database search

Akira SaiToh, Masahiro Kitagawa

Published Jun 26, 2006• 8 citations
Publisher

Abstract

Br\"uschweiler's database search in a spin Liouville space can be efficiently simulated on a conventional computer without error as long as the simulation cost of the internal circuit of an oracle function is polynomial, unlike the fact that in true NMR experiments, it suffers from an exponential decrease in the variation of a signal intensity. With the simulation method using the matrix-product-state proposed by Vidal [G. Vidal, Phys. Rev. Lett. 91, 147902 (2003)], we perform such a simulation. We also show the extensions of the algorithm without utilizing the $J$-coupling or $DD$-coupling splitting of frequency peaks in observation: searching can be completed with a single query in polynomial postoracle circuit complexities in an extension; multiple solutions of an oracle can be found in another extension whose query complexity is linear in the key length and in the number of solutions (this extension is to find all of marked keys). These extended algorithms are also simulated with the same simulation method.

DOI
10.1103/physreva.73.062332

Related papers

Implementation of Liouville space search algorithm on strongly dipolar coupled nuclear spins

Tata Gopinath, Anil Kumar

Liouville space search algorithm [Bruschweiler, Phys. Rev. Lett. {\bf 85}, 4815(2000).] utilizes mixed initial states of the ensemble, and has been successfully implemented earlier in weakly coupled spins, in which a spin can be identified as a qubit. It has recently been demonstrated that n-strongly coupled spins can be collectively treated as an n-qubit system. Application of algorithms in such systems, requires new approaches using transition selective pulses rather than qubit selective pulses. This work develops a modified version of Liouville space search algorithm, which is applicable for strongly as well as weakly coupled spins. All the steps of the algorithm, can be implemented by using transition selective pulses. Experimental implementation is carried out on a strongly dipolar coupled four qubit system.

arXiv:0909.4235•Sep 23, 2009•0 citations

Constant‐time solution to database searching by NMR ensemble computing

Chih-Cheng Hsueh, C.‐Y. Chen

Abstract Brüschweiler's Ensemble algorithm requires n = log N queries to discover the wanted object from the database of the size N. In this paper, we use a new oracle query function g(.) to improve Brüschweiler's algorithm such that only one query is needed for searching the single object. Our algorithm extends from one ancillary qubit to n ancillary qubits. We then construct the oracle query function g(.) satisfying g(x) = 0 for all input x, except for one, say x = z, where g(z) = z. We first prepare 2n qubits, including n qubits for representing the elements and n ancillary qubits for storing the result of the oracle query function. After one query, we obtain z by measuring these ancillary qubits. Our algorithm can efficiently discover the wanted object if N ≤ 230 according to current NMR spectrometer technology.

Fortschritte der Physik•Apr 18, 2006•1 citation

Solving the quantum search problem in polynomial time on an NMR quantum computer

Xijia Miao

The quantum search problem is an important problem due to the fact that a general NP problem can be solved efficiently by an unsorted quantum search algorithm. Here it has been shown that the quantum search problem could be solved in polynomial time on an NMR quantum computer. The NMR ensemble quantum computation is based on the quantum mechanical unitary dynamics that both a closed quantum system and its ensemble obey the same quantum mechanical unitary dynamics instead of on the pseudopure state or the effective pure state of the classical NMR quantum computation. Based on the new principle the conventional NMR multiple-quantum spectroscopy has been developed to solve experimentally the search problem. The solution information of the search problem is first loaded on the unitary evolution propagator which is constructed with the oracle unitary operation and oracle-independent unitary operations and is used to excite the multiple-quantum coherence in a spin ensemble. Then the multiple- quantum spectroscopy is used to extract experimentally the solution information. It has been discussed how to enhance the output NMR signal of the quantum search NMR multiple-quantum pulse sequence and some approaches to enhancing the NMR signal are also proposed. The present work could be helpful for conventional high field NMR machines to solve efficiently the quantum search problem.

arXiv:quant-ph/0206102•Jun 16, 2002•7 citations

Novel Strategy for Database Searching in Spin Liouville Space by NMR Ensemble Computing

Rafael Brüschweiler

Quantum computing by nuclear magnetic resonance using pseudopure spin states is bound by the maximal speed of quantum computing algorithms operating on pure states. In contrast to these quantum computing algorithms, a novel algorithm for searching an unsorted database is presented here that operates on truly mixed states in spin Liouville space. It provides an exponential speedup over Grover's quantum search algorithm with the sensitivity scaling exponentially with the number of spins, as for pseudopure state implementations. The minimal decoherence time required is exponentially shorter than that for Grover's algorithm.

Physical Review Letters•Nov 27, 2000•36 citations

Fetching marked items from an unsorted database in NMR ensemble computing

Xiao Li, Gui‐Lu Long

The speedup of an unsorted database search has always been a challenging problem not only in classical computation but also in quantum computation. We propose a fetching algorithm for a Liouville space nuclear magnetic resonance (NMR) ensemble computing to fetch a marked item from an unsorted database directly. This algorithm achieves the absolute optimum in an unsorted database search problem: a single query. In fact, this algorithm also works well for fetching several unknown numbers of marked items. The computer simulation realization of the algorithm in a three-qubit homonuclear spin system is also presented. In addition, a compromised version of the algorithm, which reduces the demand on the structure of the molecules for the NMR experiment, is also devised.

arXiv:quant-ph/0112162•Physical Review A•Nov 22, 2002•25 citations

Experimental realization of the Brüschweiler’s algorithm in a homonuclear system

Xiao Li, Gui‐Lu Long, Haiyang Yan +1 more

Compared with classical search algorithms, Grover quantum algorithm [L. K. Grover, Phys. Rev. Lett. 79, 325 (1997)] achieves quadratic speedup and Brüschweiler hybrid quantum algorithm [R. Brüschweiler, Phys. Rev. Lett. 85, 4815 (2000)] achieves an exponential speedup. In this paper, we report the experimental realization of the Brüschweiler algorithm in a three-qubit nuclear magnetic resonance ensemble system. The pulse sequences are used for the algorithms and the measurement method used here is improved on that used by Brüschweiler, namely, instead of quantitatively measuring the spin projection of the ancilla bit, we utilize the shape of the ancilla bit spectrum. By simply judging the downwardness or upwardness of the corresponding peaks in an ancilla bit spectrum, the bit value of the marked state can be read out, especially the geometric nature of this read-out can make the results more robust against errors.

arXiv:quant-ph/0112161•The Journal of Chemical Physics•Aug 15, 2002•11 citations
Br"uschweiler's database search in a spin Liouville space can be efficiently simulated on a conventional computer without error as long as the simulation cost of the internal circuit of an oracle function is polynomial, unlike the fact that in true NMR experiments, it suffers from an exponential decrease in the variation of a signal intensity. With the simulation method using the matrix-product-state proposed by Vidal [G. Vidal, Phys. Rev. Lett. 91, 147902 (2003)], we perform such a simulation. We also show the extensions of the algorithm without utilizing the JJJ-coupling or DDDDDD-coupling splitting of frequency peaks in observation: searching can be completed with a single query in polynomial postoracle circuit complexities in an extension; multiple solutions of an oracle can be found in another extension whose query complexity is linear in the key length and in the number of solutions (this extension is to find all of marked keys). These extended algorithms are also simulated with the same simulation method.
Liouville space search algorithm [Bruschweiler, Phys. Rev. Lett. {\bf 85}, 4815(2000).] utilizes mixed initial states of the ensemble, and has been successfully implemented earlier in weakly coupled spins, in which a spin can be identified as a qubit. It has recently been demonstrated that n-strongly coupled spins can be collectively treated as an n-qubit system. Application of algorithms in such systems, requires new approaches using transition selective pulses rather than qubit selective pulses. This work develops a modified version of Liouville space search algorithm, which is applicable for strongly as well as weakly coupled spins. All the steps of the algorithm, can be implemented by using transition selective pulses. Experimental implementation is carried out on a strongly dipolar coupled four qubit system.
Abstract Brüschweiler's Ensemble algorithm requires n = log N queries to discover the wanted object from the database of the size N. In this paper, we use a new oracle query function g(.) to improve Brüschweiler's algorithm such that only one query is needed for searching the single object. Our algorithm extends from one ancillary qubit to n ancillary qubits. We then construct the oracle query function g(.) satisfying g(x) = 0 for all input x, except for one, say x = z, where g(z) = z. We first prepare 2n qubits, including n qubits for representing the elements and n ancillary qubits for storing the result of the oracle query function. After one query, we obtain z by measuring these ancillary qubits. Our algorithm can efficiently discover the wanted object if N ≤ 230 according to current NMR spectrometer technology.
The quantum search problem is an important problem due to the fact that a general NP problem can be solved efficiently by an unsorted quantum search algorithm. Here it has been shown that the quantum search problem could be solved in polynomial time on an NMR quantum computer. The NMR ensemble quantum computation is based on the quantum mechanical unitary dynamics that both a closed quantum system and its ensemble obey the same quantum mechanical unitary dynamics instead of on the pseudopure state or the effective pure state of the classical NMR quantum computation. Based on the new principle the conventional NMR multiple-quantum spectroscopy has been developed to solve experimentally the search problem. The solution information of the search problem is first loaded on the unitary evolution propagator which is constructed with the oracle unitary operation and oracle-independent unitary operations and is used to excite the multiple-quantum coherence in a spin ensemble. Then the multiple- quantum spectroscopy is used to extract experimentally the solution information. It has been discussed how to enhance the output NMR signal of the quantum search NMR multiple-quantum pulse sequence and some approaches to enhancing the NMR signal are also proposed. The present work could be helpful for conventional high field NMR machines to solve efficiently the quantum search problem.
Quantum computing by nuclear magnetic resonance using pseudopure spin states is bound by the maximal speed of quantum computing algorithms operating on pure states. In contrast to these quantum computing algorithms, a novel algorithm for searching an unsorted database is presented here that operates on truly mixed states in spin Liouville space. It provides an exponential speedup over Grover's quantum search algorithm with the sensitivity scaling exponentially with the number of spins, as for pseudopure state implementations. The minimal decoherence time required is exponentially shorter than that for Grover's algorithm.
The speedup of an unsorted database search has always been a challenging problem not only in classical computation but also in quantum computation. We propose a fetching algorithm for a Liouville space nuclear magnetic resonance (NMR) ensemble computing to fetch a marked item from an unsorted database directly. This algorithm achieves the absolute optimum in an unsorted database search problem: a single query. In fact, this algorithm also works well for fetching several unknown numbers of marked items. The computer simulation realization of the algorithm in a three-qubit homonuclear spin system is also presented. In addition, a compromised version of the algorithm, which reduces the demand on the structure of the molecules for the NMR experiment, is also devised.
Compared with classical search algorithms, Grover quantum algorithm [L. K. Grover, Phys. Rev. Lett. 79, 325 (1997)] achieves quadratic speedup and Brüschweiler hybrid quantum algorithm [R. Brüschweiler, Phys. Rev. Lett. 85, 4815 (2000)] achieves an exponential speedup. In this paper, we report the experimental realization of the Brüschweiler algorithm in a three-qubit nuclear magnetic resonance ensemble system. The pulse sequences are used for the algorithms and the measurement method used here is improved on that used by Brüschweiler, namely, instead of quantitatively measuring the spin projection of the ancilla bit, we utilize the shape of the ancilla bit spectrum. By simply judging the downwardness or upwardness of the corresponding peaks in an ancilla bit spectrum, the bit value of the marked state can be read out, especially the geometric nature of this read-out can make the results more robust against errors.