Article citationsMore>>

Green, A.S., Lumsdaine, P.L., Ross, N.J., Selinger, P. and Valiron, B. (2013) Quipper. Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, Seattle, 6-19 June 2013, 333-342.
https://doi.org/10.1145/2491956.2462177

has been cited by the following article:

• TITLE: Numbering and Generating Quantum Algorithms

  AUTHORS: Mohamed A. El-Dosuky

  KEYWORDS: Quantum Algorithms, Numbering Computable Programs, Quantum Key Distribution

  JOURNAL NAME: Journal of Computer and Communications, Vol.13 No.2, February 24, 2025

  ABSTRACT: Quantum computing offers unprecedented computational power, enabling simultaneous computations beyond traditional computers. Quantum computers differ significantly from classical computers, necessitating a distinct approach to algorithm design, which involves taming quantum mechanical phenomena. This paper extends the numbering of computable programs to be applied in the quantum computing context. Numbering computable programs is a theoretical computer science concept that assigns unique numbers to individual programs or algorithms. Common methods include Gödel numbering which encodes programs as strings of symbols or characters, often used in formal systems and mathematical logic. Based on the proposed numbering approach, this paper presents a mechanism to explore the set of possible quantum algorithms. The proposed approach is able to construct useful circuits such as Quantum Key Distribution BB84 protocol, which enables sender and receiver to establish a secure cryptographic key via a quantum channel. The proposed approach facilitates the process of exploring and constructing quantum algorithms.