from abp.graphstate import GraphState from anders_briegel import graphsim from abp import clifford import random import difflib import re def compare(a, b): """ TODO: Sketchy as you like. Remove this abomination """ aa = a.get_adj_list() bb = b.adj_list() try: assert re.sub("\\s", "", aa) == re.sub("\\s", "", bb) except AssertionError: print aa print bb raise def test_hadamard(): """ Test hadamards """ a = graphsim.GraphRegister(1) b = GraphState() b.add_node(0) compare(a, b) a.hadamard(0) b.act_hadamard(0) compare(a, b) a.hadamard(0) b.act_hadamard(0) compare(a, b) def test_local_rotations(): """ Test local rotations """ a = graphsim.GraphRegister(1) b = GraphState() b.add_node(0) compare(a, b) for i in range(1000): j = random.randint(0, 23) a.local_op(0, graphsim.LocCliffOp(j)) b.act_local_rotation(0, j) compare(a, b) def test_cz_table(N=10): """ Test the CZ table """ # Don't test if we are using Pete's CZ table - doesn't make sense if not clifford.legacy_cz: return for j in range(24): a = graphsim.GraphRegister(2) b = GraphState() b.add_node(0) b.add_node(1) compare(a, b) a.local_op(0, graphsim.LocCliffOp(j)) b.act_local_rotation(0, j) a.local_op(1, graphsim.LocCliffOp(j)) b.act_local_rotation(1, j) a.cphase(0, 1) b.act_cz(0, 1) compare(a, b) def test_with_cphase_gates_hadamard_only(N=10): """ Hadamrds and CPHASEs, deterministic """ a = graphsim.GraphRegister(N) b = GraphState() for i in range(N): a.hadamard(i) b.add_node(i) b.act_hadamard(i) for i in range(N-1): a.cphase(i, i+1) b.act_cz(i, i+1) compare(a, b) def test_all(N=10): """ Test all gates at random """ # Don't test if we are using Pete's CZ table - doesn't make sense if not clifford.legacy_cz: return a = graphsim.GraphRegister(N) b = GraphState() for i in range(N): b.add_node(i) for i in range(100): if random.random()>0.5: j = random.randint(0, N-1) a.hadamard(j) b.act_hadamard(j) else: q = random.randint(0, N-2) a.cphase(q, q+1) b.act_cz(q, q+1) aa = a.get_adj_list() bb = b.adj_list() compare(a, b)