Efficient universal quantum circuits

Authors:
Debajyoti Bera;S. Fenner;F. Green;S. Homer
Affiliations:
Computer Science Department, Boston University, Boston, MA;Department of Computer Science and Engineering, University of South Carolina, Columbia, SC;Department of Mathematics and Computer Science, Clark University Worcester, MA;Computer Science Department, Boston University Boston, MA
Venue:
Quantum Information & Computation
Year:
2010

Citing 7
Cited 1

Quantum computation and quantum information

Quantum computation and quantum information
Universal circuits (Preliminary Report)

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Small depth quantum circuits

ACM SIGACT News
Quantum circuit complexity

SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Counting, fanout and the complexity of quantum ACC

Quantum Information & Computation
Quantum lower bounds for fanout

Quantum Information & Computation
Universal quantum circuit for N-qubit quantum gate: a programmable quantum gate

Quantum Information & Computation

Nearly deterministic controlled-not gate with weak cross-kerr nonlinearities

Quantum Information & Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Universal circuits can be viewed as general-purpose simulators for central classes ofcircuits and can be used to capture the computational power of the circuit class beingsimulated. We define and construct quantum universal circuits which are efficient andhave very little overhead in simulation. For depth we construct universal circuits whosedepth is the same order as the circuits being simulated. For size, there is a log factorblow-up in the universal circuits constructed here which is nearly optimal.