Physics – Quantum Physics
Scientific paper
2004-03-23
Theoretical Computer Science 334, pp. 177-225, 2005
Physics
Quantum Physics
45 pages, 3 Postscript figures. Proofs rearranged, typos corrected
Scientific paper
10.1016/j.tcs.2004.12.031
In this paper, the space complexity of nonuniform quantum computations is investigated. The model chosen for this are quantum branching programs, which provide a graphic description of sequential quantum algorithms. In the first part of the paper, simulations between quantum branching programs and nonuniform quantum Turing machines are presented which allow to transfer lower and upper bound results between the two models. In the second part of the paper, different variants of quantum OBDDs are compared with their deterministic and randomized counterparts. In the third part, quantum branching programs are considered where the performed unitary operation may depend on the result of a previous measurement. For this model a simulation of randomized OBDDs and exponential lower bounds are presented.
Sauerhoff Martin
Sieling D.
No associations
LandOfFree
Quantum Branching Programs and Space-Bounded Nonuniform Quantum Complexity 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 Quantum Branching Programs and Space-Bounded Nonuniform Quantum Complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Branching Programs and Space-Bounded Nonuniform Quantum Complexity will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-679306