{"external_id":{"arxiv":["0607101"]},"_id":"573","title":"Counterfactual computation revisited","page":"12","month":"08","date_updated":"2020-05-12T08:23:52Z","date_created":"2018-12-11T11:47:16Z","status":"public","type":"preprint","day":"06","year":"2006","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/quant-ph/0607101"}],"date_published":"2006-08-06T00:00:00Z","author":[{"orcid":"0000-0002-2031-204X","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","first_name":"Onur","full_name":"Hosten, Onur","last_name":"Hosten"},{"full_name":"Rakher, Matthew","last_name":"Rakher","first_name":"Matthew"},{"first_name":"Julio","last_name":"Barreiro","full_name":"Barreiro, Julio"},{"last_name":"Peters","full_name":"Peters, Nicholas","first_name":"Nicholas"},{"first_name":"Paul","last_name":"Kwiat","full_name":"Kwiat, Paul"}],"publication_status":"published","citation":{"short":"O. Hosten, M. Rakher, J. Barreiro, N. Peters, P. Kwiat, (2006).","apa":"Hosten, O., Rakher, M., Barreiro, J., Peters, N., &#38; Kwiat, P. (2006). Counterfactual computation revisited. ArXiv.","mla":"Hosten, Onur, et al. <i>Counterfactual Computation Revisited</i>. ArXiv, 2006.","ista":"Hosten O, Rakher M, Barreiro J, Peters N, Kwiat P. 2006. Counterfactual computation revisited.","ama":"Hosten O, Rakher M, Barreiro J, Peters N, Kwiat P. Counterfactual computation revisited. 2006.","ieee":"O. Hosten, M. Rakher, J. Barreiro, N. Peters, and P. Kwiat, “Counterfactual computation revisited.” ArXiv, 2006.","chicago":"Hosten, Onur, Matthew Rakher, Julio Barreiro, Nicholas Peters, and Paul Kwiat. “Counterfactual Computation Revisited.” ArXiv, 2006."},"oa":1,"oa_version":"Preprint","language":[{"iso":"eng"}],"article_processing_charge":"No","extern":"1","publist_id":"7241","abstract":[{"text":"Mitchison and Jozsa recently suggested that the &quot;chained-Zeno&quot; counterfactual computation protocol recently proposed by Hosten et al. is counterfactual for only one output of the computer. This claim was based on the existing abstract algebraic definition of counterfactual computation, and indeed according to this definition, their argument is correct. However, a more general definition (physically adequate) for counterfactual computation is implicitly assumed by Hosten et. al. Here we explain in detail why the protocol is counterfactual and how the &quot;history tracking&quot; method of the existing description inadequately represents the physics underlying the protocol. Consequently, we propose a modified definition of counterfactual computation. Finally, we comment on one of the most interesting aspects of the error-correcting protocol. ","lang":"eng"}],"publisher":"ArXiv","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"}