Approximate quantum error correction can lead to better codes

We present relaxed criteria for quantum error correction which are useful when the specific dominant noise process is known. These criteria have no classical analogue. As an example, we provide a four-bit code which corrects for a single amplitude damping error. This code violates the usual Hamming bound calculated for a Pauli description of the error process, and does not fit into the GF(4) classification.Comment: 7 pages, 2 figures, submitted to Phys. Rev.

Realization of generalized quantum searching using nuclear magnetic resonance

According to the theoretical results, the quantum searching algorithm can be generalized by replacing the Walsh-Hadamard(W-H) transform by almost any quantum mechanical operation. We have implemented the generalized algorithm using nuclear magnetic resonance techniques with a solution of chloroform molecules. Experimental results show the good agreement between theory and experiment.Comment: 11 pages,3 figure. Accepted by Phys. Rev. A. Scheduled Issue: 01 Mar 200

Fast Quantum Search Algorithms in Protein Sequence Comparison - Quantum Biocomputing

Quantum search algorithms are considered in the context of protein sequence comparison in biocomputing. Given a sample protein sequence of length m (i.e m residues), the problem considered is to find an optimal match in a large database containing N residues. Initially, Grover's quantum search algorithm is applied to a simple illustrative case - namely where the database forms a complete set of states over the 2^m basis states of a m qubit register, and thus is known to contain the exact sequence of interest. This example demonstrates explicitly the typical O(sqrt{N}) speedup on the classical O(N) requirements. An algorithm is then presented for the (more realistic) case where the database may contain repeat sequences, and may not necessarily contain an exact match to the sample sequence. In terms of minimizing the Hamming distance between the sample sequence and the database subsequences the algorithm finds an optimal alignment, in O(sqrt{N}) steps, by employing an extension of Grover's algorithm, due to Boyer, Brassard, Hoyer and Tapp for the case when the number of matches is not a priori known.Comment: LaTeX, 5 page

Realization of logically labeled effective pure states for bulk quantum computation

We report the first use of "logical labeling" to perform a quantum computation with a room-temperature bulk system. This method entails the selection of a subsystem which behaves as if it were at zero temperature - except for a decrease in signal strength - conditioned upon the state of the remaining system. No averaging over differently prepared molecules is required. In order to test this concept, we execute a quantum search algorithm in a subspace of two nuclear spins, labeled by a third spin, using solution nuclear magnetic resonance (NMR), and employing a novel choice of reference frame to uncouple nuclei.Comment: PRL 83, 3085 (1999). Small changes made to improve readability and remove ambiguitie

Lossless quantum data compression and variable-length coding

In order to compress quantum messages without loss of information it is necessary to allow the length of the encoded messages to vary. We develop a general framework for variable-length quantum messages in close analogy to the classical case and show that lossless compression is only possible if the message to be compressed is known to the sender. The lossless compression of an ensemble of messages is bounded from below by its von-Neumann entropy. We show that it is possible to reduce the number of qbits passing through a quantum channel even below the von-Neumann entropy by adding a classical side-channel. We give an explicit communication protocol that realizes lossless and instantaneous quantum data compression and apply it to a simple example. This protocol can be used for both online quantum communication and storage of quantum data.Comment: 16 pages, 5 figure

Relativistic Doppler effect in quantum communication

When an electromagnetic signal propagates in vacuo, a polarization detector cannot be rigorously perpendicular to the wave vector because of diffraction effects. The vacuum behaves as a noisy channel, even if the detectors are perfect. The ``noise'' can however be reduced and nearly cancelled by a relative motion of the observer toward the source. The standard definition of a reduced density matrix fails for photon polarization, because the transversality condition behaves like a superselection rule. We can however define an effective reduced density matrix which corresponds to a restricted class of positive operator-valued measures. There are no pure photon qubits, and no exactly orthogonal qubit states.Comment: 10 pages LaTe

Angular distribution of photoluminescence as a probe of Bose Condensation of trapped excitons

Recent experiments on two-dimensional exciton systems have shown the excitons collect in shallow in-plane traps. We find that Bose condensation in a trap results in a dramatic change of the exciton photoluminescence (PL) angular distribution. The long-range coherence of the condensed state gives rise to a sharply focussed peak of radiation in the direction normal to the plane. By comparing the PL profile with and without Bose Condensation we provide a simple diagnostic for the existence of a Bose condensate. The PL peak has strong temperature dependence due to the thermal order parameter phase fluctuations across the system. The angular PL distribution can also be used for imaging vortices in the trapped condensate. Vortex phase spatial variation leads to destructive interference of PL radiation in certain directions, creating nodes in the PL distribution that imprint the vortex configuration.Comment: 4 pages, 3 figure

Incomplete quantum process tomography and principle of maximal entropy

The main goal of this paper is to extend and apply the principle of maximum entropy (MaxEnt) to incomplete quantum process estimation tasks. We will define a so-called process entropy function being the von Neumann entropy of the state associated with the quantum process via Choi-Jamiolkowski isomorphism. It will be shown that an arbitrary process estimation experiment can be reformulated in a unified framework and MaxEnt principle can be consistently exploited. We will argue that the suggested choice for the process entropy satisfies natural list of properties and it reduces to the state MaxEnt principle, if applied to preparator devices.Comment: 8 pages, comments welcome, references adde

Classical model for bulk-ensemble NMR quantum computation

We present a classical model for bulk-ensemble NMR quantum computation: the quantum state of the NMR sample is described by a probability distribution over the orientations of classical tops, and quantum gates are described by classical transition probabilities. All NMR quantum computing experiments performed so far with three quantum bits can be accounted for in this classical model. After a few entangling gates, the classical model suffers an exponential decrease of the measured signal, whereas there is no corresponding decrease in the quantum description. We suggest that for small numbers of quantum bits, the quantum nature of NMR quantum computation lies in the ability to avoid an exponential signal decrease.Comment: 14 pages, no figures, revte

Validating IoT Devices with Rate-Based Session Types

We develop a session types based framework for implementing and validating rate-based message passing systems in Internet of Things (IoT) domains. To model the indefinite repetition present in many embedded and IoT systems, we introduce a timed process calculus with a periodic recursion primitive. This allows us to model rate-based computations and communications inherent to these application domains. We introduce a definition of rate based session types in a binary session types setting and a new compatibility relationship, which we call rate compatibility. Programs which type check enjoy the standard session types guarantees as well as rate error freedom --- meaning processes which exchanges messages do so at the same rate. Rate compatibility is defined through a new notion of type expansion, a relation that allows communication between processes of differing periods by synthesizing and checking a common superperiod type. We prove type preservation and rate error freedom for our system, and show a decidable method for type checking based on computing superperiods for a collection of processes. We implement a prototype of our type system including rate compatibility via an embedding into the native type system of Rust. We apply this framework to a range of examples from our target domain such as Android software sensors, wearable devices, and sound processing