Best,

Joe

Abstract:
A quantum algorithm to solve a specific problem is often described in terms of a quantum circuit and some quantum algorithms require a specific quantum state at the beginning of the computation. Therefore, efficient quantum state preparation is an important task. The preparation of quantum states is performed by a quantum circuit consisting of Controlled-NOT (CNOT) and single-qubit gates. Known algorithms to prepare arbitrary quantum states with n qubits create quantum circuits with O(2n) runtime and CNOTs that are relatively expensive over single-qubit gates in NISQ architectures. To reduce runtime and the number of CNOTs, we simplify the problem by only considering an important family of quantum states, which are Uniform Quantum States (UQSs). We map UQSs to Boolean functions and propose a Boolean method to prepare them.  Our method simplifies the problem and enables us to apply well-understood techniques from logic synthesis.