Detecting entanglement by the mean value of spin on a quantum computer
- URL: http://arxiv.org/abs/2003.01011v2
- Date: Sun, 31 May 2020 15:01:59 GMT
- Title: Detecting entanglement by the mean value of spin on a quantum computer
- Authors: A.R. Kuzmak and V.M. Tkachuk
- Abstract summary: We implement a protocol to determine the degree of entanglement between a qubit and the rest of the system on a quantum computer.
This protocol is tested on a 5-qubit superconducting quantum processor called ibmq-ourense provided by the IBM company.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We implement a protocol to determine the degree of entanglement between a
qubit and the rest of the system on a quantum computer. The protocol is based
on results obtained in paper [Frydryszak et al. (2017)]. This protocol is
tested on a 5-qubit superconducting quantum processor called ibmq-ourense
provided by the IBM company. We determine the values of entanglement of the
Schr\"odinger cat and the Werner states prepared on this device and compare
them with the theoretical ones. In addition, a protocol for determining the
entanglement of rank-2 mixed states is proposed. We apply this protocol to the
mixed state which consists of two Bell states prepared on the ibmq-ourense
quantum device.
Related papers
- 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) - 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) - 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) - Conference key agreement in a quantum network [67.410870290301]
Quantum conference key agreement (QCKA) allows multiple users to establish a secure key from a shared multi-partite entangled state.
In a quantum network, this protocol can be efficiently implemented using a single copy of a N-qubit Greenberger-Horne-Zeilinger (GHZ) state to distil a secure N-user conference key bit.
arXiv Detail & Related papers (2022-07-04T18:00:07Z) - Efficient Bipartite Entanglement Detection Scheme with a Quantum
Adversarial Solver [89.80359585967642]
Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits.
We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
arXiv Detail & Related papers (2022-03-15T09:46:45Z) - Quantum computation capability verification protocol for NISQ devices
with dihedral coset problem [0.4061135251278187]
We propose an interactive protocol for one party (the verifier) holding a quantum computer to verify the quantum computation power of another party's (the prover) device via a one-way quantum channel.
We conduct a 4-qubit experiment on one of IBM Q devices.
arXiv Detail & Related papers (2022-02-14T19:00:58Z) - 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) - Measuring distance between quantum states on a quantum computer [0.0]
protocols for determining the distances in Hilbert space between pure and mixed quantum states prepared on a quantum computer.
We develop a protocol that allows one to determine the speed of evolution of the spin system simulated by a quantum computer.
arXiv Detail & Related papers (2021-03-09T08:59:12Z) - A P4 Data Plane for the Quantum Internet [68.97335984455059]
A new -- quantum -- network stack will be needed to account for the fundamentally new properties of quantum entanglement.
In the non-quantum world, programmable data planes have broken the pattern of ossification of the protocol stack.
We demonstrate how we use P4$_16$ to explore abstractions and device architectures for quantum networks.
arXiv Detail & Related papers (2020-10-21T19:37:23Z) - Measuring entanglement of a rank-2 mixed state prepared on a quantum
computer [0.0]
We study the entanglement between a certain qubit and the remaining system in rank- 2 mixed states prepared on the quantum computer.
As a special case, we consider a two-qubit rank-2 mixed state and find the relation of concurrence with the geometric measure of entanglement.
arXiv Detail & Related papers (2020-10-13T09:09:25Z) - Quantum Key-Distribution Protocols Based on a Quantum Version of the
Monty Hall Game [0.0]
The study proposed two quantum key-distribution protocols based on the quantum version of the Monty Hall game devised by Flitney and Abbott.
The motivation behind the second proposal is to simplify a possible physical implementation by adapting the formalism of the qutrit protocol to use qubits and simple logical quantum gates.
arXiv Detail & Related papers (2020-05-11T22:06:30Z)
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.