How "Quantum" is your Quantum Computer? Macrorealism-based Benchmarking via Mid-Circuit Parity Measurements

• URL: http://arxiv.org/abs/2511.15881v1
• Date: Wed, 19 Nov 2025 21:15:54 GMT
• Title: How "Quantum" is your Quantum Computer? Macrorealism-based Benchmarking via Mid-Circuit Parity Measurements
• Authors: Ben Zindorf, Lorenzo Braccini, Debarshi Das, Sougato Bose,
• Abstract summary: Violation of Macrorealism (MR) is detected on a IBM QC up to $N = 38$ qubits, increasing $N$ by one order of magnitude over best known results of MR.<n>Two QCs are benchmarked using the proposed NDC metric, showing a three-fold improvement in their quantumness from one generation to the next.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: To perform meaningful computations, Quantum Computers (QCs) must scale to macroscopic levels - i.e., to a large number of qubits - an objective pursued by most quantum companies. How to efficiently test their quantumness at these scales? We show that the violation of Macrorealism (MR), being the fact that classical systems possess definite properties that can be measured without disturbances, provide a fruitful avenue to this aim. The No Disturbance Condition (NDC) - the equality used here to test MR - can be violated by two consecutive parity measurements on $N$ qubits and found to be independent of $N$ under ideal conditions. However, realistic noisy QCs show a quantum-to-classical transition as $N$ increases, giving a foundationally-motivated scalable benchmarking metric. Two methods are formulated to implement this metric: one that involves a mid-circuit measurement, probing the irreversible collapse of the wavefunction, in contrast to the reversible entanglement generated in the other. Both methods are designed to be clumsiness-loophole free: the unwanted classical disturbances are negligible within statistical error. Violation of MR is detected on a IBM QC up to $N = 38$ qubits, increasing $N$ by one order of magnitude over best known results of MR. Two QCs are benchmarked using the proposed NDC metric, showing a three-fold improvement in their quantumness from one generation to the next.

Related papers

• Enhancing Kerr-Cat Qubit Coherence with Controlled Dissipation [64.05054054401175]
  Kerr-cat qubit (KCQ) is a bosonic quantum processor.<n>KCQs are experimentally compatible with on-chip architectures and high-fidelity operations.<n>We present direct evidence that the bit-flip time in a KCQ is limited by leakage out of the qubit manifold.
  arXiv  Detail & Related papers  (2025-11-02T17:58:36Z)
• Calibration of Quantum Devices via Robust Statistical Methods [45.464983015777314]
  We numerically analyze advanced statistical methods for Bayesian inference against the state-of-the-art in quantum parameter learning.<n>We show advantages of these approaches over existing ones, namely under multi-modality and high dimensionality.<n>Our findings have applications in challenging quantumcharacterization tasks namely learning the dynamics of open quantum systems.
  arXiv  Detail & Related papers  (2025-07-09T15:22:17Z)
• Entanglement detection with quantum support vector machine(QSVM) on near-term quantum devices [0.0]
  This study presents the implementation of quantum support vector machines (QSVMs) on IBM quantum devices to identify and classify entangled states.<n>Our results demonstrate that the QSVM framework achieves over 90% accuracy in distinguishing entangled states, despite hardware noise.<n>This work marks a significant advancement in quantum machine learning for entanglement detection.
  arXiv  Detail & Related papers  (2025-03-30T13:48:05Z)
• Mitigating Errors on Superconducting Quantum Processors through Fuzzy Clustering [38.02852247910155]
  A new Quantum Error Mitigation (QEM) technique uses Fuzzy C-Means clustering to specifically identify measurement error patterns. We report a proof-of-principle validation of the technique on a 2-qubit register, obtained as a subset of a real NISQ 5-qubit superconducting quantum processor. We demonstrate that the FCM-based QEM technique allows for reasonable improvement of the expectation values of single- and two-qubit gates based quantum circuits.
  arXiv  Detail & Related papers  (2024-02-02T14:02:45Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Fidelity-based distance bounds for $N$-qubit approximate quantum error correction [0.0]
  Eastin-Knill theorem states that a quantum code cannot correct errors exactly, possess continuous symmetries, and implement a universal set of gates transversely. It is common to employ a complementary measure of fidelity as a way to quantify quantum state distinguishability and benchmark approximations in error correction. We address two distance measures based on the sub- and superfidelities as a way to bound error approximations, which in turn require a lower computational cost.
  arXiv  Detail & Related papers  (2022-12-08T16:10:58Z)
• Error Mitigation-Aided Optimization of Parameterized Quantum Circuits: Convergence Analysis [42.275148861039895]
  Variational quantum algorithms (VQAs) offer the most promising path to obtaining quantum advantages via noisy processors. gate noise due to imperfections and decoherence affects the gradient estimates by introducing a bias. Quantum error mitigation (QEM) techniques can reduce the estimation bias without requiring any increase in the number of qubits. QEM can reduce the number of required iterations, but only as long as the quantum noise level is sufficiently small.
  arXiv  Detail & Related papers  (2022-09-23T10:48:04Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Unimon qubit [42.83899285555746]
  Superconducting qubits are one of the most promising candidates to implement quantum computers. Here, we introduce and demonstrate a superconducting-qubit type, the unimon, which combines the desired properties of high non-linearity, full insensitivity to dc charge noise, insensitivity to flux noise, and a simple structure consisting only of a single Josephson junction in a resonator.
  arXiv  Detail & Related papers  (2022-03-11T12:57:43Z)
• Efficient quantum readout-error mitigation for sparse measurement outcomes of near-term quantum devices [4.814193390931978]
  We propose two efficient quantum readout error mitigation methods.<n>The proposed methods finish in $O(ns2)$ time for probability distributions of $n$ qubits and $s$ shots.<n>Using the proposed method, the mitigation of the 65-qubit GHZ state takes only a few seconds, and we witness the fidelity of the 29-qubit GHZ state exceeding 0.5.
  arXiv  Detail & Related papers  (2022-01-26T16:42:03Z)
• Quantum error mitigation via matrix product operators [27.426057220671336]
  Quantum error mitigation (QEM) can suppress errors in measurement results via repeated experiments and post decomposition of data. MPO representation increases the accuracy of modeling noise without consuming more experimental resources. Our method is hopeful of being applied to circuits in higher dimensions with more qubits and deeper depth.
  arXiv  Detail & Related papers  (2022-01-03T16:57:43Z)
• Describing quantum metrology with erasure errors using weight distributions of classical codes [9.391375268580806]
  We consider using quantum probe states with a structure that corresponds to classical $[n,k,d]$ binary block codes of minimum distance. We obtain bounds on the ultimate precision that these probe states can give for estimating the unknown magnitude of a classical field.
  arXiv  Detail & Related papers  (2020-07-06T16:22:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.