This final project contains two parts:
Project A:
https://github.com/xiaonac/GroverAdaptiveSearch
This project implements the Grover Adaptive Search (GAS) algorithm in Qiskit to solve constrained binary optimization problems. It finds the bitstring x that maximizes a polynomial objective function f(x) while also satisfying a polynomial constraint C(x)\ge 0. The algorithm works by iteratively using Grover's search to find a feasible solution that improves upon the current best threshold, then updating that threshold until an optimum is found.

Project B:
https://github.com/xiaonac/QuantumStatePrep
This project implements an algorithm for arbitrary quantum state preparation in Qiskit. It constructs a quantum circuit that transforms the initial |0...0> state into any desired target state. The method applies a series of uniformly controlled R_y gates to set the correct state vector amplitudes, then applies controlled R_z gates to get the correct phases.