Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Kluwer Academic Publishers eBooks

QCL-C: Relaxations and Special Cases

Published May 31, 2006• 0 citations
Publisher
DOI
10.1007/0-387-23532-9_3

Related papers

Branch and Cut Algorithm for QCL-C

Kluwer Academic Publishers eBooks•May 31, 2006•0 citations

QCL-C: Formulations and Projection Inequalities

Kluwer Academic Publishers eBooks•May 31, 2006•0 citations

An axiomatization of quantum computational Logic

Vladimir L. Vasyukov

One of the logical proposals that arise from quantum computation is the idea to use the quantum theoretical formalism to represent parallel reasoning. To this aim a quantum computation is considered by means of convenient unitary operators assuming arguments and values in particular sets of qubit systems. Isolating some important unitary operators that have a special role in quantum computation (logical gates or quregisters) we obtain an opportunity to yield the language of Quantum Computational Logic (QCL) (cf. [Cattaneo et al., 2003; Cattaneo et al., 2004; Dalla Chiara et al., 2004]). The basic concept of the semantics of this language is the notion of quantum computational realization such that the meaning associated to any sentence is a quregister. Unlike the semantic of a standard quantum logic QCL-conjunction and QCL-disjunction do not correspond to lattice operations since they are not generally idempotent. Moreover, in QCL the weak distributivity principle breaks down and both the excluded middle and the non contradiction principles are violated. Finally, the axiomatizability of QCL is still an open problem. In the paper an axiomatization of QCL is proposed construing it as a kind of so-called Goldblatt’s binary logic. Some metalogical theorems (paraconsistency and completeness) are proved.

Logical Investigations•Jan 1, 2023•0 citations

Quantum Adjoint Convolutional Layers for Effective Data Representation

Ren-Xin Zhao, Shi Wang, Yaonan Wang

Quantum Convolutional Layer (QCL) is considered as one of the core of Quantum Convolutional Neural Networks (QCNNs) due to its efficient data feature extraction capability. However, the current principle of QCL is not as mathematically understandable as Classical Convolutional Layer (CCL) due to its black-box structure. Moreover, classical data mapping in many QCLs is inefficient. To this end, firstly, the Quantum Adjoint Convolution Operation (QACO) consisting of a quantum amplitude encoding and its inverse is theoretically shown to be equivalent to the quantum normalization of the convolution operation based on the Frobenius inner product while achieving an efficient characterization of the data. Subsequently, QACO is extended into a Quantum Adjoint Convolutional Layer (QACL) by Quantum Phase Estimation (QPE) to compute all Frobenius inner products in parallel. At last, comparative simulation experiments are carried out on PennyLane and TensorFlow platforms, mainly for the two cases of kernel fixed and unfixed in QACL. The results demonstrate that QACL with the insight of special quantum properties for the same images, provides higher training accuracy in MNIST and Fashion MNIST classification experiments, but sacrifices the learning performance to some extent. Predictably, our research lays the foundation for the development of efficient and interpretable quantum convolutional networks and also advances the field of quantum machine vision.

arXiv:2404.17378•Apr 26, 2024•3 citations

Constructions of QCCs

Giuliano G. La Guardia

Quantum science and technology•Jan 1, 2020•0 citations

A Procedural Formalism for Quantum Computing

Bernhard Ömer

Despite many common concepts with classical computer science, quantum computing is still widely considered as a special discipline within the broad field of theoretical physics. One reason for the slow adoption of QC by the computer science community is the confusing variety of formalisms (Dirac notation, matrices, gates, operators, etc.), none of which has any similarity with classical programming languages, as well as the rather “physical” terminology in most of the available literature. QCL (Quantum Computation Language) tries to fill this gap: QCL is a hight level, architecture independent programming language for quantum computers, with a syntax derived from classical procedural languages like C or Pascal. This allows for the complete implementation and simulation of quantum algorithms (including classical components) in one consistent formalism. Chapter 1 is an introduction into the basic concepts of quantum programming,

•Jan 1, 2002•85 citations
One of the logical proposals that arise from quantum computation is the idea to use the quantum theoretical formalism to represent parallel reasoning. To this aim a quantum computation is considered by means of convenient unitary operators assuming arguments and values in particular sets of qubit systems. Isolating some important unitary operators that have a special role in quantum computation (logical gates or quregisters) we obtain an opportunity to yield the language of Quantum Computational Logic (QCL) (cf. [Cattaneo et al., 2003; Cattaneo et al., 2004; Dalla Chiara et al., 2004]). The basic concept of the semantics of this language is the notion of quantum computational realization such that the meaning associated to any sentence is a quregister. Unlike the semantic of a standard quantum logic QCL-conjunction and QCL-disjunction do not correspond to lattice operations since they are not generally idempotent. Moreover, in QCL the weak distributivity principle breaks down and both the excluded middle and the non contradiction principles are violated. Finally, the axiomatizability of QCL is still an open problem. In the paper an axiomatization of QCL is proposed construing it as a kind of so-called Goldblatt’s binary logic. Some metalogical theorems (paraconsistency and completeness) are proved.
Quantum Convolutional Layer (QCL) is considered as one of the core of Quantum Convolutional Neural Networks (QCNNs) due to its efficient data feature extraction capability. However, the current principle of QCL is not as mathematically understandable as Classical Convolutional Layer (CCL) due to its black-box structure. Moreover, classical data mapping in many QCLs is inefficient. To this end, firstly, the Quantum Adjoint Convolution Operation (QACO) consisting of a quantum amplitude encoding and its inverse is theoretically shown to be equivalent to the quantum normalization of the convolution operation based on the Frobenius inner product while achieving an efficient characterization of the data. Subsequently, QACO is extended into a Quantum Adjoint Convolutional Layer (QACL) by Quantum Phase Estimation (QPE) to compute all Frobenius inner products in parallel. At last, comparative simulation experiments are carried out on PennyLane and TensorFlow platforms, mainly for the two cases of kernel fixed and unfixed in QACL. The results demonstrate that QACL with the insight of special quantum properties for the same images, provides higher training accuracy in MNIST and Fashion MNIST classification experiments, but sacrifices the learning performance to some extent. Predictably, our research lays the foundation for the development of efficient and interpretable quantum convolutional networks and also advances the field of quantum machine vision.
Despite many common concepts with classical computer science, quantum computing is still widely considered as a special discipline within the broad field of theoretical physics. One reason for the slow adoption of QC by the computer science community is the confusing variety of formalisms (Dirac notation, matrices, gates, operators, etc.), none of which has any similarity with classical programming languages, as well as the rather “physical” terminology in most of the available literature. QCL (Quantum Computation Language) tries to fill this gap: QCL is a hight level, architecture independent programming language for quantum computers, with a syntax derived from classical procedural languages like C or Pascal. This allows for the complete implementation and simulation of quantum algorithms (including classical components) in one consistent formalism. Chapter 1 is an introduction into the basic concepts of quantum programming,