Geometric measure of entanglement of multi-qubit graph states and its detection on a quantum computer
arXiv:2106.10688 · doi:10.1209/0295-5075/ac419b
Abstract
Multi-qubit graph states generated by the action of controlled phase shift operators on a separable quantum state of a system, in which all the qubits are in arbitrary identical states, are examined. The geometric measure of entanglement of a qubit with other qubits is found for the graph states represented by arbitrary graphs. The entanglement depends on the degree of the vertex representing the qubit, the absolute values of the parameter of the phase shift gate, and the parameter of state the gate is acting on. Also, the geometric measure of entanglement of the graph states is quantified on the quantum computer . The results obtained on the quantum device are in good agreement with analytical ones.
References in corpus (25)
- Quantum entanglement
- Experimental quantum teleportation
- Multi-party entanglement in graph states
- Quantum Cryptography with Entangled Photons
- Graph States for Quantum Secret Sharing
- Quantum error-correcting codes associated with graphs
- Chip-to-chip quantum teleportation and multi-photon entanglement in silicon
- Bell Inequalities for Graph States
- 16-qubit IBM universal quantum computer can be fully entangled
- Experimental demonstration of a graph state quantum error-correction code
- Entanglement in a 20-Qubit Superconducting Quantum Computer
- Graph States as a Resource for Quantum Metrology
- Demonstration of Entanglement Purification and Swapping Protocol to Design Quantum Repeater in IBM Quantum Computer
- Pairwise thermal entanglement in Ising-XYZ diamond chain structure in an external magnetic field
- Quantum circuits for maximally entangled states
- Entanglement in eight-qubit graph states
- Quantum error correction codes and absolutely maximally entangled states
- Efficient quantum pseudorandomness with simple graph states
- Quantifying geometric measure of entanglement by mean value of spin and spin correlations for pure and mixed states
- Identification of networking quantum teleportation on 14-qubit IBM universal quantum computer
- Entanglement of graph states of spin system with Ising interaction and its quantifying on IBM's quantum computer
- Detecting entanglement by the mean value of spin on a quantum computer
- Efficient Entanglement Measure for Graph States
- Measuring entanglement of a rank-2 mixed state prepared on a quantum computer
- Preparation and study of the entanglement of the Schrödinger cat state on the ibmq-melbourne quantum computer
Cited by in corpus (6)
- Geometric properties of evolutionary graph states and their detection on a quantum computer
- Entanglement of multi-qubit states representing directed networks and its detection with quantum computing
- Entanglement in Quantum Systems Based on Directed Graphs
- Probing mean values and correlations of high-spin systems on a quantum computer
- Studies of properties of bipartite graphs with quantum programming
- Preparation of two-qubit entangled states on a spin-1/2 Ising-Heisenberg diamond spin cluster by controlling the measurement