We consider an extension of Discrete Time Markov Chain queueing model to the quantum domain by use of Discrete Time Quantum Markov Chain. We introduce methods for numerical analysis of such models. Using this tools we show that quantum model behaves fundamentally differently from the classical one.
Quantum geometry on a discrete set means a directed graph with a weight associated to each arrow def...
AbstractThe program relative to the investigation of quantum Markov states for general one-dimension...
We study a classical model for the accumulation of errors in multi-qubit quantum computations. By mo...
We consider an extension of discrete time Markov chain queueing model to the quantum domain by use o...
Although security of quantum cryptography is provable based on principles of quantum mechanics, it c...
We derive a necessary and sufficient condition for a quantum process to be Markovian which coincides...
A Markov model defines a system of states, composed by the feasible transition paths between those s...
Graphical Models have various applications in science and engineering which include physics, bioinfo...
University of Technology Sydney. Faculty of Engineering and Information Technology.Markov chains hav...
Abstract. The quantum model of computation is a model, analogous to the probabilistic Turing machine...
The quantum model of computation is a probabilistic model, similar to the probabilistic Turing Machi...
Markovian approximation is a widely-employed idea in descriptions of the dynamics of open quantum s...
Covering both classical and quantum approaches, this unique and self-contained book presents the mos...
We investigate the problem of simulating classical stochastic processes through quantum dynamics and...
The program relative to the investigation of quantum Markov states for general one--dimensional spin...
Quantum geometry on a discrete set means a directed graph with a weight associated to each arrow def...
AbstractThe program relative to the investigation of quantum Markov states for general one-dimension...
We study a classical model for the accumulation of errors in multi-qubit quantum computations. By mo...
We consider an extension of discrete time Markov chain queueing model to the quantum domain by use o...
Although security of quantum cryptography is provable based on principles of quantum mechanics, it c...
We derive a necessary and sufficient condition for a quantum process to be Markovian which coincides...
A Markov model defines a system of states, composed by the feasible transition paths between those s...
Graphical Models have various applications in science and engineering which include physics, bioinfo...
University of Technology Sydney. Faculty of Engineering and Information Technology.Markov chains hav...
Abstract. The quantum model of computation is a model, analogous to the probabilistic Turing machine...
The quantum model of computation is a probabilistic model, similar to the probabilistic Turing Machi...
Markovian approximation is a widely-employed idea in descriptions of the dynamics of open quantum s...
Covering both classical and quantum approaches, this unique and self-contained book presents the mos...
We investigate the problem of simulating classical stochastic processes through quantum dynamics and...
The program relative to the investigation of quantum Markov states for general one--dimensional spin...
Quantum geometry on a discrete set means a directed graph with a weight associated to each arrow def...
AbstractThe program relative to the investigation of quantum Markov states for general one-dimension...
We study a classical model for the accumulation of errors in multi-qubit quantum computations. By mo...
Add to ORKG