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:2303.13911 · npj Quantum Information

Cross-platform comparison of arbitrary quantum processes

Congcong Zheng, Xutao Yu, Kun Wang

Published Jan 3, 2024• 8 citations
arXivHTMLPDF

Abstract

Abstract In this work, we present a protocol for comparing the performance of arbitrary quantum processes executed on spatially or temporally disparate quantum platforms using Local Operations and Classical Communication (LOCC). The protocol involves sampling local unitary operators, which are then communicated to each platform via classical communication to construct quantum state preparation and measurement circuits. Subsequently, the local unitary operators are implemented on each platform, resulting in the generation of probability distributions of measurement outcomes. The max process fidelity is estimated from the probability distributions, which ultimately quantifies the relative performance of the quantum processes. Furthermore, we demonstrate that this protocol can be adapted for quantum process tomography. We apply the protocol to compare the performance of five quantum devices from IBM and the “Qianshi" quantum computer from Baidu via the cloud. The experimental results unveil two notable aspects: Firstly, the protocol adeptly compares the performance of the quantum processes implemented on different quantum computers. Secondly, the protocol scales, although still exponentially, much more favorably with the number of qubits, when compared to the full quantum process tomography. We view our work as a catalyst for collaborative efforts in cross-platform comparison of quantum computers.

DOI
10.1038/s41534-023-00797-3

Related papers

Cross-platform comparison of arbitrary quantum states

Daiwei Zhu, Ze-Pei Cian, Crystal Noel +14 more

As we approach the era of quantum advantage, when quantum computers (QCs) can outperform any classical computer on particular tasks, there remains the difficult challenge of how to validate their performance. While algorithmic success can be easily verified in some instances such as number factoring or oracular algorithms, these approaches only provide pass/fail information of executing specific tasks for a single QC. On the other hand, a comparison between different QCs preparing nominally the same arbitrary circuit provides an insight for generic validation: a quantum computation is only as valid as the agreement between the results produced on different QCs. Such an approach is also at the heart of evaluating metrological standards such as disparate atomic clocks. In this paper, we report a cross-platform QC comparison using randomized and correlated measurements that results in a wealth of information on the QC systems. We execute several quantum circuits on widely different physical QC platforms and analyze the cross-platform state fidelities.

arXiv:2107.11387•Nature Communications•Nov 4, 2022•60 citations

Distributed Quantum inner product estimation

Anurag Anshu, Zeph A. Landau, Yunchao Liu

As small quantum computers are becoming available on different physical platforms, a benchmarking task known as cross-platform verification has been proposed that aims to estimate the fidelity of states prepared on two quantum computers. This task is fundamentally distributed, as no quantum communication can be performed between the two physical platforms due to hardware constraints, which prohibits a joint SWAP test. In this paper we settle the sample complexity of this task across all measurement and communication settings. The essence of the task, which we call distributed quantum inner product estimation, involves two players Alice and Bob who have k copies of unknown states ρ,σ (acting on ℂd) respectively. Their goal is to estimate Tr(ρσ) up to additive error ε∈(0,1), using local quantum operations and classical communication. In the weakest setting where only non-adaptive single-copy measurements and simultaneous message passing are allowed, we show that k=O(max{1/ε2,√d/ε}) copies suffice. This achieves a savings compared to full tomography which takes Ω(d3) copies with single-copy measurements. Surprisingly, we also show that the sample complexity must be at least Ω(max{1/ε2,√d/ε}), even in the strongest setting where adaptive multi-copy measurements and arbitrary rounds of communication are allowed. This shows that the success achieved by shadow tomography, for sample-efficiently learning the properties of a single system, cannot be generalized to the distributed setting. Furthermore, the fact that the sample complexity remains the same with single and multi-copy measurements contrasts with single system quantum property testing, which often demonstrate exponential separations in sample complexity with single and multi-copy measurements.

arXiv:2111.03273•ACM Symposium on Theory of Computing (STOC)•Jun 9, 2022•50 citations

Benchmarking the computational power of quantum computers

Timothy Proctor, Oliver Hart, Oliver Widzowski Maupin +27 more

Quantum computing hardware is advancing rapidly toward utility-scale machines that will enable scientific breakthroughs. Many teams are pursuing distinct and difficult-to-compare routes to this goal, using different qubit technologies and logical architectures. Tracking progress toward quantum utility therefore requires rigorous benchmarks that measure computational capability relative to utility-scale challenge problems and enable fair comparison across disparate platforms. Here we demonstrate direct, cross-platform measurement of quantum computational capability using a new benchmark that quantifies the size of the largest computationally relevant quantum circuits that a machine can execute successfully and the speed at which it can execute them. We apply this quantum universal operation performance system (QUOPS) experimentally to leading processors from Quantinuum, Google, and IBM, computing directly on physical qubits. Translating state-of-the-art resource requirements for recognized challenge problems that represent useful quantum computation into effective QUOPS circuit sizes shows that computational capability must grow by 5 orders of magnitude, motivating fault-tolerant approaches. We use the same benchmark to assess the performance of a simple fault-tolerant logical-qubit processor implemented on up to eight [[7,1,3]]-encoded logical qubits using Quantinuum Helios-1, and project the growth of capability across successive generations of fault-tolerant quantum computers to show how QUOPS can track progress toward quantum scientific utility.

quant-pharXiv:2609.12146•Sep 14, 2026•2 citations

Photonic processor benchmarking for variational quantum process tomography

Vladlen Galetsky, Paul R. Kohl, Janis Nötzel

Abstract We present a quantum-analogous experimental demonstration of variational quantum process tomography using an optical processor. This approach leverages classical one-hot encoding and unitary decomposition to perform the variational quantum algorithm on a photonic platform. We create the first benchmark for variational quantum process tomography evaluating the performance of the quantum-analogous experiment on the optical processor against several publicly accessible quantum computing platforms, including IBM’s 127-qubit Sherbrooke processor, QuTech’s five-qubit Tuna-5 processor, and Quandela’s 12-mode Ascella quantum optical processor. We evaluate each method using process fidelity, cost function convergence, and processing time per iteration for variational quantum circuit depths of d = 3 and d = 6. Our results indicate that the optical processors outperform their superconducting counterparts in terms of fidelity and convergence behavior reaching fidelities of 0.8 after nine iterations, particularly at higher depths, where the noise of decoherence and dephasing affect the superconducting processors significantly. We further investigate the influence of any additional quantum optical effects in our platform relative to the classical one-hot encoding. From the process fidelity results it shows that the (classical) thermal noise in the phase-shifters dominates over other optical imperfections, such as mode mismatch and dark counts from single-photon sources. The benchmarking framework and experimental results demonstrate that photonic processors are strong contenders for near-term quantum algorithm deployment, particularly in hybrid variational contexts. This analysis is valuable not only for state and process tomography but also for a wide range of applications involving variational quantum circuit based algorithms.

arXiv:2507.08570•New Journal of Physics•Oct 1, 2025•1 citation

Single-Qubit Cross Platform Comparison of Quantum Computing Hardware

Adrien Suau, Jon Nelson, Marc Vuffray +3 more

As a variety of quantum computing models and platforms become available, methods for assessing and comparing the performance of these devices are of increasing interest and importance. Despite being built of the same fundamental computational unit, radically different approaches have emerged for characterizing the performance of qubits in gate-based and quantum annealing computers, limiting and complicating consistent cross-platform comparisons. To fill this gap, this work proposes a single-qubit protocol (Q-RBPN) for measuring some basic performance characteristics of individual qubits in both models of quantum computation. The proposed protocol scales to large quantum computers with thousands of qubits and provides insights into the distribution of qubit properties within a particular hardware device and across families of devices. The efficacy of the Q-RBPN protocol is demonstrated through the analysis of more than 300 gate-based qubits spanning eighteen machines and 2000 annealing-based qubits from one machine, revealing some unexpected differences in qubit performance. Overall, the proposed Q-RBPN protocol provides a new platform-agnostic tool for assessing the performance of a wide range of emerging quantum computing devices.

arXiv:2108.11334•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•7 citations

When a quantum measurement can be implemented locally, and when it cannot

Scott M. Cohen

In the absence of quantum channels, local operations on subsystems and classical communication between parties (LOCC) constitute the most general protocols available on spatially separated quantum systems. Every LOCC protocol implements a separable quantum measurement, but it is known that there exist separable measurements that cannot be implemented by LOCC. A longstanding problem in quantum information theory is to understand the difference between LOCC and the full set of separable measurements. Toward this end, we show in this paper how to construct an LOCC protocol to implement an arbitrary separable measurement whenever such a protocol exists. In addition, given a measurement that cannot be implemented by LOCC within some fixed maximum number of rounds, the method shows explicitly that this is the case.

arXiv:0912.1607•Physical Review A•Nov 21, 2011•12 citations
Abstract In this work, we present a protocol for comparing the performance of arbitrary quantum processes executed on spatially or temporally disparate quantum platforms using Local Operations and Classical Communication (LOCC). The protocol involves sampling local unitary operators, which are then communicated to each platform via classical communication to construct quantum state preparation and measurement circuits. Subsequently, the local unitary operators are implemented on each platform, resulting in the generation of probability distributions of measurement outcomes. The max process fidelity is estimated from the probability distributions, which ultimately quantifies the relative performance of the quantum processes. Furthermore, we demonstrate that this protocol can be adapted for quantum process tomography. We apply the protocol to compare the performance of five quantum devices from IBM and the “Qianshi" quantum computer from Baidu via the cloud. The experimental results unveil two notable aspects: Firstly, the protocol adeptly compares the performance of the quantum processes implemented on different quantum computers. Secondly, the protocol scales, although still exponentially, much more favorably with the number of qubits, when compared to the full quantum process tomography. We view our work as a catalyst for collaborative efforts in cross-platform comparison of quantum computers.
As we approach the era of quantum advantage, when quantum computers (QCs) can outperform any classical computer on particular tasks, there remains the difficult challenge of how to validate their performance. While algorithmic success can be easily verified in some instances such as number factoring or oracular algorithms, these approaches only provide pass/fail information of executing specific tasks for a single QC. On the other hand, a comparison between different QCs preparing nominally the same arbitrary circuit provides an insight for generic validation: a quantum computation is only as valid as the agreement between the results produced on different QCs. Such an approach is also at the heart of evaluating metrological standards such as disparate atomic clocks. In this paper, we report a cross-platform QC comparison using randomized and correlated measurements that results in a wealth of information on the QC systems. We execute several quantum circuits on widely different physical QC platforms and analyze the cross-platform state fidelities.
As small quantum computers are becoming available on different physical platforms, a benchmarking task known as cross-platform verification has been proposed that aims to estimate the fidelity of states prepared on two quantum computers. This task is fundamentally distributed, as no quantum communication can be performed between the two physical platforms due to hardware constraints, which prohibits a joint SWAP test. In this paper we settle the sample complexity of this task across all measurement and communication settings. The essence of the task, which we call distributed quantum inner product estimation, involves two players Alice and Bob who have k copies of unknown states ρ,σ (acting on ℂd) respectively. Their goal is to estimate Tr(ρσ) up to additive error ε∈(0,1), using local quantum operations and classical communication. In the weakest setting where only non-adaptive single-copy measurements and simultaneous message passing are allowed, we show that k=O(max{1/ε2,√d/ε}) copies suffice. This achieves a savings compared to full tomography which takes Ω(d3) copies with single-copy measurements. Surprisingly, we also show that the sample complexity must be at least Ω(max{1/ε2,√d/ε}), even in the strongest setting where adaptive multi-copy measurements and arbitrary rounds of communication are allowed. This shows that the success achieved by shadow tomography, for sample-efficiently learning the properties of a single system, cannot be generalized to the distributed setting. Furthermore, the fact that the sample complexity remains the same with single and multi-copy measurements contrasts with single system quantum property testing, which often demonstrate exponential separations in sample complexity with single and multi-copy measurements.
Quantum computing hardware is advancing rapidly toward utility-scale machines that will enable scientific breakthroughs. Many teams are pursuing distinct and difficult-to-compare routes to this goal, using different qubit technologies and logical architectures. Tracking progress toward quantum utility therefore requires rigorous benchmarks that measure computational capability relative to utility-scale challenge problems and enable fair comparison across disparate platforms. Here we demonstrate direct, cross-platform measurement of quantum computational capability using a new benchmark that quantifies the size of the largest computationally relevant quantum circuits that a machine can execute successfully and the speed at which it can execute them. We apply this quantum universal operation performance system (QUOPS) experimentally to leading processors from Quantinuum, Google, and IBM, computing directly on physical qubits. Translating state-of-the-art resource requirements for recognized challenge problems that represent useful quantum computation into effective QUOPS circuit sizes shows that computational capability must grow by 5 orders of magnitude, motivating fault-tolerant approaches. We use the same benchmark to assess the performance of a simple fault-tolerant logical-qubit processor implemented on up to eight [[7,1,3]]-encoded logical qubits using Quantinuum Helios-1, and project the growth of capability across successive generations of fault-tolerant quantum computers to show how QUOPS can track progress toward quantum scientific utility.
Abstract We present a quantum-analogous experimental demonstration of variational quantum process tomography using an optical processor. This approach leverages classical one-hot encoding and unitary decomposition to perform the variational quantum algorithm on a photonic platform. We create the first benchmark for variational quantum process tomography evaluating the performance of the quantum-analogous experiment on the optical processor against several publicly accessible quantum computing platforms, including IBM’s 127-qubit Sherbrooke processor, QuTech’s five-qubit Tuna-5 processor, and Quandela’s 12-mode Ascella quantum optical processor. We evaluate each method using process fidelity, cost function convergence, and processing time per iteration for variational quantum circuit depths of d = 3 and d = 6. Our results indicate that the optical processors outperform their superconducting counterparts in terms of fidelity and convergence behavior reaching fidelities of 0.8 after nine iterations, particularly at higher depths, where the noise of decoherence and dephasing affect the superconducting processors significantly. We further investigate the influence of any additional quantum optical effects in our platform relative to the classical one-hot encoding. From the process fidelity results it shows that the (classical) thermal noise in the phase-shifters dominates over other optical imperfections, such as mode mismatch and dark counts from single-photon sources. The benchmarking framework and experimental results demonstrate that photonic processors are strong contenders for near-term quantum algorithm deployment, particularly in hybrid variational contexts. This analysis is valuable not only for state and process tomography but also for a wide range of applications involving variational quantum circuit based algorithms.
As a variety of quantum computing models and platforms become available, methods for assessing and comparing the performance of these devices are of increasing interest and importance. Despite being built of the same fundamental computational unit, radically different approaches have emerged for characterizing the performance of qubits in gate-based and quantum annealing computers, limiting and complicating consistent cross-platform comparisons. To fill this gap, this work proposes a single-qubit protocol (Q-RBPN) for measuring some basic performance characteristics of individual qubits in both models of quantum computation. The proposed protocol scales to large quantum computers with thousands of qubits and provides insights into the distribution of qubit properties within a particular hardware device and across families of devices. The efficacy of the Q-RBPN protocol is demonstrated through the analysis of more than 300 gate-based qubits spanning eighteen machines and 2000 annealing-based qubits from one machine, revealing some unexpected differences in qubit performance. Overall, the proposed Q-RBPN protocol provides a new platform-agnostic tool for assessing the performance of a wide range of emerging quantum computing devices.
In the absence of quantum channels, local operations on subsystems and classical communication between parties (LOCC) constitute the most general protocols available on spatially separated quantum systems. Every LOCC protocol implements a separable quantum measurement, but it is known that there exist separable measurements that cannot be implemented by LOCC. A longstanding problem in quantum information theory is to understand the difference between LOCC and the full set of separable measurements. Toward this end, we show in this paper how to construct an LOCC protocol to implement an arbitrary separable measurement whenever such a protocol exists. In addition, given a measurement that cannot be implemented by LOCC within some fixed maximum number of rounds, the method shows explicitly that this is the case.