Learning quantum systems
The future development of quantum technologies relies on creating and manipulating
quantum systems of increasing complexity, with key applications in computation, simulation …
quantum systems of increasing complexity, with key applications in computation, simulation …
Quantum computing circuits and devices
TS Humble, H Thapliyal, E Munoz-Coreas… - IEEE Design & …, 2019 - ieeexplore.ieee.org
Editor's note: As an emerging technology, quantum computing brings unique promises in
creating a fundamentally different paradigm of information processing. This article reviews …
creating a fundamentally different paradigm of information processing. This article reviews …
Silicon qubit fidelities approaching incoherent noise limits via pulse engineering
Spin qubits created from gate-defined silicon metal–oxide–semiconductor quantum dots are
a promising architecture for quantum computation. The high single qubit fidelities possible in …
a promising architecture for quantum computation. The high single qubit fidelities possible in …
Efficient estimation of Pauli channels
ST Flammia, JJ Wallman - ACM Transactions on Quantum Computing, 2020 - dl.acm.org
Pauli channels are ubiquitous in quantum information, both as a dominant noise source in
many computing architectures and as a practical model for analyzing error correction and …
many computing architectures and as a practical model for analyzing error correction and …
Randomized benchmarking with confidence
JJ Wallman, ST Flammia - New Journal of Physics, 2014 - iopscience.iop.org
Randomized benchmarking is a promising tool for characterizing the noise in experimental
implementations of quantum systems. In this paper, we prove that the estimates produced by …
implementations of quantum systems. In this paper, we prove that the estimates produced by …
What randomized benchmarking actually measures
Randomized benchmarking (RB) is widely used to measure an error rate of a set of quantum
gates, by performing random circuits that would do nothing if the gates were perfect. In the …
gates, by performing random circuits that would do nothing if the gates were perfect. In the …
[HTML][HTML] Randomized benchmarking with gate-dependent noise
JJ Wallman - Quantum, 2018 - quantum-journal.org
We analyze randomized benchmarking for arbitrary gate-dependent noise and prove that
the exact impact of gate-dependent noise can be described by a single perturbation term …
the exact impact of gate-dependent noise can be described by a single perturbation term …
Comparing experiments to the fault-tolerance threshold
Achieving error rates that meet or exceed the fault-tolerance threshold is a central goal for
quantum computing experiments, and measuring these error rates using randomized …
quantum computing experiments, and measuring these error rates using randomized …
A new class of efficient randomized benchmarking protocols
Randomized benchmarking is a technique for estimating the average fidelity of a set of
quantum gates. However, if this gateset is not the multi-qubit Clifford group, robustly …
quantum gates. However, if this gateset is not the multi-qubit Clifford group, robustly …
Characterizing universal gate sets via dihedral benchmarking
We describe a practical experimental protocol for robustly characterizing the error rates of
non-Clifford gates associated with dihedral groups, including small single-qubit rotations …
non-Clifford gates associated with dihedral groups, including small single-qubit rotations …