Year: 2024
Type: conference-paper
Abstract: Quantum computers are notoriously difficult to program. This is largely because they operate predominantly on complex algebraic structures which are not usually part of the vocabulary of conventional programmers who are more used to working with integers, floating point numbers and Boolean values. Also, the atomic operations carried out by quantum gates require a level of understanding of counter-intuitive properties of quantum mechanics, such as superposition, measurement, and entanglement, which is a considerable step beyond the familiar Boolean logic which is implemented by gates in classical circuits. Therefore, there is a significant challenge for software developers who have been trained in how to create code for conventional computers in making the transition to quantum. Quantum programming is currently the preserve of mathematicians and theoretical physicists. In this paper I shall consider whether the process algebra of CSP could be useful tool in this context to make the field of Quantum Computing more accessible.
Source: Kalpa publications in computing
DOI: 10.29007/skg4
Author: Jeremy Martin
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W4403507500