Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Strong equivalence of reversible circuits is coNP-complete   It is well-known that deciding equivalence of logic circuits is a
coNP-complete problem. As a corollary, the problem of deciding weak equivalence
of reversible circuits, i.e. ignoring the ancilla bits, is also coNP-complete.
The complexity of deciding strong equivalence, including the ancilla bits, is
less obvious and may depend on gate set. Here we use Barrington's theorem to
show that deciding strong equivalence of reversible circuits built from the
Fredkin gate is coNP-complete. This implies coNP-completeness of deciding
strong equivalence for other commonly used universal reversible gate sets,
including any gate set that includes the Toffoli or Fredkin gate.

15
The categories of this paper are: nucl-ex
17
The categories of this paper are: q-fin
11
The categories of this paper are: hep-lat
28
The categories of this paper are: alg-geom
35
The categories of this paper are: mtrl-th
36
The categories of this paper are: cmp-lg
30
The categories of this paper are: q-alg
9
The categories of this paper are: nlin
21
The categories of this paper are: adap-org
14
The categories of this paper are: math-ph
2
The categories of this paper are: math
0
The categories of this paper are: hep-ph
4
The categories of this paper are: cond-mat
6
The categories of this paper are: astro-ph
16
The categories of this paper are: stat
12
The categories of this paper are: nucl-th