Algoritmo cuántico de Deutsch y Jozsa en GAMA

M. Paredes López, A. Meneses Viveros, G. Morales-Luna


An important feature of quantum computing is its inherent paralellism, allowing to process an exponential number of basic transforms with just a linear number of qubits. The Deutsch-Jozsa algorithm exemplifies the computational complexity reduction. This work reports the implementation and execution of the Deutsch-Josza quantum algoritm in GAMA, a programming language for quantum computing simulation developed by ourselves. Through this simulation, it is possible to explore all the components involved by tracing all the different configurations that each component may take.


Quantum computing; parallelism; qubits; computational complexity; quantum simulation.

Full Text:




  • There are currently no refbacks.

Revista Mexicana de Física E

ISSN: 1870-3542

Semiannual publication of Sociedad Mexicana de Física, A.C.
Departamento de Física, 2o. Piso, Facultad de Ciencias, UNAM.
Circuito Exterior s/n, Ciudad Universitaria. C. P. 04510 Ciudad de México.
Apartado Postal 70-348, Coyoacán, 04511 Ciudad de México.
Tel/Fax: (52-55) 5622-4946, (52-55) 5622-4840.