New Logic Components for Processing Complex Measurement Data

Valery I. Mandrosov

Willem Jakobus Perold

The development of a new superconducting logic family, complementary output switching logic (COSL), is described. It is described how the two main problems inhibiting superconducting operation at microwave frequencies, namely magnetic flux trapping and large variations of the nominal component values due to the fabrication process, are solved. A brief overview of the operation of the basic logic gate and the layout process is given. Measured results of the basic gates are given for frequencies up to 18 GHz. The measured results of more complex circuits, such as a code converter and a pseudo-random bit sequence generator, are also presented.

Erik I. Verriest

Jung Jun Park, Kyunghyun Baek, M S Kim +3 more

Abstract Quantum search algorithms offer a remarkable advantage of quadratic reduction in query complexity using quantum superposition principle. However, how an actual architecture may access and handle the database in a quantum superposed state has been largely unexplored so far; the quantum state of data was simply assumed to be prepared and accessed by a black-box operation—so-called oracle, even though this process, if not appropriately designed, may adversely diminish the quantum query advantage. Here, we introduce an efficient quantum data-access process, dubbed as quantum data-access machine (QDAM), and present a general architecture for quantum search algorithm. We analyze the runtime of our algorithm in view of the fault-tolerant quantum computation (FTQC) consisting of logical qubits within an effective quantum error correction code. Specifically, we introduce a measure involving two computational complexities, i.e. quantum query and T-depth complexities, which can be critical to assess performance since the logical non-Clifford gates, such as the T (i.e. π / 8 rotation) gate, are known to be costliest to implement in FTQC. Our analysis shows that for N searching data, a QDAM model exhibiting a logarithmic, i.e. O ( log N ) , growth of the T-depth complexity can be constructed. Further analysis reveals that our QDAM-embedded quantum search requires O ( N × log N ) runtime cost. Our study thus demonstrates that the quantum data search algorithm can truly speed up over classical approaches with the logarithmic T-depth QDAM as a key component.

Rajendra Kumar Bera

Wajeb Gharibi, Eugenia I. Litvinova, Vladimir I. Hahanov +1 more

"Quantum " data structures for synthesis of digital system are proposed. They are based on transactions between addressable memory components to implement any functionality. The new approach of logic function minimization for synthesis of digital systems is proposed. It is supposed to apply vector form (quantum) of description logic and sequential structures implemented into memory elements. This approach remarkably differs from the common synthesis theory of discrete devices based on truth tables of components. It is based on an opportunity of applying quantum or qubit data structures [1-5] in modern computers when doing calculating processes with the purpose of unary coding states of input, internal and output variables, and also on the technology of qubit-vectors implementation into memory elements FPGA, which realize combinational and sequential primitives. The use of quantum memory-based only models for describing digital components when computer systems design would allow us to increase yield, enhance reliability of computers, make the process of design and production of devices cheaper, and also provides human-free repairing in remote & online mode.