5 papers
On the Constant Depth Implementation of Pauli Exponentials
Ioana Moflic, Alexandru Paler
We decompose, under the very restrictive linear nearest-neighbour connectivity, exponentials of arbitrary length into circuits of constant depth using $\mathcal{O}(…
Superconducting qubits in the millions: the potential and limitations of modularity
S. N. Saadatmand, Tyler L. Wilson, Mark J. Hodson +11
The development of fault-tolerant quantum computers (FTQCs) is receiving increasing attention within the quantum computing community. Like conventional digital computers, FTQCs, wh…
QASER: Breaking the Depth vs. Accuracy Trade-Off for Quantum Architecture Search
Ioana Moflic, Alexandru Paler, Akash Kundu
Quantum computing faces a key challenge: balancing the need for low circuit depth (crucial for fault tolerance) with the high accuracy required for complex computations like quantu…
Ultra-Large-Scale Compilation and Manipulation of Quantum Circuits with Pandora
Ioana Moflic, Alexandru Paler
There is an enormous gap between what quantum circuit sizes can be compiled and manipulated with the current generation of quantum software and the sizes required by practical appl…
Quantum Circuit Caches and Compressors for Low Latency, High Throughput Computing
Ioana Moflic, Alan Robertson, Simon J. Devitt +1
Utility-scale quantum programs contain operations on the order of which must be prepared and piped from a classical co-processor to the control unit of the quantum devic…