A4: Cyclic Shift Oracle III

Problem Statement

Given an integer $n$, implement an $n+1$-qubit oracle $O$ on a quantum circuit $\mathrm{qc}$.

For any pair of integers $(m,k)$ satisfying $0 \leq k < 2^n$ and $0 \leq m < 2$, the oracle must perform the following transformation:

Constraints

• $1 \leq n \leq 10$
• The quantum circuit depth must not exceed $4$.
• 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
 
 
def solve(n: int) -> QuantumCircuit:
    qc = QuantumCircuit(n + 1)
    # Write your code here:
 
    return qc

Hints