Abstract
A circuit-simulation-based method is used to determine the thermally-induced bit error rate of superconducting Single Flux Quantum logic circuits. Simulations are used to evaluate the multidimensional Gaussian integral across noise current sources attached to the active devices. The method is data-assisted and has predictive power. Measurement determines the value of a single parameter, effective noise bandwidth, for each error mechanism. The errors in the distributed networks of comparator-free Reciprocal Quantum Logic nucleate across multiple Josephson junctions, so the effective critical current is about three times that of the individual devices. The effective noise bandwidth is only 6%–23% of the junction plasma frequency at a modest clock rate of 3.4 GHz, which is 1% of the plasma frequency. This analysis shows the ways measured bit error rate comes out so much lower than simplistic estimates based on isolated devices.
Reasonable quantification of uncertainty is a major issue of cognitive infocommunications, and logic is a backbone for successful communication. Here, an axiomatic approach to quantum logic, which highlights similarity to and differences to classical logic, is presented. The axiomatic method ensures that applications are not restricted to quantum physics. Based on this, algorithms are developed that assign to an incoming signal a similarity measure to a pattern generated by a set of training signals.
This paper introduces some new concepts of rough approximations via five quantum implications satisfying Birkhoff–von Neumann condition. We first establish rough approximations via Sasaki implication and show the equivalence between distributivity of multiplication over join and some properties of rough approximations. We further establish rough approximations via other four quantum implication and examine their properties.
A quantum gate or quantum logic gate is an elementary quantum circuit working on a small number of qubits. It means that quantum gates can grasp two primary feature of quantum mechanics that are entirely out of reach for classical gates : superposition and entanglement. In simpler words quantum gates are reversible. In classical computing sets of logic gates are connected to construct digital circuits. Similarly, quantum logic gates operates on input states that are generally in superposition states to compute the output. In this paper the authors will discuss in detail what is single and multiple qubit gates and scope and challenges in quantum gates.
It is shown that well-known logical paradoxes such as Barber paradox can be interpreted differently in non-classical logic systems such as multi-valued, continuous and quantum logic with possibility of solutions of the paradox. The results of this research can have applications in investigations of completeness of logic systems.
In this study, new sequent calculi for a minimal quantum logic (\(\bf MQL\)) are discussed that involve an implication. The sequent calculus \(\bf GO\) for \(\bf MQL\) was established by Nishimura, and it is complete with respect to ortho-models (O-models). As \(\bf GO\) does not contain implications, this study adopts the strict implication and constructs two new sequent calculi \(\mathbf{GOI}_1\) and \(\mathbf{GOI}_2\) as the expansions of \(\bf GO\). Both \(\mathbf{GOI}_1\) and \(\mathbf{GOI}_2\) are complete with respect to the O-models. In this study, the completeness and decidability theorems for these new systems are proven. Furthermore, some details pertaining to new rules and the strict implication are discussed.
Measurement and data-assisted simulation of bit error rate in RQL circuits
