Kevin Christopher Young

Kevin Christopher Young

Auto-generated profile, based on publicly available information

Kevin Christopher Young

Sandia National Laboratories (SNL-CA), Livermore, CA (United States)

Research Focus & Metrics

Academic Career Length

36Years (1991-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 January 2022 in Nature
Verified
Journal Article
Closed access
PDF file
MMMateusz T. Mądzik
Mateusz T. Mądzik
SASerwan Asaad
Serwan Asaad
AYAkram Youssry
Akram Youssry
BJBenjamin Joecker
Benjamin Joecker
KRKenneth M. Rudinger
Kenneth M. Rudinger
AMAndrea Morello
Andrea Morello

20 December 2021 in Nature Physics
Verified
Journal Article
Closed access
PDF file
TPTimothy Proctor
Timothy Proctor
KRKenneth Rudinger
Kenneth Rudinger
KYKevin Young
Kevin Young
ENErik Nielsen
Erik Nielsen
RBRobin Blume-Kohout
Robin Blume-Kohout

15 November 2020 in Quantum
Verified
Journal Article
Open access
PDF file
RBRobin Blume-Kohout
Robin Blume-Kohout
KYKevin C. Young
Kevin C. Young
We propose a very large family of benchmarks for probing the performance of quantum computers. We call them {volumetric benchmarks} (VBs) because they generalize IBM's benchmark for measuring quantum volume \cite{Cross18}. The quantum volume benchmark defines a family of {square} circuits whose depth d and width w are the same. A volumetric benchmark defines a family of {rectangular} quantum circuits, for which d and w are uncoupled to allow the study of time/space performance trade-offs. Each VB defines a mapping from circuit shapes -- (w,d) pairs -- to test suites C(w,d). A test suite is an ensemble of test circuits that share a common structure. The test suite C for a given circuit shape may be a single circuit C, a specific list of circuits {C1…CN} that must all be run, or a large set of possible circuits equipped with a distribution Pr(C). The circuits in a given VB share a structure, which is limited only by designers' creativity. We list some known benchmarks, and other circuit families, that fit into the VB framework: several families of random circuits, periodic circuits, and algorithm-inspired circuits. The last ingredient defining a benchmark is a success criterion that defines when a processor is judged to have ``passed'' a given test circuit. We discuss several options. Benchmark data can be analyzed in many ways to extract many properties, but we propose a simple, universal graphical summary of results that illustrates the Pareto frontier of the d vs w trade-off for the processor being benchmarked.

7 July 2020 in Quantum Science and Technology
Verified
Journal Article
Closed access
ENErik Nielsen
Erik Nielsen
KRKenneth Rudinger
Kenneth Rudinger
TPTimothy Proctor
Timothy Proctor
ARAntonio Russo
Antonio Russo
KYKevin Young
Kevin Young
RBRobin Blume-Kohout
Robin Blume-Kohout
PyGSTi is a Python software package for assessing and characterizing the performance of quantum computing processors. It can be used as a standalone application, or as a library, to perform a wide variety of quantum characterization, verification, and validation (QCVV) protocols on as-built quantum processors. We outline pyGSTi’s structure, and what it can do, using multiple examples. We cover its main characterization protocols with end-to-end implementations. These include gate set tomography, randomized benchmarking on one or many qubits, and several specialized techniques. We also discuss and demonstrate how power users can customize pyGSTi and leverage its components to create specialized QCVV protocols and solve user-specific problems.

25 September 2014 in Physical Review B
Verified
Journal Article
Open access
PDF file
WWWayne M. Witzel
Wayne M. Witzel
KYKevin Young
Kevin Young
SSSankar Das Sarma
Sankar Das Sarma
We present a cluster expansion method for approximating quantum spin-bath dynamics in terms of a classical Gaussian stochastic process. The cluster expansion produces the two-point correlation function of the approximate classical bath, permitting rapid evaluation of noise-mitigating quantum control strategies without resorting to computationally intensive dynamical decoupling models. Our approximation is valid for the wide class of models possessing negligible back-action and nearly-Gaussian noise. We study several instances of the central spin decoherence problem in which the central spin and randomly-located bath spins are alike and dipolarly coupled. For various pulse sequences, we compare the coherence echo decay computed explicitly quantum mechanically versus those computed using our approximate classical model, and obtain agreement in most, but not all, cases. We demonstrate the utility of these classical noise models by efficiently searching for the 4-pulse sequences that maximally mitigate decoherence in each of these cases, a computationally expensive task in the explicit quantum model.

1 September 2021 in New Journal of Physics
Verified
Journal Article
Open access
PDF file
ENErik Nielsen
Erik Nielsen
KRKenneth Rudinger
Kenneth Rudinger
TPTimothy Proctor
Timothy Proctor
KYKevin Young
Kevin Young
RBRobin Blume-Kohout
Robin Blume-Kohout
We present a simple and powerful technique for finding a good error model for a quantum processor. The technique iteratively tests a nested sequence of models against data obtained from the processor, and keeps track of the best-fit model and its wildcard error (a metric of the amount of unmodeled error) at each step. Each best-fit model, along with a quantification of its unmodeled error, constitutes a characterization of the processor. We explain how quantum processor models can be compared with experimental data and to each other. We demonstrate the technique by using it to characterize a simulated noisy two-qubit processor.