1,550 research outputs found

    Waveguiding in planar photonic crystals

    Get PDF
    Photonic crystal planar circuits designed and fabricated in silicon on silicon dioxide are demonstrated. Our structures are based on two-dimensional confinement by photonic crystals in the plane of propagation, and total internal reflection to achieve confinement in the third dimension. These circuits are shown to guide light at 1550 nm around sharp corners where the radius of curvature is similar to the wavelength of light

    Towards a millivolt optical modulator with nano-slot waveguides

    Get PDF
    We describe a class of modulator design involving slot waveguides and electro-optic polymer claddings. Such geometries enable massive enhancement of index tuning when compared to more conventional geometries. We present a semi-analytic method of predicting the index tuning achievable for a given geometry and electro-optic material. Based on these studies, as well as previous experimental results, we show designs for slot waveguide modulators that, when realized in a Mach-Zehnder configuration, will allow for modulation voltages that are orders of magnitude lower than the state of the art. We also discuss experimental results for nano-slot waveguides

    Concrete resource analysis of the quantum linear system algorithm used to compute the electromagnetic scattering cross section of a 2D target

    Get PDF
    We provide a detailed estimate for the logical resource requirements of the quantum linear system algorithm (QLSA) [Phys. Rev. Lett. 103, 150502 (2009)] including the recently described elaborations [Phys. Rev. Lett. 110, 250504 (2013)]. Our resource estimates are based on the standard quantum-circuit model of quantum computation; they comprise circuit width, circuit depth, the number of qubits and ancilla qubits employed, and the overall number of elementary quantum gate operations as well as more specific gate counts for each elementary fault-tolerant gate from the standard set {X, Y, Z, H, S, T, CNOT}. To perform these estimates, we used an approach that combines manual analysis with automated estimates generated via the Quipper quantum programming language and compiler. Our estimates pertain to the example problem size N=332,020,680 beyond which, according to a crude big-O complexity comparison, QLSA is expected to run faster than the best known classical linear-system solving algorithm. For this problem size, a desired calculation accuracy 0.01 requires an approximate circuit width 340 and circuit depth of order 102510^{25} if oracle costs are excluded, and a circuit width and depth of order 10810^8 and 102910^{29}, respectively, if oracle costs are included, indicating that the commonly ignored oracle resources are considerable. In addition to providing detailed logical resource estimates, it is also the purpose of this paper to demonstrate explicitly how these impressively large numbers arise with an actual circuit implementation of a quantum algorithm. While our estimates may prove to be conservative as more efficient advanced quantum-computation techniques are developed, they nevertheless provide a valid baseline for research targeting a reduction of the resource requirements, implying that a reduction by many orders of magnitude is necessary for the algorithm to become practical.Comment: 37 pages, 40 figure
    corecore