QAOA

Here we generate and optimize pattern for QAOA circuit.

import networkx as nx
import numpy as np

from graphix import Circuit

rng = np.random.default_rng()

n = 4
xi = rng.random(6)
theta = rng.random(4)
g = nx.complete_graph(n)
circuit = Circuit(n)
for i, (u, v) in enumerate(g.edges):
    circuit.cnot(u, v)
    circuit.rz(v, xi[i])
    circuit.cnot(u, v)
for v in g.nodes:
    circuit.rx(v, theta[v])

transpile and get the graph state

pattern = circuit.transpile().pattern
pattern.standardize()
pattern.shift_signals()
pattern.draw_graph(flow_from_pattern=False)

Flow detected in the graph.

perform Pauli measurements and plot the new (minimal) graph to perform the same quantum computation

pattern.perform_pauli_measurements()
pattern.draw_graph(flow_from_pattern=False)

Gflow detected in the graph. (flow not detected)

finally, simulate the QAOA circuit

out_state = pattern.simulate_pattern()
state = circuit.simulate_statevector().statevec
print("overlap of states: ", np.abs(np.dot(state.psi.flatten().conjugate(), out_state.psi.flatten())))
# sphinx_gallery_thumbnail_number = 2

overlap of states:  0.9999999999999996