197 citations · 597 across the 11 of their papers we have counts for
12 papers
Repeated ancilla reuse for logical computation on a neutral atom quantum computer
J. A. Muniz, D. Crow, H. Kim +59
Quantum processors based on neutral atoms trapped in arrays of optical tweezers have appealing properties, including relatively easy qubit number scaling and the ability to enginee…
High-fidelity universal gates in the Yb ground state nuclear spin qubit
J. A. Muniz, M. Stone, D. T. Stack +50
Arrays of optically trapped neutral atoms are a promising architecture for the realization of quantum computers. In order to run increasingly complex algorithms, it is advantageous…
Fault-tolerant quantum computation with a neutral atom processor
Ben W. Reichardt, Adam Paetznick, David Aasen +69
Quantum computing experiments are transitioning from running on physical qubits to using encoded, logical qubits. Fault-tolerant computation can identify and correct errors, and ha…
Iterative assembly of Yb atom arrays with cavity-enhanced optical lattices
M. A. Norcia, H. Kim, W. B. Cairncross +47
Assembling and maintaining large arrays of individually addressable atoms is a key requirement for continued scaling of neutral-atom-based quantum computers and simulators. In this…
Graph Coloring with Quantum Annealing
Julia Kwok, Kristen Pudenz
We develop a heuristic graph coloring approximation algorithm that uses the D-Wave 2X as an independent set sampler and evaluate its performance against a fully classical implement…
Achieving a quantum smart workforce
Clarice D. Aiello, D. D. Awschalom, Hannes Bernien +29
Interest in building dedicated Quantum Information Science and Engineering (QISE) education programs has greatly expanded in recent years. These programs are inherently convergent,…
Quantum Annealing and the Satisfiability Problem
Kristen L. Pudenz, Gregory S. Tallant, Todd R. Belote +1
The utility of satisfiability (SAT) as an application focused hard computational problem is well established. We explore the potential of quantum annealing to enhance classical SAT…
Parameter Setting for Quantum Annealers
Kristen L. Pudenz
We develop and apply several strategies for setting physical parameters on quantum annealers for application problems that do not fit natively on the hardware graph. The strategies…
Quantum annealing correction for random Ising problems
Kristen L. Pudenz, Tameem Albash, Daniel A. Lidar
We demonstrate that the performance of a quantum annealer on hard random Ising optimization problems can be substantially improved using quantum annealing correction (QAC). Our err…
Error corrected quantum annealing with hundreds of qubits
Kristen L. Pudenz, Tameem Albash, Daniel A. Lidar
Quantum information processing offers dramatic speedups, yet is famously susceptible to decoherence, the process whereby quantum superpositions decay into mutually exclusive classi…
A Near-Term Quantum Computing Approach for Hard Computational Problems in Space Exploration
Vadim N. Smelyanskiy, Eleanor G. Rieffel, Sergey I. Knysh +5
In this article, we show how to map a sampling of the hardest artificial intelligence problems in space exploration onto equivalent Ising models that then can be attacked using qua…
Quantum adiabatic machine learning
Kristen L. Pudenz, Daniel A. Lidar
We develop an approach to machine learning and anomaly detection via quantum adiabatic evolution. In the training phase we identify an optimal set of weak classifiers, to form a si…