14 citations · 19 across the 3 of their papers we have counts for
3 papers
quant-ph2020★ 3 cited
Benchmarking 16-element quantum search algorithms on superconducting quantum processors
Jan Gwinner, Marcin Briański, Wojciech Burkot +2
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 algo…
quant-ph2020★ 14 cited
Introducing Structure to Expedite Quantum Search
Marcin Briański, Jan Gwinner, Vladyslav Hlembotskyi +3
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 f…
math.CO2019★ 2 cited
A short note on graphs with long Thomason's chains
Marcin Briański, Adam Szady
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 $…