Hewlett-Packard (United Kingdom)

Linear optics with photon counting is a prominent candidate for practical quantum computing. The protocol by Knill, Laflamme, and Milburn [2001, Nature (London) 409, 46] explicitly demonstrates that efficient scalable quantum computing with single photons, linear optical elements, and projective measurements is possible. Subsequently, several improvements on this protocol have started to bridge the gap between theoretical scalability and practical implementation. The original theory and its improvements are reviewed, and a few examples of experimental two-qubit gates are given. The use of realistic components, the errors they induce in the computation, and how these errors can be corrected is discussed.

This work presents a new efficient method for fitting ellipses to scattered data. Previous algorithms either fitted general conics or were computationally expensive. By minimizing the algebraic distance subject to the constraint 4ac-b/sup 2/=1, the new method incorporates the ellipticity constraint into the normalization factor. The proposed method combines several advantages: It is ellipse-specific, so that even bad data will always return an ellipse. It can be solved naturally by a generalized eigensystem. It is extremely robust, efficient, and easy to implement.

We describe in detail the theory underpinning the measurement of density matrices of a pair of quantum two-level systems (``qubits''). Our particular emphasis is on qubits realized by the two polarization degrees of freedom of a pair of entangled photons generated in a down-conversion experiment; however, the discussion applies in general, regardless of the actual physical realization. Two techniques are discussed, namely, a tomographic reconstruction (in which the density matrix is linearly related to a set of measured quantities) and a maximum likelihood technique which requires numerical optimization (but has the advantage of producing density matrices that are always non-negative definite). In addition, a detailed error analysis is presented, allowing errors in quantities derived from the density matrix, such as the entropy or entanglement of formation, to be estimated. Examples based on down-conversion experiments are used to illustrate our results.

Quantum key distribution is widely thought to offer unconditional security in communication between two users. Unfortunately, a widely accepted proof of its security in the presence of source, device, and channel noises has been missing. This long-standing problem is solved here by showing that, given fault-tolerant quantum computers, quantum key distribution over an arbitrarily long distance of a realistic noisy channel can be made unconditionally secure. The proof is reduced from a noisy quantum scheme to a noiseless quantum scheme and then from a noiseless quantum scheme to a noiseless classical scheme, which can then be tackled by classical probability theory.

In the past few years elliptic curve cryptography has moved from a fringe activity to a major challenger to the dominant RSA/DSA systems. Elliptic curves offer major advances on older systems such as increased speed, less memory and smaller key sizes. As digital signatures become more and more important in the commercial world the use of elliptic curve-based signatures will become all pervasive. This book summarizes knowledge built up within Hewlett-Packard over a number of years, and explains the mathematics behind practical implementations of elliptic curve systems. Due to the advanced nature of the mathematics there is a high barrier to entry for individuals and companies to this technology. Hence this book will be invaluable not only to mathematicians wanting to see how pure mathematics can be applied but also to engineers and computer scientists wishing (or needing) to actually implement such systems.

We report on a quantum optical experimental implementation of teleportation of unknown pure quantum states. This realizes all of the nonlocal aspects of the original scheme proposed by Bennett et al. and is equivalent to it up to a local operation. We exhibit results for the teleportation of a linearly polarized state and of an elliptically polarized state. We show that the experimental results cannot be explained in terms of a classical channel alone. The Bell measurement in our experiment can distinguish between all four Bell states simultaneously allowing, in the ideal case, a 100% success rate of teleportation.

We investigate the concept of quantum secret sharing. In a $(k,n)$ threshold scheme, a secret quantum state is divided into $n$ shares such that any $k$ of those shares can be used to reconstruct the secret, but any set of $k\ensuremath{-}1$ or fewer shares contains absolutely no information about the secret. We show that the only constraint on the existence of threshold schemes comes from the quantum ``no-cloning theorem,'' which requires that $n<2k$, and we give efficient constructions of all threshold schemes. We also show that, for $k\ensuremath{\le}n<2k\ensuremath{-}1$, then any $(k,n)$ threshold scheme must distribute information that is globally in a mixed state.

The cloud is migrating to the edge of the network, where routers themselves may become the virtualisation infrastructure, in an evolution labelled as "the fog". However, many other complementary technologies are reaching a high level of maturity. Their interplay may dramatically shift the information and communication technology landscape in the following years, bringing separate technologies into a common ground. This paper offers a comprehensive definition of the fog, comprehending technologies as diverse as cloud, sensor networks, peer-to-peer networks, network virtualisation functions or configuration management techniques. We highlight the main challenges faced by this potentially breakthrough technology amalgamation.

We present a range of coding schemes for OFDM transmission using binary, quaternary, octary, and higher order modulation that give high code rates for moderate numbers of carriers. These schemes have tightly bounded peak-to-mean envelope power ratio (PMEPR) and simultaneously have good error correction capability. The key theoretical result is a previously unrecognized connection between Golay complementary sequences and second-order Reed-Muller codes over alphabets Z/sub 2/h. We obtain additional flexibility in trading off code rate, PMEPR, and error correction capability by partitioning the second-order Reed-Muller code into cosets such that codewords with large values of PMEPR are isolated. For all the proposed schemes we show that encoding is straightforward and give an efficient decoding algorithm involving multiple fast Hadamard transforms. Since the coding schemes are all based on the same formal generator matrix we can deal adaptively with varying channel constraints and evolving system requirements.

We develop a novel approach to Bell inequalities based on a constraint that the correlations exhibited by local variable theories must satisfy. This is used to construct a family of Bell inequalities for bipartite quantum systems of arbitrarily high dimensionality which are strongly resistant to noise. In particular, our work gives an analytic description of previous numerical results and generalizes them to arbitrarily high dimensionality.

Cloud computing is a disruptive technology with profound implications not only for Internet services but also for the IT sector as a whole. Its emergence promises to streamline the on-demand provisioning of software, hardware, and data as a service, achieving economies of scale in IT solutions' deployment and operation. This issue's articles tackle topics including architecture and management of cloud computing infrastructures, SaaS and IaaS applications, discovery of services and data in cloud computing infrastructures, and cross-platform interoperability. Still, several outstanding issues exist, particularly related to SLAs, security and privacy, and power efficiency. Other open issues include ownership, data transfer bottlenecks, performance unpredictability, reliability, and software licensing issues. Finally, hosted applications' business models must show a clear pathway to monetizing cloud computing. Several companies have already built Internet consumer services such as search, social networking, Web email, and online commerce that use cloud computing infrastructure. Above all, cloud computing's still unknown "killer application" will determine many of the challenges and the solutions we must develop to make this technology work in practice.

From the Publisher: Over the past thirty years, many people have proclaimed the imminent arrival of the paperless office. Yet even the World Wide Web, which allows almost any computer to read and display another computer's documents, has only increased the amount of printing done by computer users. The use of e-mail in an organization increases paper consumption by an average of 40 percent. In The Myth of the Paperless Office, Abigail Sellen and Richard Harper study paper usage as a way to understand the work that people do and the reasons they do it the way they do. Using the tools of enthnography and cognitive psychology, they look at paper use from the level of the individual up to that of organizational culture. Central to Sellen and Harper's investigation is the concept of -- the activities that an object allows, or affords. The physical properties of paper (its being thin, light, porous, opaque, and flexible) afford the human actions of grasping, carrying, folding, writing, and so on. The concept of affordance allows us to compare the affordances of paper with those of existing digital devices. We can then ask what kinds of devices or systems would make new kinds of activities possible or better support current activities. The authors argue that paper will continue to play an important role in office life. Rather than pursue the ideal of the paperless office, we should work toward a future in which paper and electronic document tools work in concert and organizational processes make optimal use of both.

This article describes a novel method of achieving load balancing in telecommunications networks. A simulated network models a typical distribution of calls between nodes; nodes carrying an excess of traffic can become congested, causing calls to be lost. In addition to calls, the network also supports a population of simple mobile agents with behaviors modeled on the trail-laying abilities of ants. The ants move across the network between randomly chosen pairs of nodes; as they move, they deposit simulated pheromone as a function of their distance from their source node and the congestion encountered on their journey. They select their path at each intermediate node according to the distribution of simulated pheromone at each node. Calls between nodes are routed as a function of the pheromone distributions at each intermediate node. The performance of the network is measured by the proportion of calls that are lost. The results of using ant-based control (ABC) are compared with those achieved by using fixed shortest-path routes, and also those achieved by using an alternative algorithmically based type of mobile agent previously proposed for use in network management. The ABC system is shown to result in fewer call failures than the other methods, while exhibiting many attractive features of distributed control.

We show how to construct a near deterministic CNOT gate using several single photons sources, linear optics, photon number resolving quantum nondemolition detectors, and feed forward. This gate does not require the use of massively entangled states common to other implementations and is very efficient on resources with only one ancilla photon required. The key element of this gate is nondemolition detectors that use a weak cross-Kerr nonlinearity effect to conditionally generate a phase shift on a coherent probe if a photon is present in the signal mode. These potential phase shifts can then be measured using highly efficient homodyne detection.

We propose a practical, scalable, and efficient scheme for quantum computation using spatially separated matter qubits and single-photon interference effects. The qubit systems can be nitrogen-vacancy centers in diamond, Pauli-blockade quantum dots with an excess electron, or trapped ions with optical transitions, which are each placed in a cavity and subsequently entangled using a double-heralded single-photon detection scheme. The fidelity of the resulting entanglement is extremely robust against the most important errors such as detector loss, spontaneous emission, and mismatch of cavity parameters. We demonstrate how this entangling operation can be used to efficiently generate cluster states of many qubits, which, together with single-qubit operations and readout, can be used to implement universal quantum computation. Existing experimental parameters indicate that high-fidelity clusters can be generated with a moderate constant overhead.

It is well known that measurements performed on spatially separated entangled quantum systems can give rise to correlations that are nonlocal, in the sense that a Bell inequality is violated. They cannot, however, be used for superluminal signaling. It is also known that it is possible to write down sets of ``superquantum'' correlations that are more nonlocal than is allowed by quantum mechanics, yet are still nonsignaling. Viewed as an information-theoretic resource, superquantum correlations are very powerful at reducing the amount of communication needed for distributed computational tasks. An intriguing question is why quantum mechanics does not allow these more powerful correlations. We aim to shed light on the range of quantum possibilities by placing them within a wider context. With this in mind, we investigate the set of correlations that are constrained only by the no-signaling principle. These correlations form a polytope, which contains the quantum correlations as a (proper) subset. We determine the vertices of the no-signaling polytope in the case that two observers each choose from two possible measurements with $d$ outcomes. We then consider how interconversions between different sorts of correlations may be achieved. Finally, we consider some multipartite examples.

The circumstances under which a system reaches thermal equilibrium, and how to derive this from basic dynamical laws, has been a major question from the very beginning of thermodynamics and statistical mechanics. Despite considerable progress, it remains an open problem. Motivated by this issue, we address the more general question of equilibration. We prove, with virtually full generality, that reaching equilibrium is a universal property of quantum systems: almost any subsystem in interaction with a large enough bath will reach an equilibrium state and remain close to it for almost all times. We also prove several general results about other aspects of thermalization besides equilibration, for example, that the equilibrium state does not depend on the detailed microstate of the bath.

We give an operational definition of the quantum, classical, and total amounts of correlations in a bipartite quantum state. We argue that these quantities can be defined via the amount of work (noise) that is required to erase (destroy) the correlations: for the total correlation, we have to erase completely, for the quantum correlation we have to erase until a separable state is obtained, and the classical correlation is the maximal correlation left after erasing the quantum correlations. In particular, we show that the total amount of correlations is equal to the quantum mutual information, thus providing it with a direct operational interpretation. As a by-product, we obtain a direct, operational, and elementary proof of strong subadditivity of quantum entropy.

HP Labs developed the Jena toolkit to make it easier to develop applications that use the semantic Web information model and languages. Jena is a Java application programming interface that is available as an open-source download from www.hpl.hp.com/semweb/jena-top.html.

We give a constructive proof that all mixed states of $N$ qubits in a sufficiently small neighborhood of the maximally mixed state are separable (unentangled). The construction provides an explicit representation of any such state as a mixture of product states. We give upper and lower bounds on the size of the neighborhood, which show that its extent decreases exponentially with the number of qubits. The bounds show that no entanglement appears in the physical states at any stage of present NMR experiments. Though this result raises questions about NMR quantum computation, further analysis would be necessary to assess the power of the general unitary transformations, which are indeed implemented in these experiments, in their action on separable states.