94 citations · 376 across the 55 of their papers we have counts for
10 papers · 1 filter
Evaluating Calibration-Based Digital Twins for IBM Quantum Hardware Simulation
Edgars Bautra, Maksims Dimitrijevs, Abuzer Yakaryilmaz
We evaluate calibration-based digital twins for IBM Quantum hardware, aiming to reproduce hardware measurement outcomes on classical simulators. We present a workflow that builds t…
Benchmarking the Lights Out Problem on Real Quantum Hardware
Maksims Dimitrijevs, Maria Palchiha, Abuzer Yakaryilmaz
We implement the Lights Out problem on a 2D grid and on Mobius ladder graphs and evaluate the performance of Grover's search on real quantum hardware. We use two instances using 9…
QIP AM(2QCFA)
Abuzer Yakaryılmaz
The class of languages having polynomial-time classical or quantum interactive proof systems ( or , respectively) is identical to . We s…
A Representative Framework for Implementing Quantum Finite Automata on Real Devices
Aliya Khadieva, Özlem Salehi, Abuzer Yakaryılmaz
We present a framework for the implementation of quantum finite automata algorithms designed for the language on gate-based quantum com…
GAPs for Shallow Implementation of Quantum Finite Automata
Mansur Ziiatdinov, Aliya Khadieva, Abuzer Yakaryılmaz
Quantum fingerprinting is a technique that maps classical input word to a quantum state. The obtained quantum state is much shorter than the original word, and its processing uses…
Quantum advantage using high-dimensional twisted photons as quantum finite automata
Stephen Z. D. Plachta, Markus Hiekkamäki, Abuzer Yakaryılmaz +1
Quantum finite automata (QFA) are basic computational devices that make binary decisions using quantum operations. They are known to be exponentially memory efficient compared to t…