p-topological and p-regular: dual notions in convergence theory

The natural duality between "topological" and "regular," both considered as convergence space properties, extends naturally to p-regular convergence spaces, resulting in the new concept of a p-topological convergence space. Taking advantage of this duality, the behavior of p-topological and p-regular convergence spaces is explored, with particular emphasis on the former, since they have not been previously studied. Their study leads to the new notion of a neighborhood operator for filters, which in turn leads to an especially simple characterization of a topology in terms of convergence criteria. Applications include the topological and regularity series of a convergence space.Comment: 12 pages in Acrobat 3.0 PDF forma

Study of EVA operations associated with satellite services

Extravehicular mobility unit (EMU) factors associated with satellite servicing activities are identified and the EMU improvements necessary to enhance satellite servicing operations are outlined. Areas of EMU capabilities, equipment and structural interfaces, time lines, EMU modifications for satellite servicing, environmental hazards, and crew training are vital to manned Eva/satellite services and as such are detailed. Evaluation of EMU capabilities indicates that the EMU can be used in performing near term, basic satellite servicing tasks; however, satellite servicing is greatly enhanced by incorporating key modifications into the EMU. The servicing missions involved in contamination sensitive payload repair are illustrated. EVA procedures and equipment can be standardized, reducing both crew training time and in orbit operations time. By standardizing and coordinating procedures, mission cumulative time lines fall well within the EMU capability

Advanced Computation Research

Contains reports on one research project.Computation Center, M.I.T

An integral equation method for a boundary value problem arising in unsteady water wave problems

In this paper we consider the 2D Dirichlet boundary value problem for Laplace’s equation in a non-locally perturbed half-plane, with data in the space of bounded and continuous functions. We show uniqueness of solution, using standard Phragmen-Lindelof arguments. The main result is to propose a boundary integral equation formulation, to prove equivalence with the boundary value problem, and to show that the integral equation is well posed by applying a recent partial generalisation of the Fredholm alternative in Arens et al [J. Int. Equ. Appl. 15 (2003) pp. 1-35]. This then leads to an existence proof for the boundary value problem. Keywords. Boundary integral equation method, Water waves, Laplace’

Study of contamination of liquid oxygen by gaseous nitrogen First quarterly report, 1 Jul. - 30 Sep. 1964

Analytical model development for contamination study of liquid oxygen by gaseous nitroge

Encoding One Logical Qubit Into Six Physical Qubits

We discuss two methods to encode one qubit into six physical qubits. Each of our two examples corrects an arbitrary single-qubit error. Our first example is a degenerate six-qubit quantum error-correcting code. We explicitly provide the stabilizer generators, encoding circuit, codewords, logical Pauli operators, and logical CNOT operator for this code. We also show how to convert this code into a non-trivial subsystem code that saturates the subsystem Singleton bound. We then prove that a six-qubit code without entanglement assistance cannot simultaneously possess a Calderbank-Shor-Steane (CSS) stabilizer and correct an arbitrary single-qubit error. A corollary of this result is that the Steane seven-qubit code is the smallest single-error correcting CSS code. Our second example is the construction of a non-degenerate six-qubit CSS entanglement-assisted code. This code uses one bit of entanglement (an ebit) shared between the sender and the receiver and corrects an arbitrary single-qubit error. The code we obtain is globally equivalent to the Steane seven-qubit code and thus corrects an arbitrary error on the receiver's half of the ebit as well. We prove that this code is the smallest code with a CSS structure that uses only one ebit and corrects an arbitrary single-qubit error on the sender's side. We discuss the advantages and disadvantages for each of the two codes.Comment: 13 pages, 3 figures, 4 table

Long-Range Plasmon Assisted Energy Transfer Between Fluorescent Emitters

We demonstrate plasmon assisted energy transfer between fluorophores located at distances up to $7 \, \mu$m on the top of a thin silver film. Thanks to the strong confinement and large propagation length of surface plasmon polaritons, the range of the energy transfer is almost two orders of magnitude larger than the values reported in the literature so far. The parameters driving the energy transfer range are thoroughly characterized and are in very good agreement with theoretically expected values.Comment: 5 pages, 4 figures, accepted for publication in Physical Review Letter

Development of integrated thermionic circuits for high-temperature applications

Integrated thermionic circuits (ITC) capable of extended operation in ambient temperatures up to 500 C are studied. A set of practical design and performance equations is demonstrated. Experimental results are discussed in which both devices and simple circuits were successfully operated in 5000 C environments for extended periods. It is suggested that ITC's may become an important technology for high temperature instrumentation and control systems in geothermal and other high temperature environments

Minimal-memory realization of pearl-necklace encoders of general quantum convolutional codes

Quantum convolutional codes, like their classical counterparts, promise to offer higher error correction performance than block codes of equivalent encoding complexity, and are expected to find important applications in reliable quantum communication where a continuous stream of qubits is transmitted. Grassl and Roetteler devised an algorithm to encode a quantum convolutional code with a "pearl-necklace encoder." Despite their theoretical significance as a neat way of representing quantum convolutional codes, they are not well-suited to practical realization. In fact, there is no straightforward way to implement any given pearl-necklace structure. This paper closes the gap between theoretical representation and practical implementation. In our previous work, we presented an efficient algorithm for finding a minimal-memory realization of a pearl-necklace encoder for Calderbank-Shor-Steane (CSS) convolutional codes. This work extends our previous work and presents an algorithm for turning a pearl-necklace encoder for a general (non-CSS) quantum convolutional code into a realizable quantum convolutional encoder. We show that a minimal-memory realization depends on the commutativity relations between the gate strings in the pearl-necklace encoder. We find a realization by means of a weighted graph which details the non-commutative paths through the pearl-necklace. The weight of the longest path in this graph is equal to the minimal amount of memory needed to implement the encoder. The algorithm has a polynomial-time complexity in the number of gate strings in the pearl-necklace encoder.Comment: 16 pages, 5 figures; extends paper arXiv:1004.5179v

Addressing the clumsiness loophole in a Leggett-Garg test of macrorealism

The rise of quantum information theory has lent new relevance to experimental tests for non-classicality, particularly in controversial cases such as adiabatic quantum computing superconducting circuits. The Leggett-Garg inequality is a "Bell inequality in time" designed to indicate whether a single quantum system behaves in a macrorealistic fashion. Unfortunately, a violation of the inequality can only show that the system is either (i) non-macrorealistic or (ii) macrorealistic but subjected to a measurement technique that happens to disturb the system. The "clumsiness" loophole (ii) provides reliable refuge for the stubborn macrorealist, who can invoke it to brand recent experimental and theoretical work on the Leggett-Garg test inconclusive. Here, we present a revised Leggett-Garg protocol that permits one to conclude that a system is either (i) non-macrorealistic or (ii) macrorealistic but with the property that two seemingly non-invasive measurements can somehow collude and strongly disturb the system. By providing an explicit check of the invasiveness of the measurements, the protocol replaces the clumsiness loophole with a significantly smaller "collusion" loophole.Comment: 7 pages, 3 figure