Preliminary design of a supersonic cruise aircraft high-pressure turbine

Development of the supersonic cruise aircraft engine continued in this National Aeronautics and Space Administration (NASA) sponsored Pratt and Whitney program for the Preliminary Design of an Advanced High-Pressure Turbine. Airfoil cooling concepts and the technology required to implement these concepts received particular emphasis. Previous supersonic cruise aircraft mission studies were reviewed and the Variable Stream Control Engine (VSCE) was chosen as the candidate or the preliminary turbine design. The design was evaluated for the supersonic cruise mission. The advanced technology to be generated from these designs showed benefits in the supersonic cruise application and subsonic cruise application. The preliminary design incorporates advanced single crystal materials, thermal barrier coatings, and oxidation resistant coatings for both the vane and blade. The 1990 technology vane and blade designs have cooled turbine efficiency of 92.3 percent, 8.05 percent Wae cooling and a 10,000 hour life. An alternate design with 1986 technology has 91.9 percent efficiency and 12.43 percent Wae cooling at the same life. To achieve these performance and life results, technology programs must be pursued to provide the 1990's technology assumed for this study

List decoding of noisy Reed-Muller-like codes

First- and second-order Reed-Muller (RM(1) and RM(2), respectively) codes are two fundamental error-correcting codes which arise in communication as well as in probabilistically-checkable proofs and learning. In this paper, we take the first steps toward extending the quick randomized decoding tools of RM(1) into the realm of quadratic binary and, equivalently, Z_4 codes. Our main algorithmic result is an extension of the RM(1) techniques from Goldreich-Levin and Kushilevitz-Mansour algorithms to the Hankel code, a code between RM(1) and RM(2). That is, given signal s of length N, we find a list that is a superset of all Hankel codewords phi with dot product to s at least (1/sqrt(k)) times the norm of s, in time polynomial in k and log(N). We also give a new and simple formulation of a known Kerdock code as a subcode of the Hankel code. As a corollary, we can list-decode Kerdock, too. Also, we get a quick algorithm for finding a sparse Kerdock approximation. That is, for k small compared with 1/sqrt{N} and for epsilon > 0, we find, in time polynomial in (k log(N)/epsilon), a k-Kerdock-term approximation s~ to s with Euclidean error at most the factor (1+epsilon+O(k^2/sqrt{N})) times that of the best such approximation

An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups

Extraspecial groups form a remarkable subclass of p-groups. They are also present in quantum information theory, in particular in quantum error correction. We give here a polynomial time quantum algorithm for finding hidden subgroups in extraspecial groups. Our approach is quite different from the recent algorithms presented in [17] and [2] for the Heisenberg group, the extraspecial p-group of size p3 and exponent p. Exploiting certain nice automorphisms of the extraspecial groups we define specific group actions which are used to reduce the problem to hidden subgroup instances in abelian groups that can be dealt with directly.Comment: 10 page

Experimental quantum coding against photon loss error

A significant obstacle for practical quantum computation is the loss of physical qubits in quantum computers, a decoherence mechanism most notably in optical systems. Here we experimentally demonstrate, both in the quantum circuit model and in the one-way quantum computer model, the smallest non-trivial quantum codes to tackle this problem. In the experiment, we encode single-qubit input states into highly-entangled multiparticle codewords, and we test their ability to protect encoded quantum information from detected one-qubit loss error. Our results prove the in-principle feasibility of overcoming the qubit loss error by quantum codes.Comment: "Quantum Computing even when Photons Go AWOL". published versio

Effects of noise on quantum error correction algorithms

It has recently been shown that there are efficient algorithms for quantum computers to solve certain problems, such as prime factorization, which are intractable to date on classical computers. The chances for practical implementation, however, are limited by decoherence, in which the effect of an external environment causes random errors in the quantum calculation. To combat this problem, quantum error correction schemes have been proposed, in which a single quantum bit (qubit) is ``encoded'' as a state of some larger number of qubits, chosen to resist particular types of errors. Most such schemes are vulnerable, however, to errors in the encoding and decoding itself. We examine two such schemes, in which a single qubit is encoded in a state of $n$ qubits while subject to dephasing or to arbitrary isotropic noise. Using both analytical and numerical calculations, we argue that error correction remains beneficial in the presence of weak noise, and that there is an optimal time between error correction steps, determined by the strength of the interaction with the environment and the parameters set by the encoding.Comment: 26 pages, LaTeX, 4 PS figures embedded. Reprints available from the authors or http://eve.physics.ox.ac.uk/QChome.htm

Correcting the effects of spontaneous emission on cold trapped ions

We propose two quantum error correction schemes which increase the maximum storage time for qubits in a system of cold trapped ions, using a minimal number of ancillary qubits. Both schemes consider only the errors introduced by the decoherence due to spontaneous emission from the upper levels of the ions. Continuous monitoring of the ion fluorescence is used in conjunction with selective coherent feedback to eliminate these errors immediately following spontaneous emission events, and the conditional time evolution between quantum jumps is removed by symmetrizing the quantum codewords.Comment: 19 pages; 2 figures; RevTex; The quantum codewords are extended to achieve invariance under the conditional time evolution between jump

Limits to error correction in quantum chaos

We study the correction of errors that have accumulated in an entangled state of spins as a result of unknown local variations in the Zeeman energy (B) and spin-spin interaction energy (J). A non-degenerate code with error rate kappa can recover the original state with high fidelity within a time kappa^1/2 / max(B,J) -- independent of the number of encoded qubits. Whether the Hamiltonian is chaotic or not does not affect this time scale, but it does affect the complexity of the error-correcting code.Comment: 4 pages including 1 figur

How to correct small quantum errors

The theory of quantum error correction is a cornerstone of quantum information processing. It shows that quantum data can be protected against decoherence effects, which otherwise would render many of the new quantum applications practically impossible. In this paper we give a self contained introduction to this theory and to the closely related concept of quantum channel capacities. We show, in particular, that it is possible (using appropriate error correcting schemes) to send a non-vanishing amount of quantum data undisturbed (in a certain asymptotic sense) through a noisy quantum channel T, provided the errors produced by T are small enough.Comment: LaTeX2e, 23 pages, 6 figures (3 eps, 3 pstricks

The capacity of the noisy quantum channel

An upper limit is given to the amount of quantum information that can be transmitted reliably down a noisy, decoherent quantum channel. A class of quantum error-correcting codes is presented that allow the information transmitted to attain this limit. The result is the quantum analog of Shannon's bound and code for the noisy classical channel.Comment: 19 pages, Submitted to Science. Replaced give correct references to work of Schumacher, to add a figure and an appendix, and to correct minor mistake

Pauli Exchange Errors in Quantum Computation

In many physically realistic models of quantum computation, Pauli exchange interactions cause a subset of two-qubit errors to occur as a first order effect of couplings within the computer, even in the absence of interactions with the computer's environment. We give an explicit 9-qubit code that corrects both Pauli exchange errors and all one-qubit errors.Comment: Final version accepted for publication in Phys. Rev. Let