Ricercar: A Language for Describing and Rewriting Reversible Circuits with Ancillae and Its Permutation Semantics (Q2822512): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-20860-2_13
+Normal rank
@@ Property / OpenAlex ID @@
+W1011234245
@@ Property / OpenAlex ID: W1011234245 / rank @@
+Normal rank
@@ Property / cites work @@
+Upper bounds for reversible circuits based on Young subgroups
+Normal rank
@@ Property / cites work @@
+Time/Space Trade-Offs for Reversible Computation
@@ Property / cites work: Time/Space Trade-Offs for Reversible Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Time and space bounds for reversible simulation
@@ Property / cites work: Time and space bounds for reversible simulation / rank @@
+Normal rank
@@ Property / cites work @@
+An Introduction to Quantum Programming in Quipper
@@ Property / cites work: An Introduction to Quantum Programming in Quipper / rank @@
+Normal rank
@@ Property / cites work @@
+White Dots do Matter: Rewriting Reversible Logic Circuits
+Normal rank
@@ Property / cites work @@
+Q4520775
@@ Property / cites work: Q4520775 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3540814
@@ Property / cites work: Q3540814 / rank @@
+Normal rank
@@ Property / cites work @@
+Describing and Optimising Reversible Logic Using a Functional Language
+Normal rank