Abstract
In this paper we pursue two targets. First, showing that counterfactual computation can be rigorously formalised as a quantum computation. Second, presenting a new counterfactual protocol which improve previous protocols. Counterfactual computation makes use of quantum mechanics’ peculiarities to infer the outcome of a quantum computation without running that computation. In this paper, we first cast the definition of counterfactual protocol in the quantum programming language qGCL, thereby showing that counterfactual computation is an example of quantum computation. Next, we formalise in qGCL a probabilistic extension of counterfactual protocol for decision problems (whose result is either 0 or 1). If p \(_{G}^{r}\) denotes for protocol G the probability of obtaining result r “for free” (i.e. without running the quantum computer), then we show that for any probabilistic protocol p \(_{G}^{\rm 0}\) + p \(_{G}^{\rm 1}\) ≤ 1 (as for non-probabilistic protocols). Finally, we present a probabilistic protocol K which satisfies p \(_{K}^{\rm 0}\)+p \(_{K}^{\rm 1}\)=1, thus being optimal. Furthermore, the result is attained with a single insertion of the quantum computer, while it has been shown that a non-probabilistic protocol would obtain the result only in the limit (i.e. with an infinite number of insertions).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Elitzur, A.C., Vaidman, L.: Quantum mechanical interaction-free measurements. Foundations of Physics 32(7), 987–997 (1993)
Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th Annual symposium on the theory of Computing, pp. 212–219 (1996)
Jifeng, H., McIver, A., Seidel, K.: Probabilistic models for the guarded command language. Science of Computer Programming 28, 171–192 (1997)
Jozsa, R.: Quantum effects in algorithms. In: Williams, C.P. (ed.) QCQC 1998. LNCS, vol. 1509, pp. 103–112. Springer, Heidelberg (1999)
Mitchison, G., Jozsa, R.: Counterfactual computation. Proceedings of the Royal Society of London, A 457, 1175–1193 (2001)
Morgan, C., McIver, A., Seidel, K.: Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems 18(3), 325–353 (1996)
Sanders, J.W., Zuliani, P.: Quantum programming. In: Backhouse, R., Oliveira, J.N. (eds.) MPC 2000. LNCS, vol. 1837, pp. 80–99. Springer, Heidelberg (2000)
White, G.A., Mitchell, F.R., Nairz, O., Kwiat, P.: Interaction-free imaging. Physical Review A 58, 605–613 (1998)
Zuliani, P.: Compiling quantum programs. To appear in Acta Informatica (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zuliani, P. (2005). On Counterfactual Computation. In: Calude, C.S., Dinneen, M.J., Păun, G., Pérez-Jímenez, M.J., Rozenberg, G. (eds) Unconventional Computation. UC 2005. Lecture Notes in Computer Science, vol 3699. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11560319_23
Download citation
DOI: https://doi.org/10.1007/11560319_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29100-8
Online ISBN: 978-3-540-32022-7
eBook Packages: Computer ScienceComputer Science (R0)