Complexity of reversible circuits and their quantum implementations (Q2634672): Difference between revisions

@@ Property / Wikidata QID @@
+Q59242186
@@ Property / Wikidata QID: Q59242186 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2016.01.011
+Normal rank
@@ Property / OpenAlex ID @@
+W2247222799
@@ Property / OpenAlex ID: W2247222799 / rank @@
+Normal rank
@@ Property / cites work @@
+Reversible Computing
@@ Property / cites work: Reversible Computing / rank @@
+Normal rank
@@ Property / cites work @@
+Young subgroups for reversible computers.
@@ Property / cites work: Young subgroups for reversible computers. / rank @@
+Normal rank
@@ Property / cites work @@
+On figures of merit in reversible and quantum logic designs
+Normal rank
@@ Property / cites work @@
+A Study of Optimal 4-Bit Reversible Toffoli Circuits and Their Synthesis
+Normal rank
@@ Property / cites work @@
+Q3886867
@@ Property / cites work: Q3886867 / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum Circuit Optimization by Hadamard Gate Reduction
+Normal rank
@@ Property / cites work @@
+Upper bounds for reversible circuits based on Young subgroups
+Normal rank
@@ Property / cites work @@
+Q2706552
@@ Property / cites work: Q2706552 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4320535
@@ Property / cites work: Q4320535 / rank @@
+Normal rank