Nearest neighbors for each test point selected by running the algorithm in section 2.1 on IBM’s simulator

Test\Training

$x_{00}=\left[0,0,0,0\right],c=0$

$x_{01}=\left[0,0,0,1\right],c=0$

$x_{10}=\left[1,1,1,0\right],c=1$

$x_{11}=\left[1,1,1,1\right],c=1$

[0, 0, 0, 0]

1

1

0

0

[0, 0, 0, 1]

1

1

0

0

[0, 0, 1, 0]

1

1

1

0

[0, 0, 1, 1]

1

1

0

1

[0, 1, 0, 0]

1

1

1

0

[0, 1, 0, 1]

1

1

0

1

[0, 1, 1, 0]

1

0

1

1

[0, 1, 1, 1]

0

1

1

1

[1, 0, 0, 0]

1

1

1

0

[1, 0, 0, 1]

1

1

0

1

[1, 0, 1, 0]

1

0

1

1

[1, 0, 1, 1]

0

1

1

1

[1, 1, 0, 0]

1

0

1

1

[1, 1, 0, 1]

0

1

1

1

[1, 1, 1, 0]

0

0

1

1

[1, 1, 1, 1]

0

0

1

1