Ethan Smith
Lawrence Berkeley National Laboratory
5 Papers
16 Citations
Ethan Smith is an academic researcher from Lawrence Berkeley National Laboratory. The author has contributed to research in topics: Computer science & Quantum computer. The author has an hindex of 3, co-authored 5 publications.
Chat about Author
Papers
Randomized Compiling for Scalable Quantum Computing on a Noisy Superconducting Quantum Processor
Akel Hashim,Akel Hashim,Ravi Naik,Ravi Naik,Alexis Morvan,Alexis Morvan,Jean-Loup Ville,Bradley Mitchell,Bradley Mitchell,John Mark Kreikebaum,John Mark Kreikebaum,Marc Davis,Ethan Smith,Costin Iancu,Kevin O'Brien,Ian Hincks,Joel J. Wallman,Joseph Emerson,Irfan Siddiqi,Irfan Siddiqi +19 more
TL;DR: Randomized Comparing as discussed by the authors converts coherent errors into stochastic noise, reducing unpredictable quantum errors and enabling accurate predictions of algorithmic performance from error rates measured via cycle benchmarking.
89
•Posted Content
Randomized compiling for scalable quantum computing on a noisy superconducting quantum processor
Akel Hashim,Akel Hashim,Ravi Naik,Ravi Naik,Alexis Morvan,Alexis Morvan,Jean-Loup Ville,Bradley Mitchell,Bradley Mitchell,John Mark Kreikebaum,John Mark Kreikebaum,Marc Davis,Ethan Smith,Costin Iancu,Kevin O'Brien,Ian Hincks,Joel J. Wallman,Joseph Emerson,Irfan Siddiqi,Irfan Siddiqi +19 more
TL;DR: This work demonstrates significant performance gains under randomized compiling for the four-qubit quantum Fourier transform algorithm and for random circuits of variable depth on a superconducting quantum processor, and accurately predicts algorithm performance using experimentally-measured error rates.
75
•Posted Content
Constant-Depth Circuits for Dynamic Simulations of Materials on Quantum Computers
TL;DR: In this article, the authors present a method for generating circuits that are constant in depth with increasing simulation time for a subset of one-dimensional materials Hamiltonians, thereby enabling simulations out to arbitrarily long times.
31
•Posted Content
Heuristics for Quantum Compiling with a Continuous Gate Set.
TL;DR: This work presents an algorithm for compiling arbitrary unitaries into a sequence of gates native to a quantum processor, which attempts to minimize their count, while accounting for connectivity, and produces solutions well within the best upper bounds published in literature.
•Journal Article
Leveraging Randomized Compiling for the QITE Algorithm
Jean-Loup Ville,Alexis Morvan,Akel Hashim,Ravi Naik,Brad Mitchell,John Mark Kreikebaum,O'brien Kevin P,Marc Davis,Ethan Smith,Ed Younis,Costin Iancu,Ian Hincks,Joel J. Wallman,Joseph Emerson,David I. Santiago,Irfan Siddiqi +15 more
TL;DR: This research presents a new generation of quantum nanoelectronics components that can be integrated into conventional semiconductor substrates and shows the versatility of the material and its application in quantum computing.