activity
19982024
most citedSupplementary information for "Quantum supremacy using a programmable superconducting processor"

7.2k citations · 10.7k across the 66 of their papers we have counts for

collaborators
Showing 2020Show all

6 papers · 1 filter

quant-ph2020★ 33 cited

Quantum algorithms with local particle number conservation: noise effects and error correction

Michael Streif, Martin Leib, Filip Wudarski +2

Quantum circuits with local particle number conservation (LPNC) restrict the quantum computation to a subspace of the Hilbert space of the qubit register. In a noiseless or fault-t…

quant-ph2020★ 32 cited

Character randomized benchmarking for non-multiplicity-free groups with applications to subspace, leakage, and matchgate randomized benchmarking

Jahan Claes, Eleanor Rieffel, Zhihui Wang

Randomized benchmarking (RB) is a powerful method for determining the error rate of experimental quantum gates. Traditional RB, however, is restricted to gatesets, such as the Clif…

quant-ph2020★ 18 cited

Ferromagnetically shifting the power of pausing

Zoe Gonzalez Izquierdo, Shon Grabbe, Stuart Hadfield +3

We study the interplay between quantum annealing parameters in embedded problems, providing both deeper insights into the physics of these devices and pragmatic recommendations to…

cs.LG2020★ 16 cited

High-Dimensional Similarity Search with Quantum-Assisted Variational Autoencoder

Nicholas Gao, Max Wilson, Thomas Vandal +3

Recent progress in quantum algorithms and hardware indicates the potential importance of quantum computing in the near future. However, finding suitable application areas remains a…

quant-ph2020★ 4 cited

Augmented fidelities for single qubit gates

Filip Wudarski, Jeffrey Marshall, Andre Petukhov +1

An average gate fidelity is a standard performance metric to quantify deviation between an ideal unitary gate transformation and its realistic experimental implementation. The aver…

quant-ph2020★ 7 cited

Planning for Compilation of a Quantum Algorithm for Graph Coloring

Minh Do, Zhihui Wang, Bryan O'Gorman +3

The problem of compiling general quantum algorithms for implementation on near-term quantum processors has been introduced to the AI community. Previous work demonstrated that temp…