Abstract In the domain of information systems ontologies, notion completeness refers to ontological contents by demanding that they be exhaustive with respect ontology aims represent. The purpose this paper is analyze such a notion, distinguishing different varieties and questioning its consistency open-world assumption, which formally assumes incompleteness conceptualizations on ontologies.

There are various gate sets used for describing quantum computation. A particularly popular one consists of Clifford gates and arbitrary single-qubit phase gates. Computations in this set can be elegantly described by the ZX-calculus, a graphical language class string diagrams linear maps between qubits. The ZX-calculus has proven useful variety areas information, but is less suitable reasoning...