Uncomputation

Uncomputation is a technique, used in reversible circuits, for cleaning up temporary effects on ancilla bits so that they can be re-used.^[1]

Uncomputation is a fundamental step in quantum computing algorithms. Whether or not intermediate effects have been uncomputed affects how states interfere with each other when measuring results.^[2]

The process is primarily motivated by the principle of implicit measurement,^[3] since entanglement with garbage registers may cause unintentional side-effects such as superposition collapse.

References

^ Aaronson, Scott; Grier, Daniel; Schaeffer, Luke (2015). "The Classification of Reversible Bit Operations". arXiv:1504.05155 [quant-ph].
^ Aaronson, Scott (2002). "Quantum Lower Bound for Recursive Fourier Sampling". Quantum Information and Computation ():, 00. 3 (2): 165–174. arXiv:quant-ph/0209060. Bibcode:2002quant.ph..9060A.
^ Nielsen, Michael; Chuang, Isaac. "Quantum Computation and Quantum Information"

This quantum mechanics-related article is a stub. You can help Wikipedia by expanding it.

[1] Aaronson, Scott; Grier, Daniel; Schaeffer, Luke (2015). "The Classification of Reversible Bit Operations". arXiv:1504.05155 [quant-ph].

[2] Aaronson, Scott (2002). "Quantum Lower Bound for Recursive Fourier Sampling". Quantum Information and Computation ():, 00. 3 (2): 165–174. arXiv:quant-ph/0209060. Bibcode:2002quant.ph..9060A.

[3] Nielsen, Michael; Chuang, Isaac. "Quantum Computation and Quantum Information"

[1]

[2]

[3]