Generating Polarization-Entangled Photon Pairs with Arbitrary Joint Spectrum

We present a scheme for generating polarization-entangled photons pairs with arbitrary joint spectrum. Specifically, we describe a technique for spontaneous parametric down-conversion in which both the center frequencies and the bandwidths of the down-converted photons may be controlled by appropriate manipulation of the pump pulse. The spectral control offered by this technique permits one to choose the operating wavelengths for each photon of a pair based on optimizations of other system parameters (loss in optical fiber, photon counter performance, etc.). The combination of spectral control, polarization control, and lack of group-velocity matching conditions makes this technique particularly well-suited for a distributed quantum information processing architecture in which integrated optical circuits are connected by spans of optical fiber.Comment: 6 pages, 3 figure

Digital demodulator

A digital demodulator for converting pulse code modulated data from phase shift key (PSK) to non return to zero (NRZ) and to biphase data is described. The demodulator is composed of standard integrated logic circuits. The key to the demodulation function is a pair of cross coupled one shot multivibrators and which with a flip-flop produce the NRZ-L is all that is required, the circuitry is greatly simplified and the 2(v) times bit rate contraint can be removed from the carrier. A flip-flop, an OR gate, and AND gate and a binary counter generate the bit rate clock (BTCK) for the NRZ-L. The remainder of the circuitry is for converting the NRZ-L and BTCK into biphase data. The device was designed for use in the space shuttle bay environment measurements

Three-dimensional laser velocimeter simultaneity detector

A three-dimensional laser Doppler velocimeter has laser optics for a first channel positioned to create a probe volume in space, and laser optics and for second and third channels, respectively, positioned to create entirely overlapping probe volumes in space. The probe volumes and overlap partially in space. The photodetector is positioned to receive light scattered by a particle present in the probe volume, while photodetectors and are positioned to receive light scattered by a particle present in the probe volume. The photodetector for the first channel is directly connected to provide a first channel analog signal to frequency measuring circuits. The first channel is therefore a primary channel for the system. Photodetectors and are respectively connected through a second channel analog signal attenuator to frequency measuring circuits and through a third channel analog signal attenuator to frequency measuring circuits. The second and third channels are secondary channels, with the second and third channels analog signal attenuators and controlled by the first channel measurement burst signal on line. The second and third channels analog signal attenuators and attenuate the second and third channels analog signals only when the measurement burst signal is false

Power of Quantum Computation with Few Clean Qubits

This paper investigates the power of polynomial-time quantum computation in which only a very limited number of qubits are initially clean in the |0> state, and all the remaining qubits are initially in the totally mixed state. No initializations of qubits are allowed during the computation, nor intermediate measurements. The main results of this paper are unexpectedly strong error-reducible properties of such quantum computations. It is proved that any problem solvable by a polynomial-time quantum computation with one-sided bounded error that uses logarithmically many clean qubits can also be solvable with exponentially small one-sided error using just two clean qubits, and with polynomially small one-sided error using just one clean qubit. It is further proved in the case of two-sided bounded error that any problem solvable by such a computation with a constant gap between completeness and soundness using logarithmically many clean qubits can also be solvable with exponentially small two-sided error using just two clean qubits. If only one clean qubit is available, the problem is again still solvable with exponentially small error in one of the completeness and soundness and polynomially small error in the other. As an immediate consequence of the above result for the two-sided-error case, it follows that the TRACE ESTIMATION problem defined with fixed constant threshold parameters is complete for the classes of problems solvable by polynomial-time quantum computations with completeness 2/3 and soundness 1/3 using logarithmically many clean qubits and just one clean qubit. The techniques used for proving the error-reduction results may be of independent interest in themselves, and one of the technical tools can also be used to show the hardness of weak classical simulations of one-clean-qubit computations (i.e., DQC1 computations).Comment: 44 pages + cover page; the results in Section 8 are overlapping with the main results in arXiv:1409.677