Quantum Processes: A Novel Optimization for Quantum Simulation

Authors

  • Adriano Maron Universidade Federal de Pelotas
  • Renata Reiser Universidade Federal de Pelotas
  • Maurício Pilla Universidade Federal de Pelotas
  • Adenauer Yamin Universidade Federal de Pelotas

DOI:

https://doi.org/10.5540/tema.2013.014.03.0399

Abstract

The simulation of quantum algorithms in classic computers is a task which requires high processing and storing capabilities, limiting the size of quantum systems supported by the simulators. However, optimizations for reduction of temporal and spatial complexities are promising and expanding the capabilities of some simulators. The main contribution of this work consists in designing optimizations by the description of quantum transformations using Quantum Processes and Partial Quantum Processes conceived in the qGM theoretical model. These processes, when computed on the VPE-qGM execution environment, result in lower execution time and better performance, allowing the simulation of more complex quantum algorithms. The performance evaluation of this proposal was carried out by benchmarks used in similar works and included the sequential simulation of quantum algorithms up to 24 qubits. The results show a great improvement when compared to the previous version of the environment and indicate possibilities of advances in this research.

References

L. Grover, “A fast quantum mechanical algorithm for database search,” Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 212–219, 1996, available at <http://doi.acm.org/10.1145/237814.237866> (dec.2011).

P. Shor, “Polynomial-time algoritms for prime factorization and discrete logarithms on a quantum computer,” SIAM Journal on Computing, 1997.

J. Agudelo and W. Carnielli, “Paraconsistent machines and their relation to quantum computing,” arXiv:0802.0150v2, 2008.

A. Barbosa, “Um simulador simbólico de circuitos quânticos,” Master’s thesis, Universidade Federal de Campina Grande, 2007.

H. Watanabe, “Qcad: Gui environment for quantum computer simulator,” 2002, available at <http://apollon.cc.u-tokyo.ac.jp/ watanabe/qcad/> (dec.2011).

V. Samoladas, “Improved bdd algorithms for the simulation of quantum circuits,” in Annual European Symposium on Algorithms. Berlin, Heidelberg: Springer-Verlag, 2008, pp. 720–731.

G. Viamontes, “Efficient quantum circuit simulation,” Phd Thesis, The University of Michigan, 2007.

A. Maron, A. Pinheiro, R. Reiser, and M. Pilla, “Consolidando uma infraestrutura para simulação quântica distribuída,” in Anais da ERAD 2011. SBC/Instituto de Informática UFRGS, 2011, pp. 213–216.

R. Reiser and R. Amaral, “The quantum states space in the qgm model,” in Anais/III WECIQ. Petrópolis/RJ: Editora do LNCC, 2010, pp. 92–101.

M. A. Nielsen and I. L. Chuang, Computação Quântica e Informação Quântica. Bookman, 2003.

J.-Y. Girard, “Between logic and quantic: a tract,” in Linear logic in

computer science, P. R. Thomas Ehrhard, Jean-Yves Girard and P. Scott,

Eds. Cambridge University Press, 2004, pp. 466–471. [Online]. Available:

http://iml.univ-mrs.fr/~girard/Articles.html

R. Reiser, R. Amaral, and A. Costa, “Quantum computing: Computation in coherence spaces,” in Proceedings of WECIQ 2007. UFCG - Universidade Federal de Campina Grande, 2007, pp. 1–10.

——, “Leading to quantum semantic interpretations based on coherence spaces,” in NaNoBio 2007. Lab. de II - ICA/DDE - PUC-RJ, 2007, pp. 1–6.

G. D. D. Maslov and N. Scott, “Reversible logic synthesis benchmarks page.” 2011, available at <http://www.cs.uvic.ca/ dmaslov>(apr.2012).

A. Maron, A. Ávila, R. Reiser, and M. Pilla, “Introduzindo uma nova abordagem para simulação quântica com baixa complexidade espacial,” in Anais do DINCON 2011. SBMAC, 2011, pp. 1–6.

NVIDIA, CUDA Programming Guide. NVIDIA Corp., 2009, version 2.3

Downloads

Additional Files

Published

2013-11-24

How to Cite

Maron, A., Reiser, R., Pilla, M., & Yamin, A. (2013). Quantum Processes: A Novel Optimization for Quantum Simulation. Trends in Computational and Applied Mathematics, 14(3), 399–414. https://doi.org/10.5540/tema.2013.014.03.0399

Issue

Vol. 14 No. 3 (2013)

Section

Original Article

License

Copyright

Authors of articles published in the journal Trends in Computational and Applied Mathematics retain the copyright of their work. The journal uses Creative Commons Attribution (CC-BY) in published articles. The authors grant the TCAM journal the right to first publish the article.

Intellectual Property and Terms of Use

The content of the articles is the exclusive responsibility of the authors. The journal uses Creative Commons Attribution (CC-BY) in published articles. This license allows published articles to be reused without permission for any purpose as long as the original work is correctly cited.

The journal encourages Authors to self-archive their accepted manuscripts, publishing them on personal blogs, institutional repositories, and social media, as long as the full citation is included in the journal's website version.