Related papers: Symbolic bisimulation for quantum processes
Quantum computers are expected to offer substantial speedups over their classical counterparts and to solve problems that are intractable for classical computers. Beyond such practical significance, the concept of quantum computation opens…
Symbolic models are abstract descriptions of continuous systems in which symbols represent aggregates of continuous states. In the last few years there has been a growing interest in the use of symbolic models as a tool for mitigating…
One of the challenges in quantum information is the demonstration of quantum coherence in the operations of experimental devices. While full quantum process tomography can do the job, it is both cumbersome and unintuitive. In this…
In this work, the operator-sum representation of a quantum process is extended to the probability representation of quantum mechanics. It is shown that each process admitting the operator-sum representation is assigned a kernel, convolving…
The possibility of simulating a stochastic process by the intrinsic randomness of quantum system is investigated. Two simulations of Markov Chains by the measurements of quantum systems are proposed.
We present symQV, a symbolic execution framework for writing and verifying quantum computations in the quantum circuit model. symQV can automatically verify that a quantum program complies with a first-order specification. We formally…
We present a protocol to simulate the quantum correlations of an arbitrary bipartite state, when the parties perform a measurement according to two traceless binary observables. We show that $\log(d)$ bits of classical communication is…
With recent progress on experimental quantum information processing, an important question has arisen as to whether it is possible to verify arbitrary computation performed on a quantum processor. A number of protocols have been proposed to…
We define a notion of normal form bisimilarity for the untyped call-by-value lambda calculus extended with the delimited-control operators shift and reset. Normal form bisimilarities are simple, easy-to-use behavioral equivalences which…
There has been a long history of using fuzzy language equivalence to compare the behavior of fuzzy systems, but the comparison at this level is too coarse. Recently, a finer behavioral measure, bisimulation, has been introduced to fuzzy…
We study the problem of computing the reachable principals of simulation preorder and the reachable blocks of simulation equivalence. Following a theoretical investigation of the decidability and complexity aspects of this problem, which in…
As a cornerstone of automated reasoning, equational reasoning finds equivalences between symbolic expressions and fuels advances across scientific disciplines. Yet, its potential remains limited by the exponential growth of equivalent…
We find that the perfect distinguishability of two quantum operations by a parallel scheme depends only on an operator subspace generated from their Choi-Kraus operators. We further show that any operator subspace can be obtained from two…
We present "Diagrams of States", a way to graphically represent and analyze how quantum information is elaborated during the execution of quantum circuits. This introductory tutorial illustrates the basics, providing useful examples of…
Simulating quantum mechanics is known to be a difficult computational problem, especially when dealing with large systems. However, this difficulty may be overcome by using some controllable quantum system to study another less controllable…
Solving parity games, which are equivalent to modal $\mu$-calculus model checking, is a central algorithmic problem in formal methods. Besides the standard computation model with the explicit representation of games, another important…
Formal methods have been a successful approach for modelling and verifying the correctness of complex technologies like microprocessor chip design, biological systems and others. This is the main motivation of developing quantum formal…
In this work, we generalize the concept of bisimulation metric in order to metrize the behaviour of continuous-time processes. Similarly to what is done for discrete-time systems, we follow two approaches and show that they coincide: as a…
We develop a general framework for self-testing, in which bipartite correlations are described by states on the commuting tensor product of a pair of operator systems. We propose a definition of a local isometry between bipartite quantum…
We present computable criterion for completely classifying multi-qubit quantum states under local unitary operations. The criterion can be used to detect whether two quantum states in multi-qubit systems are local unitary equivalent or not.…