Created
May 26, 2023 11:15
-
-
Save JesusCastroFernandez/cdef508f160b4d82412fad1afbc5f599 to your computer and use it in GitHub Desktop.
Algoritmo de Búsqueda Cuántica. El algoritmo busca una entrada en una lista no ordenada y devuelve la posición de la entrada. En este ejemplo se busca una entrada en una lista de dos elementos.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import numpy as np | |
from qiskit import QuantumCircuit, Aer, execute | |
def grovers_algorithm(): | |
# Definir el número de qubits y el número de iteraciones | |
n = 2 | |
iterations = 2 | |
# Inicializar los qubits y el oráculo | |
qc = QuantumCircuit(n + 1, n) | |
qc.h(range(n)) | |
qc.x(n) | |
qc.h(n) | |
# Definir el oráculo | |
oracle = QuantumCircuit(n + 1) | |
oracle.cz(0, n) | |
oracle.x(range(n + 1)) | |
oracle.cz(0, n) | |
oracle.x(range(n + 1)) | |
# Definir la difusión | |
diffusion = QuantumCircuit(n) | |
diffusion.h(range(n)) | |
diffusion.x(range(n)) | |
diffusion.h(n - 1) | |
diffusion.mct(list(range(n - 1)), n - 1) | |
diffusion.h(n - 1) | |
diffusion.x(range(n)) | |
diffusion.h(range(n)) | |
# Aplicar el algoritmo | |
for i in range(iterations): | |
qc.append(oracle, range(n + 1)) | |
qc.append(diffusion, range(n)) | |
# Medir los resultados | |
qc.measure(range(n), range(n)) | |
# Ejecutar el circuito en un simulador cuántico | |
backend = Aer.get_backend('qasm_simulator') | |
job = execute(qc, backend=backend, shots=1024) | |
result = job.result().get_counts() | |
return result | |
result = grovers_algorithm() | |
print(result) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment