B1: Polynomial Oracle

Problem Statement

For an integer $x \; (0 \leq x < 8)$, define $f(x) = x^2 + x + 1 \pmod{8}$.

Implement an $6$-qubit oracle $O$ on a quantum circuit $\mathrm{qc}$.

For any pair of integers $(x,y)$ satisfying $0 \leq x < 8$ and $0 \leq y < 8$, the required transformation is as follows:

Here, $\oplus$ denotes the bitwise XOR operator.

Constraints

• Integers must be encoded by little-endian.
• Global phase is ignored in judge.
• The submitted code must follow the specified format:

from qiskit import QuantumCircuit, QuantumRegister
 
 
def solve() -> QuantumCircuit:
    x = QuantumRegister(3)
    y = QuantumRegister(3)
    qc = QuantumCircuit(x, y)
 
    # Write your code here:
 
    return qc

Hints