The 30/20 GHz communications system functional requirements

The characteristics of 30/20 GHz usage in satellite systems to be used in support of projected communication requirements of the 1990's are defined. A requirements analysis which develops projected market demand for satellite services by general and specialized carriers and an analysis of the impact of propagation and system constraints on 30/20 GHz operation are included. A set of technical performance characteristics for the 30/20 GHz systems which can serve the resulting market demand and the experimental program necessary to verify technical and operational aspects of the proposed systems is also discussed

Relationships between scores on the Jefferson Scale of physician empathy, patient perceptions of physician empathy, and humanistic approaches to patient care: a validity study.

BACKGROUND: Empathy is the backbone of a positive physician-patient relationship. Physician empathy and the patient\u27s awareness of the physician\u27s empathic concern can lead to a more positive clinical outcome. MATERIAL/METHODS: The Jefferson Scale of Physician Empathy (JSPE) was completed by 36 physicians in the Family Medicine residency program at Thomas Jefferson University Hospital, and 90 patients evaluated these physicians by completing the Jefferson Scale of Patient Perceptions of Physician Empathy (JSPPPE), and a survey about physicians\u27 humanistic approaches to patient care. RESULTS: A statistically significant correlation was found between scores of the JSPE and JSPPPE (r=0.48, p CONCLUSIONS: These findings provide further support for the validity of the JSPE. Implications for the assessments of empathy in the physician-patient relationship as related to clinical outcomes are discussed

New Protocols and Lower Bound for Quantum Secret Sharing with Graph States

We introduce a new family of quantum secret sharing protocols with limited quantum resources which extends the protocols proposed by Markham and Sanders and by Broadbent, Chouha, and Tapp. Parametrized by a graph G and a subset of its vertices A, the protocol consists in: (i) encoding the quantum secret into the corresponding graph state by acting on the qubits in A; (ii) use a classical encoding to ensure the existence of a threshold. These new protocols realize ((k,n)) quantum secret sharing i.e., any set of at least k players among n can reconstruct the quantum secret, whereas any set of less than k players has no information about the secret. In the particular case where the secret is encoded on all the qubits, we explore the values of k for which there exists a graph such that the corresponding protocol realizes a ((k,n)) secret sharing. We show that for any threshold k> n-n^{0.68} there exists a graph allowing a ((k,n)) protocol. On the other hand, we prove that for any k< 79n/156 there is no graph G allowing a ((k,n)) protocol. As a consequence there exists n_0 such that the protocols introduced by Markham and Sanders admit no threshold k when the secret is encoded on all the qubits and n>n_0

Planning assistance for the 30/20 GHz program, volume 3

The three basic experiment categories and consolidated experiments proposed by members of the Carrier Working Group are defined by category and by carrier. The three experiment categories are: (1) Possible Service (PS); (2) Possible Service and Technology (PSAT); and (3) Possible Technology (PT). Under Task 9 Western Union provided review, recommendations and critique of the NASA generated Statement of Work (SOW) defining the technical requirements governing design, launch and operation of the 30/20 GHz experimental systems

Planning assistance for the 30/20 GHz program, volume 1

Functional requirements for the 30/20 GHz communication system, planning assistance for the 30/20 GHz program, and a review of specified conceptual designs and recommendations are provided

Survival of entanglement in thermal states

We present a general sufficiency condition for the presence of multipartite entanglement in thermal states stemming from the ground state entanglement. The condition is written in terms of the ground state entanglement and the partition function and it gives transition temperatures below which entanglement is guaranteed to survive. It is flexible and can be easily adapted to consider entanglement for different splittings, as well as be weakened to allow easier calculations by approximations. Examples where the condition is calculated are given. These examples allow us to characterize a minimum gapping behavior for the survival of entanglement in the thermodynamic limit. Further, the same technique can be used to find noise thresholds in the generation of useful resource states for one-way quantum computing.Comment: 6 pages, 2 figures. Changes made in line with publication recommendations. Motivation and concequences of result clarified, with the addition of one more example, which applies the result to give noise thresholds for measurement based quantum computing. New author added with new result

Incorporating spatial correlations into multispecies mean-field models

In biology, we frequently observe different species existing within the same environment. For example, there are many cell types in a tumour, or different animal species may occupy a given habitat. In modeling interactions between such species, we often make use of the mean-field approximation, whereby spatial correlations between the locations of individuals are neglected. Whilst this approximation holds in certain situations, this is not always the case, and care must be taken to ensure the mean-field approximation is only used in appropriate settings. In circumstances where the mean-field approximation is unsuitable, we need to include information on the spatial distributions of individuals, which is not a simple task. In this paper, we provide a method that overcomes many of the failures of the mean-field approximation for an on-lattice volume-excluding birth-death-movement process with multiple species. We explicitly take into account spatial information on the distribution of individuals by including partial differential equation descriptions of lattice site occupancy correlations. We demonstrate how to derive these equations for the multispecies case and show results specific to a two-species problem. We compare averaged discrete results to both the mean-field approximation and our improved method, which incorporates spatial correlations. We note that the mean-field approximation fails dramatically in some cases, predicting very different behavior from that seen upon averaging multiple realizations of the discrete system. In contrast, our improved method provides excellent agreement with the averaged discrete behavior in all cases, thus providing a more reliable modeling framework. Furthermore, our method is tractable as the resulting partial differential equations can be solved efficiently using standard numerical techniques

Which graph states are useful for quantum information processing?

Graph states are an elegant and powerful quantum resource for measurement based quantum computation (MBQC). They are also used for many quantum protocols (error correction, secret sharing, etc.). The main focus of this paper is to provide a structural characterisation of the graph states that can be used for quantum information processing. The existence of a gflow (generalized flow) is known to be a requirement for open graphs (graph, input set and output set) to perform uniformly and strongly deterministic computations. We weaken the gflow conditions to define two new more general kinds of MBQC: uniform equiprobability and constant probability. These classes can be useful from a cryptographic and information point of view because even though we cannot do a deterministic computation in general we can preserve the information and transfer it perfectly from the inputs to the outputs. We derive simple graph characterisations for these classes and prove that the deterministic and uniform equiprobability classes collapse when the cardinalities of inputs and outputs are the same. We also prove the reversibility of gflow in that case. The new graphical characterisations allow us to go from open graphs to graphs in general and to consider this question: given a graph with no inputs or outputs fixed, which vertices can be chosen as input and output for quantum information processing? We present a characterisation of the sets of possible inputs and ouputs for the equiprobability class, which is also valid for deterministic computations with inputs and ouputs of the same cardinality.Comment: 13 pages, 2 figure

Properties of implanted and CVD incorporated nitrogen-vacancy centers: preferential charge state and preferential orientation

The combination of the long electron state spin coherence time and the optical coupling of the ground electronic states to an excited state manifold makes the nitrogen-vacancy (NV) center in diamond an attractive candidate for quantum information processing. To date the best spin and optical properties have been found in centers deep within the diamond crystal. For useful devices it will be necessary to engineer NVs with similar properties close to the diamond surface. We report on properties including charge state control and preferential orientation for near surface NVs formed either in CVD growth or through implantation and annealing