88 citations · 89 across the 5 of their papers we have counts for
5 papers
An experience-based classification of quantum bugs in quantum software
Nils Quetschlich, Olivia Di Matteo
As quantum computers continue to improve in quality and scale, there is a growing need for accessible software frameworks for programming them. However, the unique behavior of quan…
Constant-time hybrid compilation of Shor's algorithm with quantum just-in-time compilation
David Ittah, Jackson Fraser, Josh Izaac +1
Continuous improvements in quantum computing hardware are exposing the need for simultaneous advances in software. Large-scale implementation of quantum algorithms requires rapid a…
Graph-based identification of qubit network (GidNET) for qubit reuse
Gideon Uchehara, Tor M. Aamodt, Olivia Di Matteo
Quantum computing introduces the challenge of optimizing quantum resources crucial for executing algorithms within the limited qubit availability of current quantum architectures.…
Rotation-inspired circuit cut optimization
Gideon Uchehara, Tor M. Aamodt, Olivia Di Matteo
Recent works have demonstrated that large quantum circuits can be cut and decomposed into smaller clusters of quantum circuits with fewer qubits that can be executed independently…
Fault tolerant resource estimation of quantum random-access memories
Olivia Di Matteo, Vlad Gheorghiu, Michele Mosca
Quantum random-access look-up of a string of classical bits is a necessary ingredient in several important quantum algorithms. In some cases, the cost of such quantum random-access…