Related papers: Relations among quantum processes: bisimilarity an…
Using a quantumlike description for light propagation in nonhomogeneous optical fibers, quantum information processing can be implemented by optical means. Quantum-like bits (qulbits) are associated to light modes in the optical fiber and…
Quantifying the resources available to a quantum computer appears to be necessary to separate quantum from classical computation. Among them, entanglement, nonstabilizerness and coherence are arguably of great significance. We introduce…
The analysis of concurrent and reactive systems is based to a large degree on various notions of process equivalence, ranging, on the so-called linear-time/branching-time spectrum, from fine-grained equivalences such as strong bisimilarity…
We establish an axiomatization for quantum processes, which is a quantum generalization of process algebra ACP (Algebra of Communicating Processes). We use the framework of a quantum process configuration $\langle p, \varrho\rangle$, but we…
The landscape of causal relations that can hold among a set of systems in quantum theory is richer than in classical physics. In particular, a pair of time-ordered systems can be related as cause and effect or as the effects of a common…
We have unified quantum and classical computing in open quantum systems called qACP which is a quantum generalization of process algebra ACP. But, an axiomatization for quantum and classical processes with an assumption of closed quantum…
Precise rules are developed in order to formalize the reasoning processes involved in standard non-relativistic quantum mechanics, with the help of analogies from classical physics. A classical or quantum description of a mechanical system…
Truly concurrent process algebras are generalizations to the traditional process algebras for true concurrency, CTC to CCS, APTC to ACP, $\pi_{tc}$ to $\pi$ calculus, APPTC to probabilistic process algebra, APTC with localities to process…
More than a century after the inception of quantum theory, the question of which traits and phenomena are fundamentally quantum remains under debate. Here we give an answer to this question for temporal processes which are probed…
We initiate the study of parallel quantum programming by defining the operational and denotational semantics of parallel quantum programs. The technical contributions of this paper include: (1) find a series of useful proof rules for…
This paper serves as a bridge between quantum computing and analogical modeling (a general theory for predicting categories of behavior in varying contexts). Since its formulation in the early 1980s, analogical modeling has been…
The oracle model of computation is believed to allow a rigorous proof of quantum over classical computational superiority. Since quantum and classical oracles are essentially different, a correspondence principle is commonly implicitly used…
We explain the use of quantum process calculus to describe and analyse linear optical quantum computing (LOQC). The main idea is to define two processes, one modelling a linear optical system and the other expressing a specification, and…
This study examines the simulation of quantum algorithms on a classical computer. The program code implemented on a classical computer will be a straight connection between the mathematical formulation of quantum mechanics and computational…
We develop a formal model for distributed measurement-based quantum computations, adopting an agent-based view, such that computations are described locally where possible. Because the network quantum state is in general entangled, we need…
A quantum state is called concordant if it has zero quantum discord with respect to any part. By extension, a concordant computation is one such that the state of the computer, at each time step, is concordant. In this paper, I describe a…
Although quantum coherence is a basic trait of quantum mechanics, the presence of coherences in the quantum description of a certain phenomenon does not rule out the possibility to give an alternative description of the same phenomenon in…
The two main notions of control in quantum programming languages are often referred to as "quantum" control and "classical" control. With the latter, the control flow is based on classical information, potentially resulting from a quantum…
Quantum algorithms are sequences of abstract operations, performed on non-existent computers. They are in obvious need of categorical semantics. We present some steps in this direction, following earlier contributions of Abramsky, Coecke…
This is the second part of a three-part overview, in which we derive the category-theoretic backbone of quantum theory from a process ontology, treating quantum theory as a theory of systems, processes and their interactions. In this part…