Solving a Maze With a Quantum Computer

Details Solving a Maze With a Quantum Computer Solving a Maze With a Quantum Computer

2003-04-23

arxiv.org/abs/quant-ph/0304146v1

Physics

Quantum Physics

3 Pages, To be presented to the Senior Project Boards on May 9th

Scientific paper

It is well known, and appreciated, that quantum computers have the potential to be the most powerful computational devices ever created. This newfound power comes from a quantum parallelism effect that allows the computer to be in multiple states at the same time. This property of quantum parallelism, while suited to handle common problems such as factoring and searching an unorganized database, is extremely well-suited to handle the task of solving a binary maze. I propose an algorithm that can be used to solve a binary maze on a quantum computer, with guaranteed accuracy. While it does work, it does come with a few setbacks, in that the maze must have no flaws, and that the computer requires a number of qubits equal to the number of decisions in the maze, plus log 2 of the decisions.

Affiliated with

Also associated with

No associations

Rating

Solving a Maze With a Quantum Computer does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Solving a Maze With a Quantum Computer, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving a Maze With a Quantum Computer will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-108519