iqm.benchmarks.entanglement.graph_states

iqm.benchmarks.entanglement.graph_states#

Graph states benchmark

Functions

find_edges_with_disjoint_neighbors(graph)

Finds sets of edges with non-overlapping neighboring nodes.

generate_graph_state(qubits, backend)

Generates a circuit with minimal depth preparing a native graph state for a given backend using given qubits.

generate_minimal_edge_layers(cp_map)

Sorts the edges of a coupling map, arranging them in a dictionary with values being subsets of the coupling map with no overlapping nodes.

negativity_analysis(run)

Analysis function for a Graph State benchmark experiment.

plot_density_matrix(matrix, qubit_pair, ...)

Plots a density matrix for corresponding qubit pairs, neighbor qubit projections, and negativities.

plot_max_negativities(negativities, ...[, ...])

Plots the maximum negativity for each corresponding pair of qubits.

plot_max_negativities_graph(negativities, ...)

Plots the maximum negativity for each corresponding pair of qubits in a graph layout of the given backend.

shadow_tomography_analysis(dataset, ...)

Performs shadow tomography analysis on the given dataset.

state_tomography_analysis(dataset, ...)

Performs state tomography analysis on the given dataset.

update_pauli_expectations(...)

Helper function that updates the input Pauli expectations dictionary of dictionaries (projections -> {pauli string: expectation}).

Classes

GraphStateBenchmark(backend_arg, configuration)

The Graph States benchmark estimates the bipartite entangelement negativity of native graph states.

GraphStateConfiguration(*, benchmark, shots, ...)

Graph States Benchmark configuration.

Inheritance

Inheritance diagram of iqm.benchmarks.entanglement.graph_states