DocumentCode
2819834
Title
An algorithm to find quantum templates
Author
Rahman, Md Mazder ; Dueck, Gerhard W.
Author_Institution
Fac. of Comput. Sci., Univ. of New Brunswick, Fredericton, NB, Canada
fYear
2012
fDate
10-15 June 2012
Firstpage
1
Lastpage
7
Abstract
Identity circuits can be used as templates to minimize reversible circuits. This paper describes an algorithm to find all quantum templates with 3 qubits. The algorithm is used to find all templates with up to 8 gates. The method first finds a quantum identities of 3 qubits, template matching is used to verify if the identity is a template. Experiments show the significance of templates the new to reduce the quantum costs of benchmark circuits.
Keywords
quantum gates; benchmark circuits; gates; identity circuits; quantum templates; qubits; reversible circuits; Binary trees; Complexity theory; Logic gates; Quantum computing; Quantum entanglement; Tensile stress; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation (CEC), 2012 IEEE Congress on
Conference_Location
Brisbane, QLD
Print_ISBN
978-1-4673-1510-4
Electronic_ISBN
978-1-4673-1508-1
Type
conf
DOI
10.1109/CEC.2012.6256419
Filename
6256419
Link To Document