We present novel ways of designing quantum (random access) memory, also known as quantum dictionary encoders or data-access oracles.

We analyze the CX implementation cost of generic diagonal operators, based on the target device topology.

We present a generalized approach to Clifford group construction for any abelian group.

We develop and optimize a novel Fixed-point Grover Adaptive Search for QUBO Problems based on our oracle design and previous works of Li et al. to obtain better performance guarantees than Gilliam et al.

We show that in some sense the only obstruction for a toric $xy$ model to have a topological order is a $U(1)$ gauge action.

We present a theoretical method for coherently controlling the dynamics of rotating molecules with a tailored-pulse optical centrifuge.

We present experimental results on running unstructured search in spaces defined by 4, 5, and 6 qubits on ion-trapped quantum processors.

We present experimental results on running 4-qubit unstructured search on IBM quantum processors.

We present a novel quantum algorithm for solving the unstructured search problem with one marked element.

A talk about a family of algorithms specifically constructed for NISQ computers, promising much better results at currently available qubit counts and circuit depths.

We present a family of 3-connected cubic planar Hamiltonian graphs with an exponential number of steps required by Thomason's algorithm.

Investigation of the distribution of samples produced by existing methods of sampling from a quantum Boltzmann distribution and comparison to purely theoretical values.