Accountable Care Organizations and Transaction Cost Economics

Using a Transaction Cost Economics (TCE) approach, this paper explores which organizational forms Accountable Care Organizations (ACOs) may take. A critical question about form is the amount of vertical integration that an ACO may have, a topic central to TCE. We posit that contextual factors outside and inside an ACO will produce variable transaction costs (the non-production costs of care) such that the decision to integrate vertically will derive from a comparison of these external versus internal costs, assuming reasonably rational management abilities. External costs include those arising from environmental uncertainty and complexity, small numbers bargaining, asset specificity, frequency of exchanges, and information impactedness. Internal costs include those arising from human resource activities including hiring and staffing, training, evaluating (i.e., disciplining, appraising, or promoting), and otherwise administering programs. At the extreme, these different costs may produce either total vertical integration or little to no vertical integration with most ACOs falling in between. This essay demonstrates how TCE can be applied to the ACO organization form issue, explains TCE, considers ACO activity from the TCE perspective, and reflects on research directions that may inform TCE and facilitate ACO development

A new construction for a QMA complete 3-local Hamiltonian

We present a new way of encoding a quantum computation into a 3-local Hamiltonian. Our construction is novel in that it does not include any terms that induce legal-illegal clock transitions. Therefore, the weights of the terms in the Hamiltonian do not scale with the size of the problem as in previous constructions. This improves the construction by Kempe and Regev, who were the first to prove that 3-local Hamiltonian is complete for the complexity class QMA, the quantum analogue of NP. Quantum k-SAT, a restricted version of the local Hamiltonian problem using only projector terms, was introduced by Bravyi as an analogue of the classical k-SAT problem. Bravyi proved that quantum 4-SAT is complete for the class QMA with one-sided error (QMA_1) and that quantum 2-SAT is in P. We give an encoding of a quantum circuit into a quantum 4-SAT Hamiltonian using only 3-local terms. As an intermediate step to this 3-local construction, we show that quantum 3-SAT for particles with dimensions 3x2x2 (a qutrit and two qubits) is QMA_1 complete. The complexity of quantum 3-SAT with qubits remains an open question.Comment: 11 pages, 4 figure

Spectroscopic Binary Mass Determination using Relativity

High-precision radial-velocity techniques, which enabled the detection of extrasolar planets are now sensitive to relativistic effects in the data of spectroscopic binary stars (SBs). We show how these effects can be used to derive the absolute masses of the components of eclipsing single-lined SBs and double-lined SBs from Doppler measurements alone. High-precision stellar spectroscopy can thus substantially increase the number of measured stellar masses, thereby improving the mass-radius and mass-luminosity calibrations.Comment: 10 pages, 1 figure, accepted for publication by the Astrophysical Journal Letter

Not So SuperDense Coding - Deterministic Dense Coding with Partially Entangled States

The utilization of a $d$-level partially entangled state, shared by two parties wishing to communicate classical information without errors over a noiseless quantum channel, is discussed. We analytically construct deterministic dense coding schemes for certain classes of non-maximally entangled states, and numerically obtain schemes in the general case. We study the dependency of the information capacity of such schemes on the partially entangled state shared by the two parties. Surprisingly, for $d>2$ it is possible to have deterministic dense coding with less than one ebit. In this case the number of alphabet letters that can be communicated by a single particle, is between $d$ and 2d. In general we show that the alphabet size grows in "steps" with the possible values $d, d+1, ..., d^2-2$. We also find that states with less entanglement can have greater communication capacity than other more entangled states.Comment: 6 pages, 2 figures, submitted to Phys. Rev.