Related papers: Three Qubit Randomized Benchmarking
We characterize control of a qutrit implemented in the lowest three energy levels of a capacitively-shunted flux-biased superconducting circuit. Randomized benchmarking over the qutrit Clifford group yields an average fidelity of 98.89…
Benchmarking of noise that is induced during the implementation of quantum gates is the main concern for practical quantum computers. Several protocols have been proposed that empirically calculate various metrics that quantify the error…
In randomized benchmarking of quantum logical gates, partial twirling can be used for simpler implementation, better scaling, and higher accuracy and reliability. For instance, for two-qubit gates, single-qubit twirling is easier to realize…
We present improvements in both theoretical understanding and experimental implementation of the cross resonance (CR) gate that have led to shorter two-qubit gate times and interleaved randomized benchmarking fidelities exceeding 99%. The…
Quantum computers have the potential to outperform classical computers in a range of computational tasks, such as prime factorisation and unstructured searching. However, real-world quantum computers are subject to noise. Quantifying noise…
A precise measurement of dephasing over a range of timescales is critical for improving quantum gates beyond the error correction threshold. We present a metrological tool, based on randomized benchmarking, capable of greatly increasing the…
Recently, there has been an emergence of useful applications for noisy intermediate-scale quantum (NISQ) devices notably, though not exclusively, in the fields of quantum machine learning and variational quantum algorithms. In such…
Topological quantum computing promises intrinsic fault tolerance by encoding quantum information in non-Abelian anyons, where quantum gates are implemented via braiding. While braiding operations are robust against local perturbations, a…
Randomized benchmarking (RB) is the gold standard for experimentally evaluating the quality of quantum operations. The current framework for RB is centered on groups and their representations, but this can be problematic. For example,…
Randomized benchmarking is a widely used experimental technique to characterize the average error of quantum operations. Benchmarking procedures that scale to enable characterization of $n$-qubit circuits rely on efficient procedures for…
The presence of correlations in noisy quantum circuits will be an inevitable side effect as quantum devices continue to grow in size and depth. Randomized Benchmarking (RB) is arguably the simplest method to initially assess the overall…
As quantum processors grow, new performance benchmarks are required to capture the full quality of the devices at scale. While quantum volume is an excellent benchmark, it focuses on the highest quality subset of the device and so is unable…
As the size and complexity of a quantum computer increases, quantum bit (qubit) characterization and gate optimization become complex and time-consuming tasks. Current calibration techniques require complicated and verbose measurements to…
Quantum computation requires the precise control of the evolution of a quantum system, typically through application of discrete quantum logic gates on a set of qubits. Here, we use the cross-resonance interaction to implement a gate…
An important step in developing multi-qubit gates is to construct efficient benchmarking protocols for them. In our previous paper (arXiv: 2210.04330), we developed metrological protocols to measure the reduced Choi matrix i.e., the…
Hardware efficient transpilation of quantum circuits to a quantum devices native gateset is essential for the execution of quantum algorithms on noisy quantum computers. Typical quantum devices utilize a gateset with a single two-qubit…
Any technology requires precise benchmarking of its components, and the quantum technologies are no exception. Randomized benchmarking allows for the relatively resource economical estimation of the average gate fidelity of quantum gates…
We introduce binary randomized benchmarking (BiRB), a protocol that streamlines traditional RB by using circuits consisting almost entirely of i.i.d. layers of gates. BiRB reliably and efficiently extracts the average error rate of a…
The possibility to utilize different types of two-qubit gates on a single quantum computing platform adds flexibility in the decomposition of quantum algorithms. A larger hardware-native gate set may decrease the number of required gates,…
Randomized benchmarking is a powerful technique to efficiently estimate the performance and reliability of quantum gates, circuits and devices. Here we propose to perform randomized benchmarking in a coherent way, where superpositions of…