Algoritmo cuántico de Deutsch y Jozsa en GAMA

Authors

  • M. Paredes López Departamento de Matemáticas, Cinvestav, Av. Instituto Politécnico Nacional 2508, CDMX
  • A. Meneses Viveros Departamento de Computación, Cinvestav, Av. Instituto Politécnico Nacional 2508, CDMX
  • G. Morales-Luna Departamento de Computación, Cinvestav, Av. Instituto Politécnico Nacional 2508, CDMX

DOI:

https://doi.org/10.31349/RevMexFisE.64.181

Keywords:

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

Abstract

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.

Downloads

Published

2018-06-11

How to Cite

[1]
M. Paredes López, A. Meneses Viveros, and G. Morales-Luna, “Algoritmo cuántico de Deutsch y Jozsa en GAMA”, Rev. Mex. Fis. E, vol. 64, no. 2 Jul-Dec, pp. 181–189, Jun. 2018.

Issue

Vol. 64 No. 2 Jul-Dec (2018): Revista Mexicana de Física E

Section

02 Education in Physics

License

Authors retain copyright and grant the Revista Mexicana de Física E right of first publication with the work simultaneously licensed under a CC BY-NC-ND 4.0 that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.