OPTIMAL DATABASE SEARCH: WAVES AND CATALYSIS

2006 ◽  
Vol 04 (05) ◽  
pp. 815-825 ◽  
Author(s):  
APOORVA PATEL
Keyword(s):  
Quantum Computation ◽  
Search Algorithm ◽  
Database Search ◽  
Harmonic Oscillators ◽  
Physical Realization ◽  
Classical Wave ◽  
Superposition Of States

Grover's database search algorithm, although discovered in the context of quantum computation, can be implemented using any system that allows superposition of states. A physical realization of this algorithm is described using coupled simple harmonic oscillators, which can be exactly solved in both classical and quantum domains. Classical wave algorithms are far more stable against decoherence compared to their quantum counterparts. In addition to providing convenient demonstration models, they may have a role in practical situations, such as catalysis.

scholarly journals A hierarchical MS2 /MS3 database search algorithm for automated analysis of phosphopeptide tandem mass spectra

PROTEOMICS ◽  
2009 ◽  
Vol 9 (7) ◽  
pp. 1763-1770 ◽  
Author(s):  
Hua Xu ◽  
Liwen Wang ◽  
Larry Sallans ◽  
Michael A. Freitas
Keyword(s):  
Mass Spectra ◽  
Search Algorithm ◽  
Automated Analysis ◽  
Database Search ◽  
Tandem Mass ◽  
Tandem Mass Spectra

scholarly journals QUANTUM ORACLES IN TERMS OF UNIVERSAL GATE SET

2011 ◽  
Vol 09 (06) ◽  
pp. 1363-1381 ◽  
Author(s):  
YUJI TANAKA ◽  
TSUBASA ICHIKAWA ◽  
MASAHITO TADA-UMEZAKI ◽  
YUKIHIRO OTA ◽  
MIKIO NAKAHARA
Keyword(s):  
Arbitrary Number ◽  
Search Algorithm ◽  
Circuit Complexity ◽  
Database Search ◽  
Quantum Circuits ◽  
Systematic Construction ◽  
Universal Gate

We present a systematic construction of quantum circuits implementing Grover's database search algorithm for arbitrary number of targets. We introduce a new operator which flips the sign of the targets and evaluate its circuit complexity. We find the condition under which the circuit complexity of the database search algorithm based on this operator is less than that of the conventional one.

pFind–Alioth: A novel unrestricted database search algorithm to improve the interpretation of high-resolution MS/MS data

2015 ◽  
Vol 125 ◽  
pp. 89-97 ◽  
Author(s):  
Hao Chi ◽  
Kun He ◽  
Bing Yang ◽  
Zhen Chen ◽  
Rui-Xiang Sun ◽  
...  
Keyword(s):  
High Resolution ◽  
Search Algorithm ◽  
Database Search

scholarly journals A New Probabilistic Database Search Algorithm for ETD Spectra

2009 ◽  
Vol 8 (6) ◽  
pp. 3198-3205 ◽  
Author(s):  
Rovshan G. Sadygov ◽  
David M. Good ◽  
Danielle L. Swaney ◽  
Joshua J. Coon
Keyword(s):  
Search Algorithm ◽  
Database Search ◽  
Probabilistic Database

scholarly journals Entanglement and adiabatic quantum computation

2006 ◽  
Vol 84 (6-7) ◽  
pp. 645-651 ◽  
Author(s):  
D Ahrensmeier
Keyword(s):  
Quantum Computation ◽  
Time Evolution ◽  
Search Algorithm ◽  
Time Dependent ◽  
Quantum Search ◽  
Quantum Search Algorithm ◽  
Adiabatic Quantum Computation ◽  
Alternative Approach ◽  
03.67 Mn

Adiabatic quantum computation provides an alternative approach to quantum computation using a time-dependent Hamiltonian. The time evolution of entanglement during the adiabatic quantum search algorithm is studied, and its relevance as a resource is discussed.PACS Nos.: 03.67.–a, 03.67.Lx, 03.67.Mn

scholarly journals A Filtered Database Search Algorithm for Endogenous Serum Protein Carbonyl Modifications in a Mouse Model of Inflammation

2011 ◽  
Vol 10 (10) ◽  
pp. M111.007658 ◽  
Author(s):  
Peter G. Slade ◽  
Michelle V. Williams ◽  
Alison Chiang ◽  
Elizabeth Iffrig ◽  
Steven R. Tannenbaum ◽  
...  
Keyword(s):  
Mouse Model ◽  
Serum Protein ◽  
Search Algorithm ◽  
Protein Carbonyl ◽  
Database Search

Superposition, entanglement and quantum computation

2002 ◽  
Vol 2 (2) ◽  
pp. 97-116
Author(s):  
T.M. Forcer ◽  
A.J.G. Hey ◽  
D.A. Ross ◽  
P.G.R. Smith
Keyword(s):  
Quantum Computing ◽  
Quantum Computation ◽  
Search Algorithm ◽  
Quantum Algorithms ◽  
Quantum Search ◽  
Quantum Search Algorithm ◽  
Electronic Implementation

The paper examines the roles played by superposition and entanglement in quantum computing. The analysis is illustrated by discussion of a "classical" electronic implementation of Grover's quantum search algorithm. It is shown explicitly that the absence of multi-particle entanglement leads to exponentially rising resources for implementing such quantum algorithms.

scholarly journals Database Search Algorithm for Identification of Intact Cross-Links in Proteins and Peptides Using Tandem Mass Spectrometry

2010 ◽  
Vol 9 (7) ◽  
pp. 3384-3393 ◽  
Author(s):  
Hua Xu ◽  
Pang-Hung Hsu ◽  
Liwen Zhang ◽  
Ming-Daw Tsai ◽  
Michael A. Freitas
Keyword(s):  
Mass Spectrometry ◽  
Tandem Mass Spectrometry ◽  
Search Algorithm ◽  
Database Search ◽  
Tandem Mass ◽  
Cross Links ◽  
Proteins And Peptides

scholarly journals Modelling of Grover’s quantum search algorithms: implementations of Simple quantum simulators on classical computers

2020 ◽  
pp. 65-128
Author(s):  
Sergey Ulyanov ◽  
Andrey Reshetnikov ◽  
Olga Tyatyushkina
Keyword(s):  
Quantum Computation ◽  
Quantum Computer ◽  
Search Algorithm ◽  
Quantum Circuit ◽  
Unitary Matrix ◽  
Single Qubit ◽  
Simple Quantum ◽  
Grover’S Search Algorithm ◽  
The Cost ◽  
Universal Gate

Models of Grover’s search algorithm is reviewed to build the foundation for the other algorithms. Thereafter, some preliminary modifications of the original algorithms by others are stated, that increases the applicability of the search procedure. A general quantum computation on an isolated system can be represented by a unitary matrix. In order to execute such a computation on a quantum computer, it is common to decompose the unitary into a quantum circuit, i.e., a sequence of quantum gates that can be physically implemented on a given architecture. There are different universal gate sets for quantum computation. Here we choose the universal gate set consisting of CNOT and single-qubit gates. We measure the cost of a circuit by the number of CNOT gates as they are usually more difficult to implement than single qubit gates and since the number of single-qubit gates is bounded by about twice the number of CNOT’s.

Sign in / Sign up

Export Citation Format

Share Document