Efficient Universal Quantum Circuits

  • Authors:

  • Debajyoti Bera;Stephen Fenner;Frederic Green;Steve Homer

  • Affiliations:

  • Department of Computer Science, Boston University, Boston, 02134;Department of Computer Science and Engineering, University of South Carolina, Columbia, 29208;Department of Mathematics and Computer Science, Clark University, Worcester 01610;Department of Computer Science, Boston University, Boston, 02134

  • Venue:
  • COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We define and construct efficient depth-universal and almost-size-universal quantum circuits. Such circuits can be viewed as general-purpose simulators for central quantum circuit classes and used to capture the computational power of the simulated class. 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 which is nearly optimal for polynomial size circuits.