Posts by Adam Szady

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

2. ICPC Quantum Computing Challenge results

   We are proud to announce that three of our employees placed among the top ten of the March 2021 ICPC Quantum Computing Challenge.

3. IBM Quantum Challenge – Adam's write-up

   This describes techniques used to get the second place in the IBM Quantum Challenge – week 3 excercise.

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

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

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