10 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…
Belief propagation for general graphical models with loops
Pedro Hack, Jonas Hitter, Christian B. Mendl +1
There is an increasing interest in scaling tensor network methods through belief propagation (BP), as well as increasing the accuracy of BP through tensor network methods. We devel…
ATLAS: Efficient Atom Rearrangement for Defect-Free Neutral-Atom Quantum Arrays Under Transport Loss
Otto Savola, Alexandru Paler
Neutral-atom quantum computers encode qubits in individually trapped atoms arranged in optical lattices. Achieving defect-free atom configurations is essential for high-fidelity qu…
Medusa: Detecting and Removing Failures for Scalable Quantum Computing
Karoliina Oksanen, Quan Hoang, Alexandru Paler
Quantum circuits will experience failures that lead to computational errors. We introduce Medusa, an automated compilation method for lowering a circuit's failure rate. Medusa uses…
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…