On quantum realisation of Boolean functions by the fingerprinting technique (Q3225895): Difference between revisions

@@ Property / cites work @@
+Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
+Normal rank
@@ Property / cites work @@
+Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
+Normal rank
@@ Property / cites work @@
+Quantum branching programs and space-bounded nonuniform quantum complexity
+Normal rank
@@ Property / cites work @@
+On the computational power of probabilistic and quantum branching program
+Normal rank
@@ Property / cites work @@
+Improved Constructions of Quantum Automata
@@ Property / cites work: Improved Constructions of Quantum Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum automata and quantum grammars
@@ Property / cites work: Quantum automata and quantum grammars / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1515/dma.2009.037
+Normal rank
@@ Property / OpenAlex ID @@
+W1976024582
@@ Property / OpenAlex ID: W1976024582 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3225895