In a typical experimental run, the training goal can be achieved with an average of 3% of contingent fluctuation. That is, in 3 out of a hundred tests, the system gives a wrong answer according to the training table. This is due to the statistical nature of quantum mechanics. If a threshold is applied to the output ensemble, an accuracy of 100% can be achieved. In this sense, a quantum mechanical architecture ``implements'' a prototypical everyday non-monotonic reasoning that has access to information from a temporal and spatial vantage point.
However, a quantum mechanical architecture can offer richer structures. For example, if the input states are prepared in such a way that the arguments (phases) of the two input qubits' coefficients vary independently, while the absolute value of every qubit remains the same as in the training process (since the coefficient of either the assertion eigenstate or the refutation eigenstate of a particular qubit must be zero, we have only two independent phase parameters instead of four), we find that the deviation from the targeted output can be very large. Specifically, the input state is prepared as:
where
;
. The deviation from the targeted output is shown in Figure 6.8, in which the error (deviation to classical result) is defined as in Equation (6.3). The more interesting situations are when
and
(see the second and the third graphics of the first row in Figure 6.8). As can be seen in the figure, the intuitive valid argument can be implemented only in a narrow area along the diagonal (when
). On the other hand, in a situation where
, the output remains nevertheless largely unknown. In a situation where
, the architecture seems to be quite stable in the output (
is unknown).
It is common in everyday reasoning that the input is not ``well-behaved.'' That is, sometimes we cannot be sure of how ``true'' the antecedents are. In a quantum mechanical framework, this situation can be easily represented by a mixed state of affairs. For example, if proposition
is known to be true but
is refuted to a certain degree, the result should become somewhat uncertain as well. Specifically, in this situation the input state can be prepared as follows
where
with
. (The denominator
is introduce so that the input state is normalized.) The deviation to the targeted output is shown in Figure 6.9. As can be seen in the figure, proposition
remains largely asserted if the phase of
and that
are far away from
. However, if the phase difference between
and
happens to be near
and
is near 1, the output is switched (
).
![]() |
On the other hand, if proposition
is known to be true but
is asserted to a certain degree, we expect that
will become somewhat ``fuzzy'' as well. Specifically, the input state is prepared as follows
where
with
. If the situation is correspondingly prepared, the relative probability of the output state is shown in Figure 6.10. It looks somewhat like the complementary picture of Figure 6.9, but a close comparison with Figure 6.10 shows that this is not the case. This should come with no surprise, for in many everyday arguments, we do not treat a statement that is to a certain degree refuted as the logical complement of a statement that is to a certain degree asserted, especially when we are not sure whether the statement stands. As is shown in this example, a quantum architecture also does not treat statements this way.
![]() |
Another example is when
is known to be true but
is both asserted and refuted to a certain degree at the same time. In this situation, we, intuitively, treat the ``truth-value'' of
as a complementary state of refutation and assertion. To pursue this issue further, the input state of affair can be represented as
where
with
. The deviation from the targeted output is shown in Figure 6.11. This figure shows the complexity of this situation. Specifically, there is a semi-``equipotential'' contour of
graph, on which the increase of
(i.e. assertion of
is counteracted by the increase of
).
![]() |