Computer Science
Efficient universal quantum circuits
Document Type
Conference Paper
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. © 2009 Springer Berlin Heidelberg.
Publication Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publication Date
2009
Volume
5609 LNCS
First Page
418
Last Page
428
ISSN
0302-9743
ISBN
9783642028816
DOI
10.1007/978-3-642-02882-3_42
Keywords
quantum circuit, quantum gate, CNOT gate, phase gate, control qubit
Repository Citation
Bera, Debajyoti; Fenner, Stephen; Green, Frederic; and Homer, Steve, "Efficient universal quantum circuits" (2009). Computer Science. 55.
https://commons.clarku.edu/faculty_computer_sciences/55
APA Citation
Bera, D., Fenner, S., Green, F., & Homer, S. (2009). Efficient universal quantum circuits. In Computing and Combinatorics: 15th Annual International Conference, COCOON 2009 Niagara Falls, NY, USA, July 13-15, 2009 Proceedings 15 (pp. 418-428). Springer Berlin Heidelberg.
