2013
DOI: 10.1007/978-3-642-36315-3_10
|View full text |Cite
|
Sign up to set email alerts
|

Properties of Quantum Templates

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 12 publications
(8 citation statements)
references
References 12 publications
0
7
0
Order By: Relevance
“…Abdessaied et al [29] used Boolean satisfiability for template matching. In the work performed in [30], a systematic method of generating all templates with a given number of lines was presented.…”
Section: Templates For Logic Synthesismentioning
confidence: 99%
“…Abdessaied et al [29] used Boolean satisfiability for template matching. In the work performed in [30], a systematic method of generating all templates with a given number of lines was presented.…”
Section: Templates For Logic Synthesismentioning
confidence: 99%
“…Abdessaied et al [27] used Boolean satisfiability for template matching. In the work performed in [28], a systematic method of generating all templates with a given number of lines was presented. Bandyopadhyay et al [29] proposed a post-synthesis optimization technique for reversible circuits based on newly defined templates.…”
Section: Related Workmentioning
confidence: 99%
“…Currently, all templates with three lines and up to 12 gates have been generated. It has been proven that templates with three lines cannot have more than 17 gates [44]. The Hasse diagram enables the search to be guided, avoiding the checking of gates that cannot be moved together according to the moving rule.…”
Section: Template Matchingmentioning
confidence: 99%
“…Recently, a detailed study of the properties of templates has been published [44]. These properties lead to a method to construct all the templates with a certain number of lines.…”
Section: Template Matchingmentioning
confidence: 99%
See 1 more Smart Citation