Cross-Platform Comparison of Arbitrary Quantum Processes
- URL: http://arxiv.org/abs/2303.13911v1
- Date: Fri, 24 Mar 2023 10:51:11 GMT
- Title: Cross-Platform Comparison of Arbitrary Quantum Processes
- Authors: Congcong Zheng, Xutao Yu, Kun Wang
- Abstract summary: We present a protocol for comparing the performance of arbitrary quantum processes executed on spatially or temporally disparate quantum platforms.
We apply the protocol to compare the performance of five quantum devices from IBM and the "Qianshi" quantum computer from Baidu via the cloud.
- Score: 5.082103863450012
- License: http://creativecommons.org/licenses/by/4.0/
- 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. Remarkably, the
experimental results reveal that the protocol can accurately compare the
performance of the quantum processes implemented on different quantum
computers, requiring significantly fewer measurements than those needed for
full quantum process tomography. We view our work as a catalyst for
collaborative efforts in cross-platform comparison of quantum computers.
Related papers
- Supervised binary classification of small-scale digits images with a trapped-ion quantum processor [56.089799129458875]
We show that a quantum processor can correctly solve the basic classification task considered.
With the increase of the capabilities quantum processors, they can become a useful tool for machine learning.
arXiv Detail & Related papers (2024-06-17T18:20:51Z) - Multi-User Entanglement Distribution in Quantum Networks Using Multipath
Routing [55.2480439325792]
We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing.
The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
arXiv Detail & Related papers (2023-03-06T18:06:00Z) - Cross-Platform Verification in Quantum Networks [0.7734726150561088]
We describe and analyze efficient cross-platform verification protocols for quantum states.
We show how these can be used to verify computations.
As a proof of principle, we implement basic versions of these schemes on available quantum processors.
arXiv Detail & Related papers (2022-12-15T13:07:33Z) - Importance sampling for stochastic quantum simulations [68.8204255655161]
We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients.
We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage.
Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
arXiv Detail & Related papers (2022-12-12T15:06:32Z) - Oblivious Quantum Computation and Delegated Multiparty Quantum
Computation [61.12008553173672]
We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required.
Exploiting quantum teleportation, we propose a two-server protocol for this task.
Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
arXiv Detail & Related papers (2022-11-02T09:01:33Z) - Testing quantum computers with the protocol of quantum state matching [0.0]
The presence of noise in quantum computers hinders their effective operation.
We suggest the application of the so-called quantum state matching protocol for testing purposes.
For systematically varied inputs we find that the device with the smaller quantum volume performs better on our tests than the one with larger quantum volume.
arXiv Detail & Related papers (2022-10-18T08:25:34Z) - Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
We present an approach where the quantum computation is supplemented by a classical result.
Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative.
In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
arXiv Detail & Related papers (2022-09-12T15:47:44Z) - Benchmarking of Quantum Protocols [0.9176056742068812]
We consider several quantum protocols that enable promising functionalities and services in near-future quantum networks.
We use NetSquid simulation platform to evaluate the effect of various sources of noise on the performance of these protocols.
arXiv Detail & Related papers (2021-11-03T21:17:04Z) - Distributed Quantum Computing with QMPI [11.71212583708166]
We introduce an extension of the Message Passing Interface (MPI) to enable high-performance implementations of distributed quantum algorithms.
In addition to a prototype implementation of quantum MPI, we present a performance model for distributed quantum computing, SENDQ.
arXiv Detail & Related papers (2021-05-03T18:30:43Z) - Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor.
We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
arXiv Detail & Related papers (2021-01-21T22:18:49Z) - Design of a Quantum-Repeater using Quantum-Circuits and benchmarking its
performance on an IBM Quantum-Computer [1.9447311464267876]
We report the circuit-level implementation of a quantum repeater, and benchmark this protocol on IBM's cloud quantum computer - IBMQ.
Our experiments indicate a 26% fidelity of shared bell-pairs for a complete on-chip quantum repeater with a yield of 49%.
arXiv Detail & Related papers (2020-09-09T21:44:11Z)
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.