Quantum Circuit Simplification Using Templates

Optimal synthesis of quantum circuits is intractable and heuristic methods must be employed. Templates are a general approach to reversible and quantum circuit simplification. In this paper, we consider the use of templates to simplify a quantum circuit initially found by other means. We present and...

Full description

Saved in:
Bibliographic Details
Published in:Design, Automation and Test in Europe pp. 1208 - 1213
Main Authors: Maslov, D., Young, C., Miller, D. M., Dueck, G. W.
Format: Conference Proceeding
Language:English
Published: Washington, DC, USA IEEE Computer Society 07.03.2005
IEEE
Series:ACM Conferences
Subjects:
Circuit synthesis
Computer science
Computing methodologies > Artificial intelligence > Search methodologies > Heuristic function construction
Costs
Hardware
Hardware > Electronic design automation > High-level and register-transfer level synthesis
Logic
Niobium
Optimization methods
Q measurement
Quantum computing
Tensile stress
Vectors
ISBN:9780769522883, 0769522882
ISSN:1530-1591
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Optimal synthesis of quantum circuits is intractable and heuristic methods must be employed. Templates are a general approach to reversible and quantum circuit simplification. In this paper, we consider the use of templates to simplify a quantum circuit initially found by other means. We present and analyze templates in the general case, and then provide particular details for circuits composed of NOT, CNOT and controlled-sqrt-of-NOT gates. We introduce templates for this set of gates and apply them to simplify both known quantum realizations of Toffoli gates and circuits found by earlier heuristic Fredkin and Toffoli gate synthesis algorithms. While the number of templates is quite small, the reduction in quantum cost is often significant.
Bibliography:SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
ISBN:9780769522883
0769522882
ISSN:1530-1591
DOI:10.1109/DATE.2005.249