The Original Understanding of the New Hampshire Constitution’s Education Clause

[Excerpt] “In 1993, the New Hampshire Supreme Court held that “part II, article 83 [of the state constitution] imposes a duty on the State to provide a constitutionally adequate education to every educable child in the public schools in New Hampshire and to guarantee adequate funding,” and that this duty is enforceable by the judiciary. This decision, known as Claremont I, was the wellspring of a line of decisions that has radically changed both the manner in which public education is funded in New Hampshire and the respective roles of the judicial branch and the representative branches in formulating education policy. Since the adoption of the state constitution in 1784, public education in New Hampshire had been funded primarily with local taxes. The Claremont decisions flatly rejected this long tradition of local control of the funding of public education: “Whatever the State identifies as comprising constitutional adequacy it must pay for. None of that financial obligation can be shifted to local school districts, regardless of their relative wealth or need.”

New Hampshire’s Claremont Case and the Separation of Powers

[Excerpt] Court decisions involving the adequacy of public education raise some obvious separation of powers problems. These include the institutional competency of courts to determine what level of education is adequate and how much funding is necessary to reach that level, and the authority of courts to enforce such judgments. This article will examine these problems through New Hampshire’s serial education funding litigation, the Claremont case. [. . .] I will start by briefly reviewing the history of education funding litigation because this context is essential to understanding the Claremont case. I will then undertake a limited review of the Claremont case. Finally, I will consider Claremont from the standpoint of the separation of powers. I begin by examining the text and structure of the State Constitution and then consider whether there are judicially discoverable and manageable standards for determining what level of education is adequate and how much funding is necessary to reach that level. Because there is a textually demonstrable commitment of education funding and education policy to the legislative branch, and because what an adequate education comprises and costs are quintessentially political questions, Claremont represents a clear trespass on legislative powers and should be overruled.

Health Insurance Competition: The Effect of Group Contracts

In countries like the US and the Netherlands health insurance is provided by private firms. These private firms can offer both individual and group contracts. The strategic and welfare implications of such group contracts are not well understood. Using a Dutch data set of about 700 group health insurance contracts over the period 2007-2008, we estimate a model to determine which factors explain the price of group contracts. We find that groups that are located close to an insurers’ home turf pay a higher premium than other groups. This finding is not consistent with the bargaining argument in the literature as it implies that concentrated groups close to an insurer’s home turf should get (if any) a larger discount than other groups. A simple Hotelling model, however, does explain our empirical results.health insurance;health-plan choice;managed competition

Note about a second "evidence" for a WIMP annual modulation

This note, with its five questions, is intended to contribute to a clarification about a claimed "evidence" by the DAMA group of an annual modulation of the counting rate of a Dark Matter NaI(Tl) detector as due to a neutralino (SUSY-LSP) Dark Matter candidate.Comment: LaTex, 3 pages, 2 figure

On Quantum Algorithms

Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. In effect, they follow the same logical paradigm as (multi-particle) interferometers. We show how most known quantum algorithms, including quantum algorithms for factorising and counting, may be cast in this manner. Quantum searching is described as inducing a desired relative phase between two eigenvectors to yield constructive interference on the sought elements and destructive interference on the remaining terms.Comment: 15 pages, 8 figure

Interface bonding of a ferromagnetic/semiconductor junction : a photoemission study of Fe/ZnSe(001)

We have probed the interface of a ferromagnetic/semiconductor (FM/SC) heterojunction by a combined high resolution photoemission spectroscopy and x-ray photoelectron diffraction study. Fe/ZnSe(001) is considered as an example of a very low reactivity interface system and it expected to constitute large Tunnel Magnetoresistance devices. We focus on the interface atomic environment, on the microscopic processes of the interface formation and on the iron valence-band. We show that the Fe contact with ZnSe induces a chemical conversion of the ZnSe outermost atomic layers. The main driving force that induces this rearrangement is the requirement for a stable Fe-Se bonding at the interface and a Se monolayer that floats at the Fe growth front. The released Zn atoms are incorporated in substitution in the Fe lattice position. This formation process is independent of the ZnSe surface termination (Zn or Se). The Fe valence-band evolution indicates that the d-states at the Fermi level show up even at submonolayer Fe coverage but that the Fe bulk character is only recovered above 10 monolayers. Indeed, the Fe 1-band states, theoretically predicted to dominate the tunneling conductance of Fe/ZnSe/Fe junctions, are strongly modified at the FM/SC interface.Comment: 23 pages, 5 figures, submitted to Physical review

Quantum Networks for Concentrating Entanglement

If two parties, Alice and Bob, share some number, n, of partially entangled pairs of qubits, then it is possible for them to concentrate these pairs into some smaller number of maximally entangled states. We present a simplified version of the algorithm for such entanglement concentration, and we describe efficient networks for implementing these operations.Comment: 15 pages, 2 figure

Quantum state restoration and single-copy tomography

Given a single copy of an n qubit quantum state |psi>, the no-cloning theorem greatly limits the amount of information which can be extracted from it. Moreover, given only a procedure which verifies the state, for example a procedure which measures the operator |psi> in time polynomial in n . In this paper, we consider the scenario in which we are given both a single copy of |psi> and the ability to verify it. We show that in this setting, we can do several novel things efficiently. We present a new algorithm that we call quantum state restoration which allows us to extend a large subsystem of |psi> to the full state, and in turn this allows us to copy small subsystems of |psi>. In addition, we present algorithms that can perform tomography on small subsystems of |psi>, and we show how to use these algorithms to estimate the statistics of any efficiently implementable POVM acting on |psi> in time polynomial in the number of outcomes of the POVM.Comment: edited for clarity; 13 pages, 1 figur

Restrictions on Transversal Encoded Quantum Gate Sets

Transversal gates play an important role in the theory of fault-tolerant quantum computation due to their simplicity and robustness to noise. By definition, transversal operators do not couple physical subsystems within the same code block. Consequently, such operators do not spread errors within code blocks and are, therefore, fault tolerant. Nonetheless, other methods of ensuring fault tolerance are required, as it is invariably the case that some encoded gates cannot be implemented transversally. This observation has led to a long-standing conjecture that transversal encoded gate sets cannot be universal. Here we show that the ability of a quantum code to detect an arbitrary error on any single physical subsystem is incompatible with the existence of a universal, transversal encoded gate set for the code.Comment: 4 pages, v2: minor change