activity
20062022
most citedQuantum Computer Systems for Scientific Discovery

247 citations · 1.6k across the 40 of their papers we have counts for

collaborators
Showing quant-phShow all

43 papers · 1 filter

quant-ph2022★ 8 cited

Practical implications of SFQ-based two-qubit gates

Mohammad Reza Jokar, Richard Rines, Frederic T. Chong

Scalability of today's superconducting quantum computers is limited due to the huge costs of generating/routing microwave control pulses per qubit from room temperature. One active…

quant-ph2022

DigiQ: A Scalable Digital Controller for Quantum Computers Using SFQ Logic

Mohammad Reza Jokar, Richard Rines, Ghasem Pasandi +5

The control of cryogenic qubits in today's superconducting quantum computer prototypes presents significant scalability challenges due to the massive costs of generating/routing th…

quant-ph2021

VAQEM: A Variational Approach to Quantum Error Mitigation

Gokul Subramanian Ravi, Kaitlin N. Smith, Pranav Gokhale +4

Variational Quantum Algorithms (VQAs) are relatively robust to noise, but errors are still a significant detriment to VQAs on near-term quantum machines. It is imperative to employ…

quant-ph2021

Exploiting Long-Distance Interactions and Tolerating Atom Loss in Neutral Atom Quantum Architectures

Jonathan M. Baker, Andrew Litteken, Casey Duckering +3

Quantum technologies currently struggle to scale beyond moderate scale prototypes and are unable to execute even reasonably sized programs due to prohibitive gate error rates or co…

quant-ph2021

Optimized fermionic SWAP networks with equivalent circuit averaging for QAOA

Akel Hashim, Rich Rines, Victory Omole +6

The fermionic SWAP network is a qubit routing sequence that can be used to efficiently execute the Quantum Approximate Optimization Algorithm (QAOA). Even with a minimally-connecte…

quant-ph2021

Adapting Quantum Approximation Optimization Algorithm (QAOA) for Unit Commitment

Samantha Koretsky, Pranav Gokhale, Jonathan M. Baker +8

In the present Noisy Intermediate-Scale Quantum (NISQ), hybrid algorithms that leverage classical resources to reduce quantum costs are particularly appealing. We formulate and app…

quant-ph2021★ 182 cited

QuantumNAS: Noise-Adaptive Search for Robust Quantum Circuits

Hanrui Wang, Yongshan Ding, Jiaqi Gu +5

Quantum noise is the key challenge in Noisy Intermediate-Scale Quantum (NISQ) computers. Previous work for mitigating noise has primarily focused on gate-level or pulse-level noise…

quant-ph2021★ 1 cited

Error Mitigation in Quantum Computers through Instruction Scheduling

Kaitlin N. Smith, Gokul Subramanian Ravi, Prakash Murali +4

Quantum systems have potential to demonstrate significant computational advantage, but current quantum devices suffer from the rapid accumulation of error that prevents the storage…

quant-ph2021★ 21 cited

Orchestrated Trios: Compiling for Efficient Communication in Quantum Programs with 3-Qubit Gates

Casey Duckering, Jonathan M. Baker, Andrew Litteken +1

Current quantum computers are especially error prone and require high levels of optimization to reduce operation counts and maximize the probability the compiled program will succe…

quant-ph2020★ 10 cited

QGo: Scalable Quantum Circuit Optimization Using Automated Synthesis

Xin-Chuan Wu, Marc Grau Davis, Frederic T. Chong +1

The current phase of quantum computing is in the Noisy Intermediate-Scale Quantum (NISQ) era. On NISQ devices, two-qubit gates such as CNOTs are much noisier than single-qubit gate…

quant-ph2020★ 3 cited

TILT: Achieving Higher Fidelity on a Trapped-Ion Linear-Tape Quantum Computing Architecture

Xin-Chuan Wu, Dripto M. Debroy, Yongshan Ding +4

Trapped-ion qubits are a leading technology for practical quantum computing. In this work, we present an architectural analysis of a linear-tape architecture for trapped ions. In o…

quant-ph2020★ 38 cited

Resource-Efficient Quantum Computing by Breaking Abstractions

Yunong Shi, Pranav Gokhale, Prakash Murali +11

Building a quantum computer that surpasses the computational power of its classical counterpart is a great engineering challenge. Quantum software optimizations can provide an acce…

quant-ph2020★ 19 cited

Adaptive Circuit Learning for Quantum Metrology

Ziqi Ma, Pranav Gokhale, Tian-Xing Zheng +5

Quantum sensing is an important application of emerging quantum technologies. We explore whether a hybrid system of quantum sensors and quantum circuits can surpass the classical l…

quant-ph2020★ 3 cited

Virtualized Logical Qubits: A 2.5D Architecture for Error-Corrected Quantum Computing

Casey Duckering, Jonathan M. Baker, David I. Schuster +1

Current, near-term quantum devices have shown great progress in recent years culminating with a demonstration of quantum supremacy. In the medium-term, however, quantum machines wi…

quant-ph2020★ 67 cited

Systematic Crosstalk Mitigation for Superconducting Qubits via Frequency-Aware Compilation

Yongshan Ding, Pranav Gokhale, Sophia Fuhui Lin +3

One of the key challenges in current Noisy Intermediate-Scale Quantum (NISQ) computers is to control a quantum system with high-fidelity quantum gates. There are many reasons a qua…

quant-ph2020

Quantum Fan-out: Circuit Optimizations and Technology Modeling

Pranav Gokhale, Samantha Koretsky, Shilin Huang +4

Instruction scheduling is a key compiler optimization in quantum computing, just as it is for classical computing. Current schedulers optimize for data parallelism by allowing simu…

quant-ph2020★ 71 cited

Time-Sliced Quantum Circuit Partitioning for Modular Architectures

Jonathan M. Baker, Casey Duckering, Alexander Hoover +1

Current quantum computer designs will not scale. To scale beyond small prototypes, quantum architectures will likely adopt a modular approach with clusters of tightly connected qua…

quant-ph2020

Optimized Quantum Compilation for Near-Term Algorithms with OpenPulse

Pranav Gokhale, Ali Javadi-Abhari, Nathan Earnest +2

Quantum computers are traditionally operated by programmers at the granularity of a gate-based instruction set. However, the actual device-level control of a quantum computer is pe…

quant-ph2020

Coreset Clustering on Small Quantum Computers

Teague Tomesh, Pranav Gokhale, Eric R. Anschuetz +1

Many quantum algorithms for machine learning require access to classical data in superposition. However, for many natural data sets and algorithms, the overhead required to load th…

quant-ph2020★ 2 cited

NISQ+: Boosting quantum computing power by approximating quantum error correction

Adam Holmes, Mohammad Reza Jokar, Ghasem Pasandi +3

Quantum computers are growing in size, and design decisions are being made now that attempt to squeeze more computation out of these machines. In this spirit, we design a method to…

quant-ph2020★ 33 cited

SQUARE: Strategic Quantum Ancilla Reuse for Modular Quantum Programs via Cost-Effective Uncomputation

Yongshan Ding, Xin-Chuan Wu, Adam Holmes +4

Compiling high-level quantum programs to machines that are size constrained (i.e. limited number of quantum bits) and time constrained (i.e. limited number of quantum operations) i…

quant-ph2020

Efficient Quantum Circuit Decompositions via Intermediate Qudits

Jonathan M. Baker, Casey Duckering, Frederic T. Chong

Many quantum algorithms make use of ancilla, additional qubits used to store temporary information during computation, to reduce the total execution time. Quantum computers will be…

quant-ph2020★ 18 cited

Term Grouping and Travelling Salesperson for Digital Quantum Simulation

Kaiwen Gui, Teague Tomesh, Pranav Gokhale +4

Digital simulation of quantum dynamics by evaluating the time evolution of a Hamiltonian is the initially proposed application of quantum computing. The large number of quantum gat…

quant-ph2019★ 247 cited

Quantum Computer Systems for Scientific Discovery

Yuri Alexeev, Dave Bacon, Kenneth R. Brown +21

The great promise of quantum computers comes with the dual challenges of building them and finding their useful applications. We argue that these two challenges should be considere…