{"year":"2005","volume":1,"title":"Counterfactual quantum computation","date_updated":"2021-01-12T08:03:18Z","date_created":"2018-12-11T11:47:16Z","conference":{"name":"QELS: Quantum Electronics and Laser Science"},"intvolume":"         1","date_published":"2005-01-01T00:00:00Z","publication_status":"published","month":"01","doi":" 10.1109/QELS.2005.1548783","citation":{"apa":"Hosten, O., Rakher, M., Barreiro, J., Peters, N., &#38; Kwiat, P. (2005). Counterfactual quantum computation (Vol. 1, pp. 365–367). Presented at the QELS: Quantum Electronics and Laser Science, IEEE. <a href=\"https://doi.org/ 10.1109/QELS.2005.1548783\">https://doi.org/ 10.1109/QELS.2005.1548783</a>","ama":"Hosten O, Rakher M, Barreiro J, Peters N, Kwiat P. Counterfactual quantum computation. In: Vol 1. IEEE; 2005:365-367. doi:<a href=\"https://doi.org/ 10.1109/QELS.2005.1548783\"> 10.1109/QELS.2005.1548783</a>","ieee":"O. Hosten, M. Rakher, J. Barreiro, N. Peters, and P. Kwiat, “Counterfactual quantum computation,” presented at the QELS: Quantum Electronics and Laser Science, 2005, vol. 1, pp. 365–367.","chicago":"Hosten, Onur, Matthew Rakher, Julio Barreiro, Nicholas Peters, and Paul Kwiat. “Counterfactual Quantum Computation,” 1:365–67. IEEE, 2005. <a href=\"https://doi.org/ 10.1109/QELS.2005.1548783\">https://doi.org/ 10.1109/QELS.2005.1548783</a>.","short":"O. Hosten, M. Rakher, J. Barreiro, N. Peters, P. Kwiat, in:, IEEE, 2005, pp. 365–367.","ista":"Hosten O, Rakher M, Barreiro J, Peters N, Kwiat P. 2005. Counterfactual quantum computation. QELS: Quantum Electronics and Laser Science, QELS, vol. 1, 365–367.","mla":"Hosten, Onur, et al. <i>Counterfactual Quantum Computation</i>. Vol. 1, IEEE, 2005, pp. 365–67, doi:<a href=\"https://doi.org/ 10.1109/QELS.2005.1548783\"> 10.1109/QELS.2005.1548783</a>."},"alternative_title":["QELS"],"publist_id":"7237","quality_controlled":0,"_id":"575","status":"public","abstract":[{"text":"We present the first demonstration of Jozsa's &quot;counterfactual computation&quot;, using an optical Grover's search algorithm. We put the algorithm in a superposition of 'running' and 'not-running', obtaining information even though the algorithm does not run.","lang":"eng"}],"author":[{"first_name":"Onur","full_name":"Onur Hosten","last_name":"Hosten","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2031-204X"},{"first_name":"Matthew","last_name":"Rakher","full_name":"Rakher, Matthew T"},{"last_name":"Barreiro","full_name":"Barreiro, Julio T","first_name":"Julio"},{"first_name":"Nicholas","full_name":"Peters, Nicholas A","last_name":"Peters"},{"first_name":"Paul","full_name":"Kwiat, Paul G","last_name":"Kwiat"}],"publisher":"IEEE","type":"conference","extern":1,"page":"365 - 367","day":"01"}