نتایج جستجو برای: in gates

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

2014
D. Michael Miller Mathias Soeken Rolf Drechsler

The need to consider fault tolerance in quantum circuits has led to recent work on the optimization of circuits composed of Clifford+T gates. The primary optimization objectives are to minimize the T -count (number of T gates) and the T -depth (the number of groupings of parallel T gates). These objectives arise due to the high cost of the fault tolerant implementation of the T gate compared to...

2009
John S. Hamel

Everything in the Universe is assumed to be compromised of pure reversible quantum Toffoli gates, including empty space itself. Empty space can be configured into photon or matter gates simply by swapping logic input information with these entities through the phenomenon of quantum mechanical entanglement between photons and empty space Toffoli gates. The essential difference between empty spac...

Quantum dot Cellular Automata (QCA) is one of the important nano-level technologies for implementation of both combinational and sequential systems. QCA have the potential to achieve low power dissipation and operate high speed at THZ frequencies. However large probability of occurrence fabrication defects in QCA, is a fundamental challenge to use this emerging technology. Because of these vari...

Journal: :Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 1998

Journal: :Physical review applied 2022

In advancing beyond the von Neumann architecture, nanomagnetic logic offers an attractive approach to in-memory computation by exploiting energy hierarchy of coupled nanomagnets. However, low-power operation is largely incompatible with deterministic logic, because temperature required for fast reduces coupling too much. This study overcomes that problem using local, selective plasmon-assisted ...

Journal: :Physical Review A 2002

Journal: :Nature Methods 2020

Journal: :ACM Journal on Emerging Technologies in Computing Systems 2014

2013
Jonathan A. Poritz

I describe a new formalization for computation which is similar to traditional circuit models but which depends upon the choice of a family of [semi]groups – essentially, a choice of the structure group of the universe of the computation. Choosing the symmetric groups results in the reversible version of classical computation; the unitary groups give quantum computation. Other groups can result...

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

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