activity
20022015
most citedProbabilistic Model--Checking of Quantum Protocols

51 citations · 166 across the 13 of their papers we have counts for

collaborators
Showing quant-phShow all

8 papers · 1 filter

quant-ph2008

Second Quantized Kolmogorov Complexity

Caroline Rogers, Vlatko Vedral, Rajagopal Nagarajan

The Kolmogorov complexity of a string is the length of its shortest description. We define a second quantised Kolmogorov complexity where the length of a description is defined to…

quant-ph2008★ 7 cited

Lossless Quantum Prefix Compression for Communication Channels that are Always Open

Markus Mueller, Caroline Rogers, Rajagopal Nagarajan

We describe a method for lossless quantum compression if the output of the information source is not known. We compute the best possible compression rate, minimizing the expected b…

quant-ph2007★ 1 cited

QMC: A Model Checker for Quantum Systems

Simon Gay, Rajagopal Nagarajan, Nikolaos Papanikolaou

We introduce a model-checking tool intended specially for the analysis of quantum information protocols. The tool incorporates an efficient representation of a certain class of qua…

quant-ph2005★ 2 cited

Lossless Quantum Compression

Caroline Rogers, Rajagopal Nagarajan

We describe lossless quantum compression of unknown mixtures (of non-orthogonal states) and give an expression of the optimal rate of compression.

quant-ph2005★ 51 cited

Probabilistic Model--Checking of Quantum Protocols

Simon Gay, Rajagopal Nagarajan, Nikolaos Papanikolaou

We establish fundamental and general techniques for formal verification of quantum protocols. Quantum protocols are novel communication schemes involving the use of quantum-mechani…

quant-ph2004★ 6 cited

Communicating Quantum Processes

Simon Gay, Rajagopal Nagarajan

We define a language CQP (Communicating Quantum Processes) for modelling systems which combine quantum and classical communication and computation. CQP combines the communication p…