14 citations · 19 across the 4 of their papers we have counts for
4 papers
Diagonal operator decomposition on restricted topologies via enumeration of quantum state subsets
Jan Tułowiecki, Łukasz Czerwiński, Konrad Deka +3
Various quantum algorithms require usage of arbitrary diagonal operators as subroutines. For their execution on a physical hardware, those operators must be first decomposed into t…
Efficient unstructured search implementation on current ion-trap quantum processors
Vladyslav Hlembotskyi, Rafał Burczyński, Witold Jarnicki +2
So far, only the results on 3 qubit spaces (both on superconducting and ion-trap realisations of quantum processors) have beaten the classical unstructured search in the expected n…
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…
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 $…