Towards a benchmark for quantum computers based on an iterated post-selective protocol
- URL: http://arxiv.org/abs/2410.07056v1
- Date: Wed, 9 Oct 2024 16:54:09 GMT
- Title: Towards a benchmark for quantum computers based on an iterated post-selective protocol
- Authors: Adrian Ortega, Orsolya Kálmán, Tamás Kiss,
- Abstract summary: We propose to employ the quantum state matching protocol for the purpose of testing and benchmarking quantum computers.
By comparing measured values with the theoretical conditional probability of the single, final post-selected qubit, we define a benchmark metric.
A careful analysis of the measured values indicates that its dependence on the initial phase can reveal useful information about coherent gate errors of the quantum device.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Applying post selection in each step of an iterated protocol leads to sensitive quantum dynamics that may be utilized to test and benchmark current quantum computers. An example of this type of protocols was originally proposed for the task of matching an unknown quantum state to a reference state. We propose to employ the quantum state matching protocol for the purpose of testing and benchmarking quantum computers. In particular, we implement this scheme on freely available IBM superconducting quantum computers. By comparing measured values with the theoretical conditional probability of the single, final post-selected qubit, which is easy to calculate classically, we define a benchmark metric. Additionally, the standard deviation of the experimental results from their average serves as a secondary benchmark metric, characterizing fluctuations in the given device. A peculiar feature of the considered protocol is that there is a phase parameter of the initially prepared state, on which the resulting conditional probability should not depend. A careful analysis of the measured values indicates that its dependence on the initial phase can reveal useful information about coherent gate errors of the quantum device.
Related papers
- 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) - Measurement-Device-Independent Detection of Beyond-Quantum State [53.64687146666141]
We propose a measurement-device-independent (MDI) test for beyond-quantum state detection.
We discuss the importance of tomographic completeness of the input sets to the detection.
arXiv Detail & Related papers (2023-12-11T06:40:13Z) - A Feasible Semi-quantum Private Comparison Based on Entanglement
Swapping of Bell States [5.548873288570182]
We propose a feasible semi-quantum private comparison protocol based on entanglement swapping of Bell states.
Security analysis shows that our protocol is resilient to both external and internal attacks.
Our proposed approach showcases the potential applications of entanglement swapping in the field of semi-quantum cryptography.
arXiv Detail & Related papers (2023-05-12T13:28:44Z) - 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) - Transfer Learning in Quantum Parametric Classifiers: An
Information-Theoretic Generalization Analysis [42.275148861039895]
A key step in quantum machine learning with classical inputs is the design of an embedding circuit mapping inputs to a quantum state.
This paper studies a transfer learning setting in which classical-to-quantum embedding is carried out by an arbitrary parametric quantum circuit.
arXiv Detail & Related papers (2022-01-17T09:28:13Z) - 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) - Characterizing quantum instruments: from non-demolition measurements to
quantum error correction [48.43720700248091]
In quantum information processing quantum operations are often processed alongside measurements which result in classical data.
Non-unitary dynamical processes can take place on the system, for which common quantum channel descriptions fail to describe the time evolution.
Quantum measurements are correctly treated by means of so-called quantum instruments capturing both classical outputs and post-measurement quantum states.
arXiv Detail & Related papers (2021-10-13T18:00:13Z) - Experimental characterisation of unsharp qubit observables and
sequential measurement incompatibility via quantum random access codes [0.0]
We report an experimental implementation of unsharp qubit measurements in a sequential communication protocol.
The protocol involves three parties; the first party prepares a qubit system, the second party performs operations which return a classical and quantum outcome, and the latter is measured by the third party.
arXiv Detail & Related papers (2020-01-14T13:37:04Z) - Classical Verification of Quantum Computations [2.1756081703276]
We present the first protocol allowing a classical computer to interactively verify the result of an efficient quantum computation.
We achieve this by constructing a measurement protocol, which enables a classical verifier to use a quantum prover as a trusted measurement device.
arXiv Detail & Related papers (2018-04-03T17:53:05Z)
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.