The police officer's terrorist dilemma: Trust resilience following fatal errors

Suicide attacks have raised the stakes for officers deciding whether or not to shoot a suspect ('Police Officer's Terrorist Dilemma'). Despite high-profile errors we know little about how trust in the police is affected by their response to the terrorist threat. Building on a conceptualisation of lay observers as intuitive signal detection theorists, a general population sample (N= 1153) were presented with scenarios manipulated in terms of suspect status (Armed/Unarmed), officer decision (Shoot/Not Shoot) and outcome severity (e.g. suspect armed with Bomb/Knife; police shoot suspect/ suspect plus child bystander). Supporting predictions, people showed higher trust in officers who made correct decisions. reflecting good discrimination ability and who decided to shoot, reflecting an 'appropriate' response bias given the relative costs and benefits. This latter effect was moderated by (a) outcome severity, suggesting it did not simply reflect a preference for a particular type of action, and (b) preferences for a tough stance towards terrorism indexed by Right-Wing Authoritarianism (RWA). Despite loss of civilian life, failure to prevent minor terror attacks resulted in no loss of trust amongst people low in RWA. whereas among people high in RWA trust was positive when police erroneously shot all unarmed suspect. Relations to alternative definitions of trust and procedural justice research are discussed. Copyright (C),. 2007 John Wiley & Sons, Ltd.

Noise resilience and entanglement evolution in two nonequivalent classes of quantum algorithms

The speedup provided by quantum algorithms with respect to their classical counterparts is at the origin of scientific interest in quantum computation. However, the fundamental reasons for such a speedup are not yet completely understood and deserve further attention. In this context, the classical simulation of quantum algorithms is a useful tool that can help us in gaining insight. Starting from the study of general conditions for classical simulation, we highlight several important differences between two nonequivalent classes of quantum algorithms. We investigate their performance under realistic conditions by quantitatively studying their resilience with respect to static noise. This latter refers to errors affecting the initial preparation of the register used to run an algorithm. We also compare the evolution of the entanglement involved in the different computational processes.