Related papers: Bisimulation for quantum processes
An approach is presented treating decision theory as a probabilistic theory based on quantum techniques. Accurate definitions are given and thorough analysis is accomplished for the quantum probabilities describing the choice between…
Recurrent neurons, or "simulated" qubits, can store simultaneous true and false with probabilistic behaviors usually reserved for the qubits of quantum physics. Although possible to construct artificially, simulated qubits are intended to…
Quantum Computing promises accelerated simulation of certain classes of problems, in particular in plasma physics. Given the nascent interest in applying quantum computing techniques to study plasma systems, a compendium of the relevant…
Although the laws of classical physics are deterministic, thermodynamics gives rise to an arrow of time through irreversible processes. In quantum mechanics the unitary nature of the time evolution makes it intrinsically reversible, however…
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum algorithms can be identified when quantum…
We introduce a Geometry of Interaction model for higher-order quantum computation, and prove its adequacy for a full quantum programming language in which entanglement, duplication, and recursion are all available. Our model comes with a…
As a step in the architectural design of a quantum processing or sensing system with control and signaling, an attempt is made at putting in parallel functional properties of the random flows between neurons through electrical synapses, and…
We obtain sufficient conditions for the efficient simulation of a continuous variable quantum algorithm or process on a classical computer. The resulting theorem is an extension of the Gottesman-Knill theorem to continuous variable quantum…
We introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on average. This is done by exploiting the same aspects of problem…
We introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on average. This is done by exploiting the same aspects of problem…
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 develop a pseudo-metric analogue of bisimulation for generalized semi-Markov processes. The kernel of this pseudo-metric corresponds to bisimulation; thus we have extended bisimulation for continuous-time probabilistic processes to a…
In this paper, a quantum version of classical alternating bit protocol is proposed. This protocol provides a reliable method to transmit the secret quantum data via a noisy quantum channel while the entanglement between particles is not…
One of the central themes in classical cryptography is multi-party computation, which performs joint computation on multiple participants' data while maintaining data privacy. The extension to the quantum regime was proposed in 2002, but…
We present a way to apply quantum logic to the study of quantum programs. This is made possible by using an extension of the usual propositional language in order to make transformations performed on the system appear explicitly. This way,…
Recently Quantum Computation has generated a lot of interest due to the discovery of a quantum algorithm which can factor large numbers in polynomial time. The usefulness of a quantum com puter is limited by the effect of errors. Simulation…
Quantum computation teaches us that quantum mechanics exhibits exponential complexity. We argue that the standard scientific paradigm of "predict and verify" cannot be applied to testing quantum mechanics in this limit of high complexity.…
Multi-particle interference is a key resource for quantum information processing, as exemplified by Boson Sampling. Hence, given its fragile nature, an essential desideratum is a solid and reliable framework for its validation. However,…
Distributed quantum computing is a promising computational paradigm for performing computations that are beyond the reach of individual quantum devices. Privacy in distributed quantum computing is critical for maintaining confidentiality…
Although a universal quantum computer is still far from reach, the tremendous advances in controllable quantum devices, in particular with solid-state systems, make it possible to physically implement "quantum simulators". Quantum…