Work

Quantisation of Abstract Data Types

Year: 2026

Type: preprint

Abstract: In this paper, we introduce a notion of abstract quantum data type within the framework of universal algebra. This notion provides an algebraic foundation for describing data abstraction in quantum programming. We formally define a quantisation of classical data types and show that their equational specifications can be soundly lifted to the quantum setting. Two standard quantisation methods for classical functions, namely the bit oracle and the phase oracle, arise as special cases of this general construction. We illustrate the framework with applications to quantum arrays and quantum error-correcting codes, showing how they can be understood through the lens of data-type quantisation. We further establish conditions under which quantisation preserves structural relationships and constructions of classical data types, including embeddings, isomorphisms, and products.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2609.03778

Authors: Ying, Mingsheng, Zhang, Zhicheng, Chen, Kean

Institutions: University of Technology Sydney, Centre for Quantum Computation and Communication Technology, Griffith University, University of Pennsylvania

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Australian Research Council

Award: Foundation of Refinement Techniques for Quantum Programming

OpenAlex ID: W7208715659

Cites:

Cited by:

Related to: