Cross-Platform Verification in Quantum Networks
- URL: http://arxiv.org/abs/2212.07789v1
- Date: Thu, 15 Dec 2022 13:07:33 GMT
- Title: Cross-Platform Verification in Quantum Networks
- Authors: Johannes Kn\"orzer, Daniel Malz, J. Ignacio Cirac
- Abstract summary: 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.
- Score: 0.7734726150561088
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Intermediate-scale quantum devices are becoming more reliable, and may soon
be harnessed to solve useful computational tasks. At the same time, common
classical methods used to verify their computational output become intractable
due to a prohibitive scaling of required resources with system size. Inspired
by recent experimental progress, here we describe and analyze efficient
cross-platform verification protocols for quantum states and show how these can
be used to verify computations. We focus on the pair-wise comparison between
distant nodes of a quantum network, identify the most promising protocols and
then discuss how they can be implemented in laboratory settings. As a proof of
principle, we implement basic versions of these schemes on available quantum
processors.
Related papers
- An efficient quantum state verification framework and its application to bosonic systems [0.0]
We introduce a general framework for the efficient verification of large quantum systems.
Our framework combines robust fidelity witnesses with efficient classical post-processing to implement measurement back-propagation.
arXiv Detail & Related papers (2024-11-07T13:19:22Z) - 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) - 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) - A Quantum-Classical Collaborative Training Architecture Based on Quantum
State Fidelity [50.387179833629254]
We introduce a collaborative classical-quantum architecture called co-TenQu.
Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting.
It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
arXiv Detail & Related papers (2024-02-23T14:09:41Z) - Cross-Platform Comparison of Arbitrary Quantum Processes [5.082103863450012]
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.
arXiv Detail & Related papers (2023-03-24T10:51:11Z) - 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) - 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) - 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) - 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) - Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg
Atoms [55.41644538483948]
We provide the first complete characterization of sources of error in a neutral-atom quantum computer.
We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace.
Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
arXiv Detail & Related papers (2021-05-27T23:29:53Z)
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.