Diagonal operator decomposition on restricted topologies via enumeration of quantum state subsets
We analyse the CX implementation cost of generic diagonal operators, based on the target device topology.
Posts by Jan Gwinner
Benchmarking 16-element quantum search algorithms on IBM quantum processors
We present experimental results on running 4-qubit unstructured search on IBM quantum processors. Our best attempt attained probability of success around 24.5%. We try several algorithms and use the most recent developments in quantum search to reduce the number of entangling gates that are currently considered the main source …
Introducing Structure to Expedite Quantum Search
We present a novel quantum algorithm for solving the unstructured search problem with one marked element. Our algorithm allows generating quantum circuits that use asymptotically fewer additional quantum gates than the famous Grover's algorithm and may be successfully executed on NISQ devices. We prove that our algorithm is optimal in …