Quantum computers and unstructured search: finding and counting items with an arbitrarily entangled initial state (Q1840940): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / arXiv ID @@
+quant-ph/9909089
@@ Property / arXiv ID: quant-ph/9909089 / rank @@
+Normal rank
@@ Property / cites work @@
+The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
+Normal rank
@@ Property / cites work @@
+Quantum Computation
@@ Property / cites work: Quantum Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
+Normal rank
@@ Property / cites work @@
+Strengths and Weaknesses of Quantum Computing
@@ Property / cites work: Strengths and Weaknesses of Quantum Computing / rank @@
+Normal rank
@@ Property / cites work @@
+Phase matching in quantum searching.
@@ Property / cites work: Phase matching in quantum searching. / rank @@
+Normal rank
@@ Property / cites work @@
+Q5772619
@@ Property / cites work: Q5772619 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1840940