Skip to main content
Quantum Computing

Return to Question

edited tags
Link
glS ♦
glS ♦
  • 26.9k
  • 6
  • 35
  • 121
Because the tag I assume that you want a Qiskit implementation of your case. Making that explicit would make a question easier to find by others. Also, some formatting.
Source Link
edit approved Nov 20, 2020 at 19:03
luciano
edit approved Nov 20, 2020 at 19:03
luciano
  • 6k
  • 1
  • 13
  • 34

Qiskit: How can I modify Grover's algorithm to search for a state that doesn't belong to a basis set?

Let's say I need to find the state 111$111$ in a "database" that is not the computational basis for a 3-qubits system (because it doesn't contain all of the basis vectors or contains the same vector more than one time). For example, this database could be the set {000, 010, 001, 000, 000, 110}$\{000, 010, 001, 000, 000, 110\}$. 

How can I adjust Grover's algorithm for this kind of search? I would like a Qiskit implementation of this case.

How can I modify Grover's algorithm to search for a state that doesn't belong to a basis set?

Let's say I need to find the state 111 in a "database" that is not the computational basis for a 3-qubits system (because it doesn't contain all of the basis vectors or contains the same vector more than one time). For example, this database could be the set {000, 010, 001, 000, 000, 110}. How can I adjust Grover's algorithm for this kind of search?

Qiskit: How can I modify Grover's algorithm to search for a state that doesn't belong to a basis set?

Let's say I need to find the state $111$ in a "database" that is not the computational basis for a 3-qubits system (because it doesn't contain all of the basis vectors or contains the same vector more than one time). For example, this database could be the set $\{000, 010, 001, 000, 000, 110\}$. 

How can I adjust Grover's algorithm for this kind of search? I would like a Qiskit implementation of this case.

Source Link
Alfred
Alfred
  • 93
  • 7

How can I modify Grover's algorithm to search for a state that doesn't belong to a basis set?

Let's say I need to find the state 111 in a "database" that is not the computational basis for a 3-qubits system (because it doesn't contain all of the basis vectors or contains the same vector more than one time). For example, this database could be the set {000, 010, 001, 000, 000, 110}. How can I adjust Grover's algorithm for this kind of search?