PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
May 20, 2026Quantum Information Processing0 citationsOpen Access

A verification scheme for universal quantum computers

View Full Paper
ARAnirudh ReddyUniversity of KwaZulu-NatalATAlain Giresse TeneUniversity of KwaZulu-NatalTKThomas KonradUniversity of KwaZulu-Natal

Key Points

  • The aim is to establish a reliable verification approach for assessing the functionality and noise levels of universal quantum computers.
  • Developed a verification scheme based on the standard deviation of the meta-probability distribution for single qubit outputs.
  • Utilized output statistics from the quantum computer without classical computational assistance.
  • Validated the method on a real quantum computer (IBM-Cairo) with up to 40 qubits.
  • Successfully measured the number of functioning qubits and quantified noise during quantum circuit execution.
  • Showed potential for demonstrating quantum supremacy as faster quantum processors are developed.

Abstract

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).

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Reddy et al. (2026) studied this question.

synapsesocial.com/papers/6a0d4f4cf03e14405aa9a834https://doi.org/10.1007/s11128-026-05193-2
Ask AI
Helpful
Bookmark
Share
View Full Paper