Mark Ariel Levin*
Journal of Quantum Computing, Vol.6, pp. 15-24, 2024, DOI:10.32604/jqc.2024.047423
- 24 April 2024
Abstract Quantum algorithms for unstructured search problems rely on the preparation of a uniform superposition, traditionally achieved through Hadamard gates. However, this incidentally creates an auxiliary search space consisting of nonsensical answers that do not belong in the search space and reduce the efficiency of the algorithm due to the need to neglect, un-compute, or destructively interfere with them. Previous approaches to removing this auxiliary search space yielded large circuit depth and required the use of ancillary qubits. We have developed an optimized general solver for a circuit that prepares a uniform superposition of any N More >
Login
Register
