124 citations · 166 across the 17 of their papers we have counts for
21 papers · 1 filter
Transversal Injection: A method for direct encoding of ancilla states for non-Clifford gates using stabiliser codes
Jason Gavriel, Daniel Herr, Alexis Shaw +3
Fault-tolerant, error-corrected quantum computation is commonly acknowledged to be crucial to the realisation of large-scale quantum algorithms that could lead to extremely impactf…
Quantum Fourier Addition, Simplified to Toffoli Addition
Alexandru Paler
Quantum addition circuits are considered being of two types: 1) Toffolli-adder circuits which use only classical reversible gates (CNOT and Toffoli), and 2) QFT-adder circuits base…
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…
Removing leakage-induced correlated errors in superconducting quantum error correction
M. McEwen, D. Kafri, Z. Chen +48
Quantum computing can become scalable through error correction, but logical error rates only decrease with system size when physical errors are sufficiently uncorrelated. During co…
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…