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.
We analyse the CX implementation cost of generic diagonal operators, based on the target device topology.
I present a solution leading to a score of 6065 (4th place in the final ranking). Additionally, I tell a brief history of attempted cost-lowering strategies.
We present experimental results on running unstructured search in spaces defined by 4, 5 and 6 qubits on ion-trapped quantum processor. Our best circuits obtained respectively 66%, 26% and 6% average probability of measuring the marked element.
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 …
Investigation of the distribution of samples produced by existing methods of sampling from a quantum Boltzmann distrubution and comparision them to purely theoretical values.
Presented during the Q2B Conference in Mountain View, CA.
Presentation slides can be found here.
YouTube video can be found here.