Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2112.07567 · Frontiers in Physics

Testing the accuracy of qubit rotations on a public quantum computer

Tomasz Białecki, Tomasz Rybotycki, J. Tworzydło, Adam Bednorz

Published Mar 5, 2024• 7 citations
arXivHTMLPDF

Abstract

We analyze the results of the test of π /2 qubit rotations on a public quantum computer provided by IBM. We measure a single qubit rotated by π /2 about a random axis, and we accumulate vast statistics of the results. The test performed on different devices shows systematic deviations from the theoretical predictions, which appear at level 10 –3 . Some of the differences, beyond 5 standard deviations, cannot be explained by simple corrections due to nonlinearities of pulse generations. The magnitude of the deviation is comparable with the randomized benchmarking of the gate, but we additionally observe a pronounced parametric dependence. We discuss other possible reasons for the deviations, including states beyond the single-qubit space. The deviations have a similar structure for various devices used at different times, so they can also serve as a diagnostic tool to eliminate imperfect gate implementations and a faithful description of the involved physical systems.

DOI
10.3389/fphy.2024.1360080

Related papers

Benchmarking of quantum processors with random circuits

James R. Wootton

Quantum processors with sizes in the 10-100 qubit range are now increasingly common. However, with increased size comes increased complexity for benchmarking. The effectiveness of a given device may vary greatly between different tasks, and will not always be easy to predict from single and two qubit gate fidelities. For this reason, it is important to assess processor quality for a range of important tasks. In this work we propose and implement tests based on random quantum circuits. These are used to evaluate multiple different superconducting qubit devices, with sizes from 5 to 19 qubits, from two hardware manufacturers: IBM Research and Rigetti. The data is analyzed to give a quantitive description of how the devices perform. We also describe how it can be used for a qualititive description accessible to the layperson, by being played as a game.

arXiv:1806.02736•Jun 7, 2018•22 citations

A verification scheme for universal quantum computers

Anirudh Reddy, Alain Giresse Tene, Thomas Konrad

Abstract We present a new verification scheme for universal quantum computers that yields the number of working qubits and measures the noise expected when executing quantum circuits. It is based on detecting the standard deviation of the meta-probability distribution of output values for a single qubit probed by random quantum gates involving all the qubits of the quantum computer. This result is generated directly from the output statistics of the quantum computer and thus does not require any assistance from classical computers. With current technology quantum computers with up to 40 qubits could be tested employing this method, but in future, given faster quantum processors, it might be used to demonstrate quantum supremacy. Our results have been successfully demonstrated on a real quantum computer (IBM-Cairo).

Quantum Information Processing•May 18, 2026•0 citations

Scalable Benchmarks for Gate-Based Quantum Computers

Arjan Cornelissen, Johannes Bausch, András Gilyén

In the near-term "NISQ"-era of noisy, intermediate-scale, quantum hardware and beyond, reliably determining the quality of quantum devices becomes increasingly important: users need to be able to compare them with one another, and make an estimate whether they are capable of performing a given task ahead of time. In this work, we develop and release an advanced quantum benchmarking framework in order to help assess the state of the art of current quantum devices. Our testing framework measures the performance of universal quantum devices in a hardware-agnostic way, with metrics that are aimed to facilitate an intuitive understanding of which device is likely to outperform others on a given task. This is achieved through six structured tests that allow for an immediate, visual assessment of how devices compare. Each test is designed with scalability in mind, making this framework not only suitable for testing the performance of present-day quantum devices, but also of those released in the foreseeable future. The series of tests are motivated by real-life scenarios, and therefore emphasise the interplay between various relevant characteristics of quantum devices, such as qubit count, connectivity, and gate and measurement fidelity. We present the benchmark results of twenty-one different quantum devices from IBM, Rigetti and IonQ.

arXiv:2104.10698•Apr 21, 2021•41 citations

Testing the Efficiency of Digital Simulation of Quantum Walks on IBM’s Q platform - towards quantum experimental algorithms

Luis Ángel Sedas

This thesis presents several quantum circuit implementations of discrete and continuous quantum walks in cycle graphs. Quantum walks have become an important tool for developing quantum algorithms, that is why this work is a contribution to the area of quantum computation, specially for scientist who want to test their developed algorithms, in a real quantum device as the IBM-Q Experience platform. We give a complete suite of quantum gates that are needed to simulate quantum walks and quantum walk-based algorithms. Since some of these quantum gates are not elementary, we show how to decompose them into fundamental quantum gates available at Qiskit, an open-source quantum computing software development framework created by IBM. This is an important contribution towards the development of a professional platform for simulating and testing quantum algorithms. We found that the decomposition of unitary gates, related to quantum walks, into elementary gates is not very well documented in the literature. We studied the efficiency of both, the number of qubits and logic gates needed for each circuit, and the correctness of the results of each experiment by comparing the theoretical expected output state with the output generated by quantum simulators. Implementations of both discrete and continuous quantum walks in quantum circuits rely heavily on controlled gates, that when decomposed into fundamental gates add a high number of quantum gates and depth. Experiments were performed on a real quantum device, but results showed that the quantum computer is not good enough when executing these quantum circuits, due to the depth of the circuits and the high amount of CNOT gates required. We tested different implementations and optimization methods for the simplification of the quantum circuits, were we find that resources grow linearly w.r.t the number of qubits, and the minimum amount of gates required for the discrete case in C8 was 144 quantum gates with a depth of 111, which is the reason of the error between the simulations and the implementations in the quantum device.

•Mar 14, 2020•0 citations

Precise certification of a qubit space

Tomasz Białecki, Tomasz Rybotycki, Josep Amengual i Batle +2 more

Abstract We demonstrate an implementation of the precise test of dimension on the qubit, using the public IBM quantum computer, using the determinant dimension witness. The accuracy is below 10 −3 comparing to maximal possible value of the witness in higher dimension. The test involving minimal independent sets of preparation and measurement operations (gates) is applied both for specific configurations and parametric ones. The test is robust against nonidealities such as incoherent leakage and erroneous gate execution. Two of the IBM devices failed the test by more than 5 standard deviations, which has no simple explanation.

arXiv:2301.03296•EPJ Quantum Technology•Mar 19, 2024•4 citations

Experimental Evaluation of NISQ Quantum Computers: Error Measurement, Characterization, and Implications

Tirthak Patel, Abhay Potharaju, Baolin Li +2 more

Noisy Intermediate-Scale Quantum (NISQ) computers are being increasingly used for executing early-stage quantum programs to establish the practical realizability of existing quantum algorithms. These quantum programs have uses cases in the realm of high-performance computing ranging from molecular chemistry and physics simulations to addressing NP-complete optimization problems. However, NISQ devices are prone to multiple types of errors, which affect the fidelity and reproducibility of the program execution. As the technology is still primitive, our understanding of these quantum machines and their error characteristics is limited. To bridge that understanding gap, this is the first work to provide a systematic and rich experimental evaluation of IBM Quantum Experience (QX) quantum computers of different scales and topologies. Our experimental evaluation uncovers multiple important and interesting aspects of benchmarking and evaluating quantum program on NISQ machines. We have open-sourced our experimental framework and dataset to help accelerate the evaluation of quantum computing systems.

International Conference for High Performance Computing, Networking, Storage and Analysis (SC)•Nov 1, 2020•37 citations
We analyze the results of the test of π /2 qubit rotations on a public quantum computer provided by IBM. We measure a single qubit rotated by π /2 about a random axis, and we accumulate vast statistics of the results. The test performed on different devices shows systematic deviations from the theoretical predictions, which appear at level 10 –3 . Some of the differences, beyond 5 standard deviations, cannot be explained by simple corrections due to nonlinearities of pulse generations. The magnitude of the deviation is comparable with the randomized benchmarking of the gate, but we additionally observe a pronounced parametric dependence. We discuss other possible reasons for the deviations, including states beyond the single-qubit space. The deviations have a similar structure for various devices used at different times, so they can also serve as a diagnostic tool to eliminate imperfect gate implementations and a faithful description of the involved physical systems.
Quantum processors with sizes in the 10-100 qubit range are now increasingly common. However, with increased size comes increased complexity for benchmarking. The effectiveness of a given device may vary greatly between different tasks, and will not always be easy to predict from single and two qubit gate fidelities. For this reason, it is important to assess processor quality for a range of important tasks. In this work we propose and implement tests based on random quantum circuits. These are used to evaluate multiple different superconducting qubit devices, with sizes from 5 to 19 qubits, from two hardware manufacturers: IBM Research and Rigetti. The data is analyzed to give a quantitive description of how the devices perform. We also describe how it can be used for a qualititive description accessible to the layperson, by being played as a game.
Abstract We present a new verification scheme for universal quantum computers that yields the number of working qubits and measures the noise expected when executing quantum circuits. It is based on detecting the standard deviation of the meta-probability distribution of output values for a single qubit probed by random quantum gates involving all the qubits of the quantum computer. This result is generated directly from the output statistics of the quantum computer and thus does not require any assistance from classical computers. With current technology quantum computers with up to 40 qubits could be tested employing this method, but in future, given faster quantum processors, it might be used to demonstrate quantum supremacy. Our results have been successfully demonstrated on a real quantum computer (IBM-Cairo).
In the near-term "NISQ"-era of noisy, intermediate-scale, quantum hardware and beyond, reliably determining the quality of quantum devices becomes increasingly important: users need to be able to compare them with one another, and make an estimate whether they are capable of performing a given task ahead of time. In this work, we develop and release an advanced quantum benchmarking framework in order to help assess the state of the art of current quantum devices. Our testing framework measures the performance of universal quantum devices in a hardware-agnostic way, with metrics that are aimed to facilitate an intuitive understanding of which device is likely to outperform others on a given task. This is achieved through six structured tests that allow for an immediate, visual assessment of how devices compare. Each test is designed with scalability in mind, making this framework not only suitable for testing the performance of present-day quantum devices, but also of those released in the foreseeable future. The series of tests are motivated by real-life scenarios, and therefore emphasise the interplay between various relevant characteristics of quantum devices, such as qubit count, connectivity, and gate and measurement fidelity. We present the benchmark results of twenty-one different quantum devices from IBM, Rigetti and IonQ.
This thesis presents several quantum circuit implementations of discrete and continuous quantum walks in cycle graphs. Quantum walks have become an important tool for developing quantum algorithms, that is why this work is a contribution to the area of quantum computation, specially for scientist who want to test their developed algorithms, in a real quantum device as the IBM-Q Experience platform. We give a complete suite of quantum gates that are needed to simulate quantum walks and quantum walk-based algorithms. Since some of these quantum gates are not elementary, we show how to decompose them into fundamental quantum gates available at Qiskit, an open-source quantum computing software development framework created by IBM. This is an important contribution towards the development of a professional platform for simulating and testing quantum algorithms. We found that the decomposition of unitary gates, related to quantum walks, into elementary gates is not very well documented in the literature. We studied the efficiency of both, the number of qubits and logic gates needed for each circuit, and the correctness of the results of each experiment by comparing the theoretical expected output state with the output generated by quantum simulators. Implementations of both discrete and continuous quantum walks in quantum circuits rely heavily on controlled gates, that when decomposed into fundamental gates add a high number of quantum gates and depth. Experiments were performed on a real quantum device, but results showed that the quantum computer is not good enough when executing these quantum circuits, due to the depth of the circuits and the high amount of CNOT gates required. We tested different implementations and optimization methods for the simplification of the quantum circuits, were we find that resources grow linearly w.r.t the number of qubits, and the minimum amount of gates required for the discrete case in C8 was 144 quantum gates with a depth of 111, which is the reason of the error between the simulations and the implementations in the quantum device.
Abstract We demonstrate an implementation of the precise test of dimension on the qubit, using the public IBM quantum computer, using the determinant dimension witness. The accuracy is below 10 −3 comparing to maximal possible value of the witness in higher dimension. The test involving minimal independent sets of preparation and measurement operations (gates) is applied both for specific configurations and parametric ones. The test is robust against nonidealities such as incoherent leakage and erroneous gate execution. Two of the IBM devices failed the test by more than 5 standard deviations, which has no simple explanation.
Noisy Intermediate-Scale Quantum (NISQ) computers are being increasingly used for executing early-stage quantum programs to establish the practical realizability of existing quantum algorithms. These quantum programs have uses cases in the realm of high-performance computing ranging from molecular chemistry and physics simulations to addressing NP-complete optimization problems. However, NISQ devices are prone to multiple types of errors, which affect the fidelity and reproducibility of the program execution. As the technology is still primitive, our understanding of these quantum machines and their error characteristics is limited. To bridge that understanding gap, this is the first work to provide a systematic and rich experimental evaluation of IBM Quantum Experience (QX) quantum computers of different scales and topologies. Our experimental evaluation uncovers multiple important and interesting aspects of benchmarking and evaluating quantum program on NISQ machines. We have open-sourced our experimental framework and dataset to help accelerate the evaluation of quantum computing systems.