Extended Quantum Computing Patterns

Apply reversible Boolean logic to values encoded in quantum registers.

An oracle, arithmetic routine, or another quantum component must evaluate a classical logical expression without measuring its inputs.

The operation must preserve reversibility. Additional ancillas may be needed for intermediate values, and those ancillas should be returned to their initial state.

Build reversible AND, OR, XOR, NOT, equality, or inner-product operations from controlled quantum gates and uncompute temporary results after use.

The Boolean function is evaluated coherently and can be used within a larger quantum algorithm.

Toffoli-based AND, CNOT-based XOR, reversible comparators, and inner products modulo two.

Oracle; Quantum Arithmetic; Uncompute

Logical and comparison components in the Qiskit circuit library and Classiq's reusable function library.