Decompositions of \(n\)-qubit Toffoli gates with linear circuit complexity (Q1701223): Difference between revisions

@@ 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.1007/s10773-017-3389-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2609567360
@@ Property / OpenAlex ID: W2609567360 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
+Normal rank
@@ Property / cites work @@
+A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
+Normal rank
@@ Property / cites work @@
+Quantum computational networks
@@ Property / cites work: Quantum computational networks / rank @@
+Normal rank
@@ Property / cites work @@
+Rapid solution of problems by quantum computation
@@ Property / cites work: Rapid solution of problems by quantum computation / rank @@
+Normal rank
@@ Property / cites work @@
+Q3522420
@@ Property / cites work: Q3522420 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3522568
@@ Property / cites work: Q3522568 / rank @@
+Normal rank
@@ Property / cites work @@
+Universal quantum computation with ideal Clifford gates and noisy ancillas
+Normal rank
@@ Property / cites work @@
+Synthesis and optimization of reversible circuits—a survey
+Normal rank
@@ Property / cites work @@
+Q3171713
@@ Property / cites work: Q3171713 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1701223