102 citations · 287 across the 15 of their papers we have counts for
16 papers · 1 filter
Communication Trade Offs in Intermediate Qudit Circuits
Andrew Litteken, Jonathan M. Baker, Frederic T. Chong
Quantum computing promises speedup of classical algorithms in the long term. Current hardware is unable to support this goal and programs must be efficiently compiled to use of the…
Reducing Runtime Overhead via Use-Based Migration in Neutral Atom Quantum Architectures
Andrew Litteken, Jonathan M. Baker, Frederic T. Chong
Neutral atoms are a promising choice for scalable quantum computing architectures. Features such as long distance interactions and native multiqubit gates offer reductions in commu…
Fast Fingerprinting of Cloud-based NISQ Quantum Computers
Kaitlin N. Smith, Joshua Viszlai, Lennart Maximilian Seifert +3
Cloud-based quantum computers have become a reality with a number of companies allowing for cloud-based access to their machines with tens to more than 100 qubits. With easy access…
Scaling Superconducting Quantum Computers with Chiplet Architectures
Kaitlin N. Smith, Gokul Subramanian Ravi, Jonathan M. Baker +1
Fixed-frequency transmon quantum computers (QCs) have advanced in coherence times, addressability, and gate fidelities. Unfortunately, these devices are restricted by the number of…
Boosting Quantum Fidelity with an Ordered Diverse Ensemble of Clifford Canary Circuits
Gokul Subramanian Ravi, Jonathan M. Baker, Kaitlin N. Smith +3
On today's noisy imperfect quantum devices, execution fidelity tends to collapse dramatically for most applications beyond a handful of qubits. It is therefore imperative to employ…
Let Each Quantum Bit Choose Its Basis Gates
Sophia Fuhui Lin, Sara Sussman, Casey Duckering +5
Near-term quantum computers are primarily limited by errors in quantum operations (or gates) between two quantum bits (or qubits). A physical machine typically provides a set of ba…