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
- On-Chip Verified Quantum Computation with an Ion-Trap Quantum Processing Unit [0.5497663232622965]
We present and experimentally demonstrate a novel approach to verification and benchmarking of quantum computing.
Unlike previous information-theoretically secure verification protocols, our approach is implemented entirely on-chip.
Our results pave the way for more accessible and efficient verification and benchmarking strategies in near-term quantum devices.
arXiv Detail & Related papers (2024-10-31T16:54:41Z) - Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
We present a model for parallelizing simulation of quantum circuit executions.
The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
arXiv Detail & Related papers (2024-06-05T17:16:07Z) - Distributed Quantum Computing in Silicon [40.16556091789959]
We present preliminary demonstrations of some key distributed quantum computing protocols on silicon T centres in isotopically-enriched silicon.
We demonstrate the distribution of entanglement between modules and consume it to apply a teleported gate sequence.
arXiv Detail & Related papers (2024-06-03T18:02:49Z) - Single-Round Proofs of Quantumness from Knowledge Assumptions [41.94295877935867]
A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass.
Existing single-round protocols require large quantum circuits, whereas multi-round ones use smaller circuits but require experimentally challenging mid-circuit measurements.
We construct efficient single-round proofs of quantumness based on existing knowledge assumptions.
arXiv Detail & Related papers (2024-05-24T17:33:10Z) - Quantum algorithms in distributed quantum computing [0.0]
Distributed quantum computing (DQC) provides a way to scale quantum computers using multiple quantum processing units (QPU) which are connected through quantum communication links.
We have built a distributed quantum computing simulator and used it to investigate quantum algorithms.
We show the applicability of dynamic quantum circuits in DQC, where mid-circuit measurements, local operations, and classical communication are used in place of noisy inter-processor (nonlocal) quantum gates.
arXiv Detail & Related papers (2024-02-16T15:05:15Z) - 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) - 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) - Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
"Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation.
We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
arXiv Detail & Related papers (2021-12-09T19:00:00Z) - 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) - 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)
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.