Key applications of quantum computing, including error correction, rely critically on the capability to measure (read out) state selected bits, without disturbing other qubits or terminating computation. Such $m\phantom{\rule{0}{0ex}}i\phantom{\rule{0}{0ex}}d\phantom{\rule{0}{0ex}}c\phantom{\rule{0}{0ex}}i\phantom{\rule{0}{0ex}}r\phantom{\rule{0}{0ex}}c\phantom{\rule{0}{0ex}}u\phantom{\rule{0}{...

This document describes a framework for preparing text strings in order to increase the likelihood that string input and string comparison work in ways that make sense for typical users throughout the world. The stringprep protocol is useful for protocol identifier values, company and personal names, internationalized domain names, and other text strings. This document does not specify how prot...

This biographical sketch on Frederick L. Hoffman corresponds to the historic text, The Classic: A Plan for a More Effective Federal and State Health Administration, available at DOI 10.1007/s11999-009-1000-x. The article can also be accessed on the American Journal of Public Health web site at (http://www.ajph.org/cgi/reprint/9/3/161-a).

The k-th p-power of a graph G is the graph on the vertex set V (G), where two k-tuples are adjacent iff the number of their coordinates which are adjacent in G is not congruent to 0 modulo p. The clique number of powers of G is poly-logarithmic in the number of vertices, thus graphs with small independence numbers in their p-powers do not contain large homogenous subsets. We provide algebraic u...