نتایج جستجو برای: optical not gate

تعداد نتایج: 3184021  

2015
Tomohiro Amemiya Atsushi Ishikawa Toru Kanazawa JoonHyung Kang Nobuhiko Nishiyama Yasuyuki Miyamoto Takuo Tanaka Shigehisa Arai

Metamaterials are artificially structured materials that can produce innovative optical functionalities such as negative refractive index, invisibility cloaking, and super-resolution imaging. Combining metamaterials with semiconductors enables us to develop novel optoelectronic devices based on the new concept of operation. Here we report the first experimental demonstration of a permeability-c...

2004
Minoru Watanabe Fuminori Kobayashi

High-speed reconfigurable processors incorporating a reconfigurable memory and microprocessor array into a chip have been developed [1]. Such devices use a context-switching method. Their internal reconfigurable memory includes reconfiguration contexts of 16 banks. One bank includes a reconfiguration context used for ALUs that can be changed to others on a clock in nanoseconds. These devices ha...

Journal: :New Journal of Physics 2011

Journal: :Quantum Information Processing 2021

We propose a deterministic SWAP gate for dual-rail-encoded single photon qubits. The is constructed from waveguide crossings, Mach–Zehnder interferometers and phase shifters which provide the reconfigurability. Through manipulating of shifters, we can apply either or identity gates. As an essential element nearest neighbor qubit networks, has simple structure presents minimal overhead. Providin...

2004

The synthesis of quantum circuits is a complex problem even for circuits with a small number of lines. At present, optimal synthesis is intractable and heuristic methods must be employed. In this paper, we consider the use of templates to simplify a quantum circuit initially found by other means. The templates tool presented here is a general approach to reversible and quantum circuit simplific...

2004

We show that if a language is recognized within certain error bounds by constantdepth quantum circuits over a nite family of gates, then it is computable in (classical) polynomial time. In particular, our results imply EQNC P; where EQNC is the constant-depth analogue of the class EQP. On the other hand, we adapt and extend ideas of DiVincenzo & Terhal [?] to show that, for any family F of quan...

2009
Si-Yu Liao Cristell Maneux Vincent Pouget Sébastien Frégonèse Thomas Zimmer

Background Carbon Nanotube Field Effect Transistors (CNTFETs) have high charge sensitivity at room temperature [1]. By using this sensitivity, some nonvolatile memory devices have been demonstrated with charge trapping in SiO 2 gate insulator [2, 3]. Besides, a new design of synapse-like circuit requires a multi-level nonvolatile memory [4]. For this application, and according to its high charg...

2005
Stephen A. Fenner Frederic Green Steven Homer Yong Zhang

We show that if a language is recognized within certain error bounds by constant-depth quantum circuits over a finite family of gates, then it is computable in (classical) polynomial time. In particular, for 0 < ≤ δ ≤ 1, we define BQNC ,δ to be the class of languages recognized by constant depth, polynomial-size quantum circuits with acceptance probability either < (for rejection) or ≥ δ (for a...

2005
D. Michael Miller Dmitri Maslov

A breadth-first search method for determining optimal 3-line circuits composed of quantum NOT, CNOT, controlled-V and controlled-V + (NCV) gates is introduced. Results are presented for simple gate count and for technology motivated cost metrics. The optimal NCV circuits are also compared to NCV circuits derived from optimal NOT, CNOT and Toffoli (NCT) gate circuits. The work presented here pro...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید