Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
Grover\'s Algorithm A Fast Search Method Using Quantum Parallelism
Post: #1

Grover's Algorithm A Fast Search Method Using Quantum Parallelism

Genetic Algorithms provide an effective way of searching complex fitness landscapes. Grover’s Algorithm is a quantum algorithm used to search through a database of values and determine where a particular target value is stored. It does so by using quantum parallelism so that it is more efficient than its classical counter- parts. The way the algorithm was originally designed allows for finding only a single value. We use repeated applications of Grover’s Algorithm to get a variety of decent chromosomes that will then be used to form a starting population for classical genetic search.

Basic ideas:
1. Initialize a quantum computer using l qubits, where l is the necessary length of the chromosomes.
2. Set the quantum computer to a superposition of all possible chromosomes. This represents a population of all possible solutions.
3. Decide on the size, n, of the seed population needed. This is based upon the complexity of the problem and the available computing resources.
4. Perform Grover’s Algorithm n times using the fitness function f to guide the search. Each solution found will be a single chromosome of the final seed population. The quantum registers are re-initialized in between each run.
5. Use the n solutions from above as an initial seed population for classical genetic search. This seed population will be fitter than a randomly generated population, as is commonly used as a starting population.

Important Note..!

If you are not satisfied with above reply ,..Please


So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this page
Popular Searches: how to make codes unbreakable using quantum conjugate, ppt gravitational search algorithm, difference between inter query and intra query parallelism, polyfuse method**l buying process ppt, silar method wikipedia, lucas kanade method, fast dictionary search,

Quick Reply
Type your reply to this message here.

Image Verification
Image Verification
(case insensitive)
Please enter the text within the image on the left in to the text box below. This process is used to prevent automated posts.

Possibly Related Threads...
Thread: Author Replies: Views: Last Post
  Vertical Handoff Decision Algorithm Providing Optimized Performance in Heterogeneous Wireless Networks computer science topics 2 1,317 07-10-2016 09:02 AM
Last Post: ijasti
  Implementation of RSA Algorithm Using Client-Server full report seminar topics 6 5,002 10-05-2016 12:21 PM
Last Post: dhanyavp
  Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks seminar surveyer 3 1,897 14-07-2015 02:24 PM
Last Post: seminar report asees
  SEARCH IMAGES BY APPEARANCE seminar projects crazy 4 3,443 25-06-2015 02:59 PM
Last Post: seminar report asees
  QUANTUM CRYPTOGRAPHY- MAKING CODE UNBREAKABLE seminar class 2 1,649 11-07-2013 02:07 PM
Last Post: computer topic
  Particle Swarm Optimization Algorithm and Its Application in Engineering Design Optim computer science crazy 3 4,490 03-05-2013 10:28 AM
Last Post: computer topic
  Image Segmentation Using Information Bottleneck Method seminar class 4 2,994 19-01-2013 12:45 PM
Last Post: seminar details
  Relation-Based Search Engine in Semantic Web project topics 1 1,364 21-12-2012 11:00 AM
Last Post: seminar details
  Public Key Cryptography and the RSA algorithm seminar class 1 1,703 23-11-2012 11:32 AM
Last Post: seminar details
  rsa algorithm full report computer science technology 3 7,022 23-11-2012 11:32 AM
Last Post: seminar details