6 Evaluating classical functions on a quantum computer

 

This chapter covers

  • Implementing classical functions on a quantum computer as reversible computations
  • Implementing Boolean logic functions as quantum operations
  • Using Q# and Qiskit to implement reversible computations
  • Testing reversible computations

The problems we considered in the previous four chapters, versatile as they are, all have something in common. These problems either have no classical analogue (how do you even define an eigenphase of a classical function?) or that analogue is so simple that it doesn’t make sense to think of it as a separate problem, such as assigning a value to a variable or reading out the value of the variable.

6.1 Reversible computing: Mapping classical computation onto quantum

6.2 Evaluating single-bit functions

6.2.1 Math

6.2.2 Qiskit

6.2.3 Q#

6.3 Testing reversible computations

6.3.1 Qiskit

6.3.2 Q#

6.4 Evaluating Boolean operations

6.4.1 Math

6.4.2 Qiskit

6.4.3 Q#

6.5 Evaluating Boolean expressions

6.5.1 Math

6.5.2 Qiskit

6.5.3 Q#

6.6 Going beyond

Summary