Counterfactual computation

  title={Counterfactual computation},
  author={G. Mitchison and R. Jozsa},
  journal={Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences},
  pages={1175 - 1193}
  • G. Mitchison, R. Jozsa
  • Published 2001
  • Physics
  • Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
  • Suppose that we are given a quantum computer programmed ready to perform a computation if it is switched on. Counterfactual computation is a process by which the result of the computation may be learnt without actually running the computer. Such processes are possible within quantum physics and to achieve this effect a computer embodying the possibility of running the computation must be available, even though the computation is, in fact, not run. We study the possibilities and limitations of… CONTINUE READING

    Figures and Tables from this paper.

    Non-deterministic quantum programming
    • 19
    • Highly Influenced
    • PDF
    Termination of nondeterministic quantum programs
    • 13
    • PDF
    Algorithmic analysis of termination problems for quantum programs
    • 15
    Hypercomputation and the Physical Church‐Turing Thesis
    • 46
    • PDF
    Compiling quantum programs
    • 21
    • PDF
    Counterfactuals in Quantum Mechanics
    • 15
    • PDF
    On Counterfactual Computation
    Upper Bounds on Quantum Query Complexity Inspired by the Elitzur-Vaidman Bomb Tester
    • 11
    • PDF
    Modification of counterfactual communication protocols that eliminates weak particle traces
    • 9
    • Highly Influenced


    Publications referenced by this paper.
    Shadows of the Mind, Oxford University
    • 1994
    Consider next the case where both types of CF outcome occur (Table 2). With U 0
      we would need an extra final rotation step