Benchmarking Multipartite Entanglement Generation with Graph States
- URL: http://arxiv.org/abs/2402.00766v1
- Date: Thu, 1 Feb 2024 16:55:07 GMT
- Title: Benchmarking Multipartite Entanglement Generation with Graph States
- Authors: Ren\'e Zander, Colin Kai-Uwe Becker
- Abstract summary: We experimentally verify that a fully bipartite entangled state can be prepared on a 127-qubit IBM Quantum superconducting QPU.
We also find that genuine multipartite entanglement can be detected for states of up to 23 qubits with quantum readout error mitigation.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: As quantum computing technology slowly matures and the number of available
qubits on a QPU gradually increases, interest in assessing the capabilities of
quantum computing hardware in a scalable manner is growing. One of the key
properties for quantum computing is the ability to generate multipartite
entangled states. In this paper, aspects of benchmarking entanglement
generation capabilities of noisy intermediate-scale quantum (NISQ) devices are
discussed based on the preparation of graph states and the verification of
entanglement in the prepared states. Thereby, we use entanglement witnesses
that are specifically suited for a scalable experiment design. This choice of
entanglement witnesses can detect A) bipartite entanglement and B) genuine
multipartite entanglement for graph states with constant two measurement
settings if the prepared graph state is based on a 2-colorable graph, e.g., a
square grid graph or one of its subgraphs. With this, we experimentally verify
that a fully bipartite entangled state can be prepared on a 127-qubit IBM
Quantum superconducting QPU, and genuine multipartite entanglement can be
detected for states of up to 23 qubits with quantum readout error mitigation.
Related papers
- Machine-learning certification of multipartite entanglement for noisy quantum hardware [1.204553980682492]
Entanglement is a fundamental aspect of quantum physics, both conceptually and for its many applications.
We develop a certification pipeline that feeds statistics of random local measurements into a non-linear dimensionality reduction algorithm.
We verify the accuracy of its predictions on simulated test data, and apply it to states prepared on IBM quantum computing hardware.
arXiv Detail & Related papers (2024-08-22T12:47:58Z) - Mixed-Dimensional Qudit State Preparation Using Edge-Weighted Decision Diagrams [3.393749500700096]
Quantum computers have the potential to solve intractable problems.
One key element to exploiting this potential is the capability to efficiently prepare quantum states for multi-valued, or qudit, systems.
In this paper, we investigate quantum state preparation with a focus on mixed-dimensional systems.
arXiv Detail & Related papers (2024-06-05T18:00:01Z) - 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) - On the feasibility of performing quantum chemistry calculations on quantum computers [0.0]
We propose two criteria for evaluating two leading quantum approaches for finding the ground state of molecules.
The first criterion applies to the variational quantum eigensolver (VQE) algorithm.
The second criterion applies to the quantum phase estimation (QPE) algorithm.
arXiv Detail & Related papers (2023-06-05T06:41:22Z) - Calculating the many-body density of states on a digital quantum
computer [58.720142291102135]
We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer.
We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
arXiv Detail & Related papers (2023-03-23T17:46:28Z) - VENUS: A Geometrical Representation for Quantum State Visualization [14.373238457656237]
VENUS is a novel visualization for quantum state representation.
We show that VENUS can effectively facilitate the exploration of quantum states for the single qubit and two qubits.
arXiv Detail & Related papers (2023-03-15T04:56:23Z) - Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages.
The computation can then be implemented using a series of non-Pauli measurements on this graph state.
arXiv Detail & Related papers (2022-09-15T14:52:31Z) - 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-Memory-Enhanced Preparation of Nonlocal Graph States [10.086067943202416]
Graph states are an important class of multipartite entangled states.
We show an efficient scheme to prepare graph states with only two atomic excitations in quantum networks.
Our work demonstrates the prospect of efficient generation of multipartite entangled states in large-scale distributed systems.
arXiv Detail & Related papers (2022-02-27T15:42:09Z) - From Quantum Graph Computing to Quantum Graph Learning: A Survey [86.8206129053725]
We first elaborate the correlations between quantum mechanics and graph theory to show that quantum computers are able to generate useful solutions.
For its practicability and wide-applicability, we give a brief review of typical graph learning techniques.
We give a snapshot of quantum graph learning where expectations serve as a catalyst for subsequent research.
arXiv Detail & Related papers (2022-02-19T02:56:47Z) - Benchmarking Small-Scale Quantum Devices on Computing Graph Edit
Distance [52.77024349608834]
Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical.
In this paper we present a comparative study of two quantum approaches to computing GED.
arXiv Detail & Related papers (2021-11-19T12:35:26Z)
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.