{
  "id": "quant-ph/0304146",
  "version": "v1",
  "published": "2003-04-23T03:39:38.000Z",
  "updated": "2003-04-23T03:39:38.000Z",
  "title": "Solving a Maze With a Quantum Computer",
  "authors": [
    "Mark A Bashuk"
  ],
  "comment": "3 Pages, To be presented to the Senior Project Boards on May 9th",
  "categories": [
    "quant-ph"
  ],
  "abstract": "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2003-04-23T03:39:38.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "quantum computer",
      "binary maze",
      "newfound power comes",
      "quantum parallelism effect",
      "handle common problems"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 3,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}