English
Related papers

Related papers: Randomized Benchmarking Beyond Groups

200 papers

Kernel method has been developed as one of the standard approaches for nonlinear learning, which however, does not scale to large data set due to its quadratic complexity in the number of samples. A number of kernel approximation methods…

Machine Learning · Computer Science 2018-09-20 Lingfei Wu , Ian E. H. Yen , Jie Chen , Rui Yan

Quantum dots (QDs) defined with electrostatic gates are a leading platform for a scalable quantum computing implementation. However, with increasing numbers of qubits, the complexity of the control parameter space also grows. Traditional…

We present a method for optimizing quantum control in experimental systems, using a subset of randomized benchmarking measurements to rapidly infer error. This is demonstrated to improve single- and two-qubit gates, minimize gate…

As quantum devices progress towards a quantum advantage regime, they become harder to benchmark. A particularly relevant challenge is to assess the quality of the whole computation, beyond testing the performance of each single operation.…

Quantum Physics · Physics 2026-04-03 Flavio Baccari , Pavel Kos , Georgios Styliaris

As quantum computers grow in size and scope, a question of great importance is how best to benchmark performance. Here we define a set of characteristics that any benchmark should follow -- randomized, well-defined, holistic, device…

Quantum Physics · Physics 2023-03-06 Mirko Amico , Helena Zhang , Petar Jurcevic , Lev S. Bishop , Paul Nation , Andrew Wack , David C. McKay

The characterization of errors in a quantum system is a fundamental step for two important goals. First, learning about specific sources of error is essential for optimizing experimental design and error correction methods. Second,…

Quantum Physics · Physics 2020-08-24 Hillary Dawkins , Joel Wallman , Joseph Emerson

Variational quantum algorithms are considered to be appealing applications of near-term quantum computers. However, it has been unclear whether they can outperform classical algorithms or not. To reveal their limitations, we must seek a…

Quantum Physics · Physics 2020-12-15 Kosuke Mitarai , Yasunari Suzuki , Wataru Mizukami , Yuya O. Nakagawa , Keisuke Fujii

We present a protocol for Interleaved Randomized Benchmarking of arbitrary quantum gates using Monte Carlo sampling of quantum states. It is generally applicable, including non-Clifford gates while preserving key advantages of Randomized…

Quantum Physics · Physics 2017-07-11 Tobias Chasseur , Daniel M. Reich , Christiane P. Koch , Frank K. Wilhelm

Linear cross-entropy benchmarking (LXEB) with random quantum circuits is a standard method for evaluating quantum computers. However, LXEB requires classically simulating the ideal output distribution of a given quantum circuit with high…

Quantum Physics · Physics 2025-07-24 Takumi Kaneda , Keisuke Fujii , Hiroshi Ueda

An important step in building a quantum computer is calibrating experimentally implemented quantum gates to produce operations that are close to ideal unitaries. The calibration step involves estimating the systematic errors in gates and…

Quantum Physics · Physics 2021-10-22 Shelby Kimmel , Guang Hao Low , Theodore J. Yoder

Quantum error mitigation schemes (QEM) have greatly enhanced the performance of quantum computers, mostly by reducing errors caused by interactions with the environment. Nevertheless, the presence of coherence errors, typically arising from…

Quantum Physics · Physics 2026-03-10 Tanmoy Pandit , Raam Uzdin

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…

Quantum Physics · Physics 2023-03-01 Conrad Strydom , Mark Tame

We describe a simple randomized benchmarking protocol for quantum information processors and obtain a sequence of models for the observable fidelity decay as a function of a perturbative expansion of the errors. We are able to prove that…

Quantum Physics · Physics 2011-06-14 Easwar Magesan , J. M. Gambetta , Joseph Emerson

Practical success of quantum learning models hinges on having a suitable structure for the parameterized quantum circuit. Such structure is defined both by the types of gates employed and by the correlations of their parameters. While much…

Quantum Physics · Physics 2024-02-29 Frederic Sauvage , Martin Larocca , Patrick J. Coles , M. Cerezo

The rapid progress in the development of quantum devices is in large part due to the availability of a wide range of characterization techniques allowing to probe, test and adjust them. Nevertheless, these methods often make use of…

Quantum Physics · Physics 2022-12-07 Pedro Figueroa-Romero , Kavan Modi , Min-Hsiu Hsieh

Grover's quantum algorithm can find a marked item from an unstructured database faster than any classical algorithm, and hence it has been used for several applications such as cryptanalysis and optimization. When there exist multiple…

Quantum Physics · Physics 2025-07-02 Kota Tani , Shunji Tsuchiya , Seiichiro Tani , Yuki Takeuchi

Randomized protocols are procedures that incorporate probabilistic choices during their execution and they play a central role in quantum algorithms, spanning Hamiltonian simulation, noise mitigation, and measurement tasks. In practical…

Quantum Physics · Physics 2026-03-17 Davide Cugini , Touheed Anwar Atif , Yigit Subasi

Randomized benchmarking techniques have been an essential tool for assessing the performance of contemporary quantum devices. The goal of this tutorial is to provide a pedagogical, self-contained, introduction to randomized benchmarking.…

Quantum Physics · Physics 2025-07-23 Ana Silva , Eliska Greplova

As quantum devices scale up, many-body quantum gates and algorithms begin to surpass what is possible to simulate classically. Validation methods which rely on such classical simulation, such as process tomography and randomized…

A new class of protocols called mirror benchmarking was recently proposed to measure the system-level performance of quantum computers. These protocols involve circuits with random sequences of gates followed by mirroring, that is,…

‹ Prev 1 3 4 5 6 7 10 Next ›