Computer Science – Computational Complexity
Scientific paper
2008-04-15
Computer Science
Computational Complexity
13 pages
Scientific paper
We define and construct efficient depth-universal and almost-size-universal quantum circuits. Such circuits can be viewed as general-purpose simulators for central classes of quantum circuits and can be used to capture the computational power of the circuit class being simulated. For depth we construct universal circuits whose depth is the same order as the circuits being simulated. For size, there is a log factor blow-up in the universal circuits constructed here. We prove that this construction is nearly optimal.
Bera Debajyoti
Fenner Stephen
Green Frederic
Homer Steve
No associations
LandOfFree
Universal Quantum Circuits 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 Universal Quantum Circuits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Universal Quantum Circuits will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-653881