Oracles and Query Lower Bounds in Generalised Probabilistic Theories.

We investigate the connection between interference and computational power within the operationally defined framework of generalised probabilistic theories. To compare the computational abilities of different theories within this framework we show that any theory satisfying four natural physical principles possess a well-defined oracle model. Indeed, we prove a subroutine theorem for oracles in such theories which is a necessary condition for the oracle model to be well-defined. The four principles are: causality (roughly, no signalling from the future), purification (each mixed state arises as the marginal of a pure state of a larger system), strong symmetry (existence of a rich set of nontrivial reversible transformations), and informationally consistent composition (roughly: the information capacity of a composite system is the sum of the capacities of its constituent subsystems). Sorkin has defined a hierarchy of conceivable interference behaviours, where the order in the hierarchy corresponds to the number of paths that have an irreducible interaction in a multi-slit experiment. Given our oracle model, we show that if a classical computer requires at least n queries to solve a learning problem, because fewer queries provide no information about the solution, then the corresponding "no-information" lower bound in theories lying at the kth level of Sorkin's hierarchy is ⌈ n / k ⌉ . This lower bound leaves open the possibility that quantum oracles are less powerful than general probabilistic oracles, although it is not known whether the lower bound is achievable in general. Hence searches for higher-order interference are not only foundationally motivated, but constitute a search for a computational resource that might have power beyond that offered by quantum computation.

Generalized no-broadcasting theorem.

We prove a generalized version of the no-broadcasting theorem, applicable to essentially any nonclassical finite-dimensional probabilistic model satisfying a no-signaling criterion, including ones with "superquantum" correlations. A strengthened version of the quantum no-broadcasting theorem follows, and its proof is significantly simpler than existing proofs of the no-broadcasting theorem.

Efficient solvability of Hamiltonians and limits on the power of some quantum computational models.

One way to specify a model of quantum computing is to give a set of control Hamiltonians acting on a quantum state space whose initial state and final measurement are specified in terms of the Hamiltonians. We formalize such models and show that they can be simulated classically in a time polynomial in the dimension of the Lie algebra generated by the Hamiltonians and logarithmic in the dimension of the state space. This leads to a definition of Lie-algebraic "generalized mean-field Hamiltonians." We show that they are efficiently (exactly) solvable. Our results generalize the known weakness of fermionic linear optics computation and give conditions on control needed to exploit the full power of quantum computing.

A subsystem-independent generalization of entanglement.

We present a generalization of entanglement based on the idea that entanglement is relative to a distinguished subspace of observables rather than a distinguished subsystem decomposition. A pure quantum state is entangled relative to such a subspace if its expectations are a proper mixture of those of other states. Many information-theoretic aspects of entanglement can be extended to this observable-based setting, suggesting new ways of measuring and classifying multipartite entanglement. By going beyond the distinguishable-subsystem framework, generalized entanglement also provides novel tools for probing quantum correlations in interacting many-body systems.

Incentives and provider payment methods

The mode of payment creates powerful incentives affecting provider behavior and the efficiency, equity and quality outcomes of health finance reforms. This article examines provider incentives as well as administrative costs, and institutional conditions for successful implementation associated with provider payment alternatives. The alternatives considered are budget reforms, capitation, fee-for-service, and case-based reimbursement. We conclude that competition, whether through a regulated private sector or within a public system, has the potential to improve the performance of any payment method. All methods generate both adverse and beneficial incentives. Systems with mixed forms of provider payment can provide tradeoffs to offset the disadvantages of individual modes. Low-income countries should avoid complex payment systems requiring higher levels of institutional development.(AU)

How health insurance affects the delivery of health care in developing countries / How health insurance affects the delivery of health care in developing countries

The goal of delivering health services efficiently and equitably can be more effectively promoted by an insurane institution that actively organizes consumers' entry into the health system and remove the financial incentives that encourage providers to increase the volume and cost of services