scholarly journals Quantum Gates

2021 ◽  
pp. 49-57
Author(s):  
Ciaran Hughes ◽  
Joshua Isaacson ◽  
Anastasia Perry ◽  
Ranbel F. Sun ◽  
Jessica Turner
Keyword(s):  
Classical Logic ◽  
Logic Gates ◽  
Quantum Gates ◽  
Binary Representation ◽  
Link Type ◽  
Computational Operation ◽  
Classical Computer ◽  
Link Information

AbstractAs discussed in Chap. 10.1007/978-3-030-61601-4_2, information in classical computers is represented by bits. However, if the bits did not change, then the computer would remain the same forever and would not be very useful! Therefore, it is necessary to change the values of bits depending on what you want the computer to do. For example, if you want a computer to multiply the number 2 and the number 3 together to produce the number 6, then you need to put each of the numbers 2 and 3 into an 8-bit binary representation, and then have a computational operation to multiply the two 8-bit values together to produce 6. The operation of changing bits in a classical computer is performed by classical logic gates.

Quantum computational networks

1989 ◽  
Vol 425 (1868) ◽  
pp. 73-90 ◽  
Keyword(s):  
Classical Logic ◽  
Logic Gates ◽  
Logic Circuits ◽  
Quantum Gate ◽  
Quantum Gates ◽  
Single Type ◽  
Universal Quantum ◽  
Computational Property ◽  
Classical Computing ◽  
Computing Machines

The theory of quantum computational networks is the quantum generalization of the theory of logic circuits used in classical computing machines. Quantum gates are the generalization of classical logic gates. A single type of gate, the universal quantum gate, together with quantum ‘unit wires’, is adequate for constructing networks with any possible quantum computational property.

scholarly journals In situ upgrade of quantum simulators to universal computers

Quantum ◽  
2018 ◽  
Vol 2 ◽  
pp. 80 ◽  
Author(s):  
Benjamin Dive ◽  
Alexander Pitchford ◽  
Florian Mintert ◽  
Daniel Burgarth
Keyword(s):  
Optimal Control ◽  
Control Problem ◽  
Strong Evidence ◽  
Logic Gates ◽  
Quantum Systems ◽  
Quantum Computers ◽  
Quantum Simulators ◽  
Universal Quantum ◽  
Classical Computer

Quantum simulators, machines that can replicate the dynamics of quantum systems, are being built as useful devices and are seen as a stepping stone to universal quantum computers. A key difference between the two is that computers have the ability to perform the logic gates that make up algorithms. We propose a method for learning how to construct these gates efficiently by using the simulator to perform optimal control on itself. This bypasses two major problems of purely classical approaches to the control problem: the need to have an accurate model of the system, and a classical computer more powerful than the quantum one to carry out the required simulations. Strong evidence that the scheme scales polynomially in the number of qubits, for systems of up to 9 qubits with Ising interactions, is presented from numerical simulations carried out in different topologies. This suggests that this in situ approach is a practical way of upgrading quantum simulators to computers.

scholarly journals Paraconsistent Annotated Logic Algorithms Applied in Management and Control of Communication Network Routes

Sensors ◽  
2021 ◽  
Vol 21 (12) ◽  
pp. 4219
Author(s):  
João Inácio Da Silva Filho ◽  
Jair Minoro Abe ◽  
Alessandro de Lima Marreiro ◽  
Angel Antonio Gonzalez Martinez ◽  
Cláudio Rodrigo Torres ◽  
...  
Keyword(s):  
Communication Network ◽  
Communication Networks ◽  
Classical Logic ◽  
Paraconsistent Logic ◽  
Logic Gates ◽  
Main Property ◽  
Computational Method ◽  
Stream Control ◽  
Routing Management ◽  
And Control

This paper presents a computational method based on non-classical logic dedicated to routing management and information stream control in communication networks. Paraconsistent logic (PL) was used to create an algorithmic structure whose main property is to accept contradiction. Moreover, a computational structure, the denominated paraconsistent data analyzer (PDAPAL2v), was constructed to perform routing management in communication networks. Direct comparisons of PDAPAL2v with a classical logic system that simulates routing conditions were made in the laboratory. In the conventional system, the paraconsistent algorithms were considered as binary logic gates, and in the tests, the same adjustment limits of PDAPAL2v were applied. Using a database with controlled insertion of noise, we obtained an efficacy of 97% in the detection of deteriorated packets with PDAPAL2v and 72% with the conventional simulation system. Functional tests were carried out, showing that PDAPAL2v is able to assess the conditions and degradation of links and perform the analysis and correlation of various inputs and variables, even if the signals have contradictory values. From practical tests in the laboratory, the proposed method represents a new way of managing and controlling communication network routes with good performance.

scholarly journals Implementation of Quantum Gates using MATLAB

2020 ◽  
Vol 8 (5) ◽  
pp. 3693-3699
Keyword(s):  
Quantum Logic ◽  
High Performance ◽  
Low Cost ◽  
Logic Gates ◽  
Activation Function ◽  
Quantum Gates ◽  
Quantum Logic Gates ◽  
Different Types ◽  
The Cost ◽  
Effective Result

Now days we require low cost and high performance computational based applications. Quantum inspired computational device or circuit performs effective result compare to classical based devices. In the development of quantum-based devices and network needs number of quantum logic gates. Here we studied mathematical description of different types of single and multiple qubits-based quantum logic gates, the reversibility property of quantum gates also proved mathematically. We analyze the cost and effectiveness of each quantum gates has been implemented using neural network with the help of MATLAB. The cost and effectiveness of quantum gates has been analyzed with the comparison of different types of activation function.

scholarly journals Dirac four-potential tunings-based quantum transistor utilizing the Lorentz force

2012 ◽  
Vol 12 (11&12) ◽  
pp. 989-1010
Author(s):  
Agung Trisetyarso
Keyword(s):  
Electromagnetic Fields ◽  
Logic Gates ◽  
Quantum Gates ◽  
Bandgap Engineering ◽  
Cyclic Operator ◽  
One Dimensional ◽  
Quantum Logic Gates ◽  
Pauli Matrices ◽  
External Electromagnetic Fields ◽  
Cyclic Operators

We propose a mathematical model of \textit{quantum} transistor in which bandgap engineering corresponds to the tuning of Dirac potential in the complex four-vector form. The transistor consists of $n$-relativistic spin qubits moving in \textit{classical} external electromagnetic fields. It is shown that the tuning of the direction of the external electromagnetic fields generates perturbation on the potential temporally and spatially, determining the type of quantum logic gates. The theory underlying of this scheme is on the proposal of the intertwining operator for Darboux transfomations on one-dimensional Dirac equation amalgamating the \textit{vector-quantum gates duality} of Pauli matrices. Simultaneous transformation of qubit and energy can be accomplished by setting the $\{\textit{control, cyclic}\}$-operators attached on the coupling between one-qubit quantum gate: the chose of \textit{cyclic}-operator swaps the qubit and energy simultaneously, while \textit{control}-operator ensures the energy conservation.

scholarly journals Circuit for Shor's algorithm using 2n+3 qubits

2003 ◽  
Vol 3 (2) ◽  
pp. 175-185
Author(s):  
S. Beauregard
Keyword(s):  
Polynomial Time ◽  
Quantum Computer ◽  
Quantum Gates ◽  
Factorization Algorithm ◽  
Shor's Algorithm ◽  
Classical Computer

We try to minimize the number of qubits needed to factor an integer of n bits using Shor's algorithm on a quantum computer. We introduce a circuit which uses 2n+3 qubits and O(n^3 lg(n)) elementary quantum gates in a depth of O(n^3) to implement the factorization algorithm. The circuit is computable in polynomial time on a classical computer and is completely general as it does not rely on any property of the number to be factored.

scholarly journals METHOD FOR IMPLEMENTATION OF UNIVERSAL QUANTUM LOGIC GATES IN A SCALABLE ISING SPIN QUANTUM COMPUTER

2003 ◽  
Vol 01 (01) ◽  
pp. 51-77 ◽  
Author(s):  
G. P. BERMAN ◽  
D. I. KAMENEV ◽  
R. B. KASSMAN ◽  
C. PINEDA ◽  
V. I. TSIFRINOVICH
Keyword(s):  
Radio Frequency ◽  
Quantum Computer ◽  
Logic Gates ◽  
Quantum States ◽  
Quantum Gates ◽  
Quantum Logic Gates ◽  
Ising Spin ◽  
Spin Quantum ◽  
Universal Quantum ◽  
Radio Frequency Pulses

We present protocols for implementation of universal quantum gates on an arbitrary superposition of quantum states in a scalable solid-state Ising spin quantum computer. The spin chain is composed of identical spins 1/2 with the Ising interaction between the neighboring spins. The selective excitations of the spins are provided by the gradient of the external magnetic field. The protocols are built of rectangular radio-frequency pulses. Since the wavelength of the radio-frequency pulses is much larger than the distance between the spins, each pulse affects all spins in the chain and introduces the phase and probability errors, which occur even without the influence of the environment. These errors caused by the unwanted transitions are minimized and computed numerically.

Sign in / Sign up

Export Citation Format

Share Document