13 citations · 16 across the 8 of their papers we have counts for
10 papers · 1 filter
ChainForge: Characterizing Embedding as the Bottleneck in Quantum Annealer Workloads
Kanishka Jayathilake, Cordelia Brumley, Tanner Smith +1
Quantum Annealers (QAs) are among the first commercially scaled quantum computing systems designed for large-scale optimization. Unlike digital systems that execute sequences of co…
Stabilizer Code-Generic Universal Fault-Tolerant Quantum Computation
Nicholas J. C. Papadopoulos, Ramin Ayanzadeh
Fault-tolerant quantum computation allows quantum computations to be carried out while resisting unwanted noise. Several error-correcting codes have been developed to achieve this…
On the Potential of Quantum Computing in Classical Program Analysis
Yicheng Guang, Pietro Zanotta, Kai Zhou +2
Classical program analysis techniques, such as abstract interpretation and symbolic execution, are essential for ensuring software correctness, optimizing performance, and enabling…
Promatch: Extending the Reach of Real-Time Quantum Error Correction with Adaptive Predecoding
Narges Alavisamani, Suhas Vittal, Ramin Ayanzadeh +2
Fault-tolerant quantum computing relies on Quantum Error Correction, which encodes logical qubits into data and parity qubits. Error decoding is the process of translating the meas…
Skipper: Improving the Reach and Fidelity of Quantum Annealers by Skipping Long Chains
Ramin Ayanzadeh, Moinuddin Qureshi
Quantum Annealers (QAs) operate as single-instruction machines, lacking a SWAP operation to overcome limited qubit connectivity. Consequently, multiple physical qubits are chained…
Enigma: Application-Layer Privacy for Quantum Optimization on Untrusted Computers
Ramin Ayanzadeh, Ahmad Mousavi, Amirhossein Basareh +2
The Early Fault-Tolerant (EFT) era is emerging, where modest Quantum Error Correction (QEC) can enable quantum utility before full-scale fault tolerance. Quantum optimization is a…