Publications

1. Spoofing of Quantum Channels Enables Low-Rank Projective Simulation

   We present a method for quadratic improvement of simulation of quantum channels in the regime of sub-exponential resources.

2. Novel oracle constructions for quantum random access memory

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

3. 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.

4. Clifford circuits over non-cyclic abelian groups

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

5. Fixed-point Grover Adaptive Search for QUBO Problems

   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.

6. Anyons in a highly-entangled toric xy model

   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.

7. Creating rotational coherences in molecules aligned along the intermediate moment of inertia axis

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

8. Efficient unstructured search implementation on current ion-trap quantum processors

   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.

9. 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 …

10. 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 …

11. Quantum Computing Algorithms for NISQ Era

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

    Presented during the Quantum Computing Meetup in Washington, DC.

    Presentation slides can be found here.

12. A short note on graphs with long Thomason's chains

    We present a family of 3-connected cubic planar Hamiltonian graphs with an exponential number of steps required by Thomason's algorithm. The base of the exponent is approximately 1.1812…, which exceeds previous results in the area.

    Publication can be found here.

13. Quantum Boltzmann sampling – noisiness of some existing hardware approaches

    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.