Karamitrou, O. G.; Tsimpouris, C.; Mavridi, P.; Sgarbas, K. N. A web-based quantum computer simulator with symbolic extensions. (English) Zbl 1383.81007 Kotsireas, Ilias S. (ed.) et al., Applications of computer algebra, Kalamata, Greece, July 20–23, 2015. Cham: Springer (ISBN 978-3-319-56930-7/hbk; 978-3-319-56932-1/ebook). Springer Proceedings in Mathematics & Statistics 198, 231-235 (2017). Summary: This paper presents a quantum computer simulator with a web interface, based on the circuit model of quantum computation. This is the standard model for which most quantum algorithms have been developed. According to this model, quantum algorithms are expressed as circuits of quantum registers (series of qubits) and quantum gates operating on them. The paper also proposes another version of the existing simulator using symbolic computation in Python programming language, in order to perform quantum calculations.For the entire collection see [Zbl 1379.13001]. MSC: 81-08 Computational methods for problems pertaining to quantum theory 68U35 Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) 81P68 Quantum computation Keywords:quantum computation; simulator; circuit model; quantum gates; Python language Software:Python; SymPy PDFBibTeX XMLCite \textit{O. G. Karamitrou} et al., Springer Proc. Math. Stat. 198, 231--235 (2017; Zbl 1383.81007) Full Text: DOI References: [1] Coppersmith, D.: An Approximate Fourier Transform Useful in Quantum Factoring, IBM Research Report RC 19642 (1994) [2] Grover, L.K.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79(2), 325-328 (1997) · doi:10.1103/PhysRevLett.79.325 [3] Grover, L.K.: Quantum computers can search rapidly by using almost any transformation. Phys. Rev. Lett. 80(19), 4329-4332 (1998) · doi:10.1103/PhysRevLett.80.4329 [4] Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge, UK (2000) · Zbl 1049.81015 [5] Shor, P.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 124-134 (1994) This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.