Entanglement without nonlocality

We consider the characterization of entanglement from the perspective of a Heisenberg formalism. We derive an original two-party generalized separability criteria, and from this describe a novel physical understanding of entanglement. We find that entanglement may be considered as fundamentally a local effect, and therefore as a separable computational resource from nonlocality. We show how entanglement differs from correlation physically, and explore the implications of this new conception of entanglement for the notion of classicality. We find that this understanding of entanglement extends naturally to multipartite cases.Comment: 9 pages. Expanded introduction and sections on physical entanglement and localit

Information-flux approach to multiple-spin dynamics

We introduce and formalize the concept of information flux in a many-body register as the influence that the dynamics of a specific element receive from any other element of the register. By quantifying the information flux in a protocol, we can design the most appropriate initial state of the system and, noticeably, the distribution of coupling strengths among the parts of the register itself. The intuitive nature of this tool and its flexibility, which allow for easily manageable numerical approaches when analytic expressions are not straightforward, are greatly useful in interacting many-body systems such as quantum spin chains. We illustrate the use of this concept in quantum cloning and quantum state transfer and we also sketch its extension to non-unitary dynamics.Comment: 7 pages, 4 figures, RevTeX

Generalised Compositional Theories and Diagrammatic Reasoning

This chapter provides an introduction to the use of diagrammatic language, or perhaps more accurately, diagrammatic calculus, in quantum information and quantum foundations. We illustrate the use of diagrammatic calculus in one particular case, namely the study of complementarity and non-locality, two fundamental concepts of quantum theory whose relationship we explore in later part of this chapter. The diagrammatic calculus that we are concerned with here is not merely an illustrative tool, but it has both (i) a conceptual physical backbone, which allows it to act as a foundation for diverse physical theories, and (ii) a genuine mathematical underpinning, permitting one to relate it to standard mathematical structures.Comment: To appear as a Springer book chapter chapter, edited by G. Chirabella, R. Spekken

Quantum picturalism for topological cluster-state computing

Topological quantum computing is a way of allowing precise quantum computations to run on noisy and imperfect hardware. One implementation uses surface codes created by forming defects in a highly-entangled cluster state. Such a method of computing is a leading candidate for large-scale quantum computing. However, there has been a lack of sufficiently powerful high-level languages to describe computing in this form without resorting to single-qubit operations, which quickly become prohibitively complex as the system size increases. In this paper we apply the category-theoretic work of Abramsky and Coecke to the topological cluster-state model of quantum computing to give a high-level graphical language that enables direct translation between quantum processes and physical patterns of measurement in a computer - a "compiler language". We give the equivalence between the graphical and topological information flows, and show the applicable rewrite algebra for this computing model. We show that this gives us a native graphical language for the design and analysis of topological quantum algorithms, and finish by discussing the possibilities for automating this process on a large scale.Comment: 18 pages, 21 figures. Published in New J. Phys. special issue on topological quantum computin

Hypoxia in human soft tissue sarcomas: Adverse impact on survival and no association with p53 mutations

Clinical and experimental studies have suggested that tumour hypoxia is associated with poor treatment outcome and that loss of apoptotic potential may play a role in malignant progression of neoplastic cells. The tumour suppressor gene p53 induces apoptosis under certain conditions and microenvironmental tumour hypoxia may select for mutant tumour cells with diminished apoptotic potential due to lack of p53 function. The aim of this study was to evaluate the prognostic relevance of oxygenation status for treatment outcome and to compare pre-treatment tumour oxygenation measurements were done in 31 of those by PCR using DNA extracted from paraffin-embaedded sections (n = 2) or frozen biopsies (n = 29). The overall median of the tumour median pO 2 was 19 mmHg (range 1–58 mmHg). Only 6 tumours had functional p53 mutations and no association was found between mutant p53 and tumour hypoxia. Five out of 6 STS with lower histopathological grade were well-oxygenated whereas high-grade STS were both hypoxic and well-oxygenated. At a median follow-up of 74 months, 16 patients were still alive among 28 available for survival analysis. When stratifying into hypoxic and well-oxygenated tumours patients with the most hypoxic tumours has a statistically poorer disease-specific and overall survival at 5 years. In conclusion hypoxia was an indicator for both a poorer disease specific and overall survival in human STS but hypoxic tumours were not characterized by mutations in the p53 gene. © 2001 Cancer Research Campaign http://www.bjcancer.co

Co-designing the computational model and the computing substrate

Given a proposed unconventional computing substrate, we can ask: Does it actually compute? If so, how well does it compute? Can it be made to compute better? Given a proposed unconventional computational model we can ask: How powerful is the model? Can it be implemented in a substrate? How faithfully or efficiently can it be implemented? Given complete freedom in the choice of model and substrate, we can ask: Can we co-design a model and substrate to work well together? Here I propose an approach to posing and answering these questions, building on an existing definition of physical computing and framework for characterising the computing properties of given substrates

ImmunoGlobulin galaxy (IGGalaxy) for simple determination and quantitation of immunoglobulin heavy chain rearrangements from NGS

Background: Sequence analysis of immunoglobulin heavy chain (IGH) gene rearrangements and frequency analysis is a powerful tool for studying the immune repertoire, immune responses and immune dysregulation in health and disease. The challenge is to provide user friendly, secure and reproducible analytical services that are available for both small and large laboratories which are determining VDJ repertoire using NGS technology. Results: In this study we describe ImmunoGlobulin Galaxy (IGGalaxy)- a convenient web based application for analyzing next-generation sequencing results and reporting IGH gene rearrangements for both repertoire and clonality studies. IGGalaxy has two analysis options one using the built in igBLAST algorithm and the second using output from IMGT; in either case repertoire summaries for the B-cell populations tested are available. IGGalaxy supports multi-sample and multi-replicate input analysis for both igBLAST and IMGT/HIGHV-QUEST. We demonstrate the technical validity of this platform using a standard dataset, S22, used for benchmarking the performance of antibody alignment utilities with a 99.9 % concordance with previous results. Re-analysis of NGS data from our samples of RAG-deficient patients demonstrated the validity and user friendliness of this tool. Conclusions: IGGalaxy provides clinical researchers with detailed insight into the repertoire of the B-cell population per individual sequenced and between control and pathogenic genomes. IGGalaxy was developed for 454 NGS results but is capable of analyzing alternative NGS data (e.g. Illumina, Ion Torrent). We demonstrate the use of a Galaxy virtual machine to determine the VDJ repertoire for reference data and from B-cells taken from immune deficient patients. IGGalaxy is available as a VM for download and use on a desktop PC or on a server