37 citations · 38 across the 8 of their papers we have counts for
7 papers · 1 filter
Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network
Evan E. Dobbs, Robert Basmadjian, Alexandru Paler +1
Predicting the optimum SWAP depth of a quantum circuit is useful because it informs the compiler about the amount of necessary optimization. Fast prediction methods will prove esse…
Fast quantum circuit simulation using hardware accelerated general purpose libraries
Oumarou Oumarou, Alexandru Paler, Robert Basmadjian
Quantum circuit simulators have a long tradition of exploiting massive hardware parallelism. Most of the times, parallelism has been supported by special purpose libraries tailored…
Halving the width of Toffoli based constant modular addition to n+3 qubits
Oumarou Oumarou, Alexandru Paler, Robert Basmadjian
We present an arithmetic circuit performing constant modular addition having depth of Toffoli gates and using a total of qubits. This is an improvement by a…
On the realistic worst case analysis of quantum arithmetic circuits
Alexandru Paler, Oumarou Oumarou, Robert Basmadjian
We provide evidence that commonly held intuitions when designing quantum circuits can be misleading. In particular we show that: a) reducing the T-count can increase the total dept…
QUANTIFY: A framework for resource analysis and design verification of quantum circuits
Oumarou Oumarou, Alexandru Paler, Robert Basmadjian
Quantum resource analysis is crucial for designing quantum circuits as well as assessing the viability of arbitrary (error-corrected) quantum computations. To this end, we introduc…
Parallelising the Queries in Bucket Brigade Quantum RAM
Alexandru Paler, Oumarou Oumarou, Robert Basmadjian
Quantum algorithms often use quantum RAMs (QRAM) for accessing information stored in a database-like manner. QRAMs have to be fast, resource efficient and fault-tolerant. The latte…