Quantum teleportation is one of basis study of quantum computing algorithms mostly used in quantum communication. This algorithm has so far been implemented using a variety of quantum realization models. In this study, quantum teleportation algorithm is realized experimentally using classical LC circuits. In addition, electrical simulation of some quantum gates such as Hadamard and CNOT gates used in algorithm are also given. The importance of implementation of such quantum algorithms onto classical electrical circuit is that it is being inexpensive and can work at room temperature. This study can contribute greatly to the experimental teaching of the emerging quantum technology revolution to students.
A circuit system consisting of LC-oscillators is mathematically shown to emulate quantum circuits. Here we develop a SPICE-based framework for emulating universal quantum gates (the phase-shift, the Hadamard, and the CNOT gates). To reconstruct each gate behavior, the inductors and capacitors are chosen and tuned precisely. Each quantum state is perfectly described by the phase and amplitude of each oscillator. In principle, our framework can simulate a quantum system with any arbitrary number of qubits since each gate process is perfectly achieved. Finally, we have simulated a quantum circuit with 3 qubits as input that consists of all the universal quantum gates. Our simulation result shows that our framework can classically emulate the result of any quantum circuit with an arbitrary number of qubits and quantum logic components.
We propose to simulate quantum gates by LC resonators, where the amplitude and the phase of the voltage describe the quantum state.By controlling the capacitance or inductance of resonators, it is possible to control the phase of the voltage arbitrarily.A set of resonators acts as the phase-shift, the Hadamard, and the CNOT gates.They constitute a set of universal quantum gates.We also discuss an application to an artificial neuron.As an example, we study pattern recognition of numbers and alphabets by evaluating the similarity between an input and the reference pattern.We also study colored pattern recognition by using a complex neural network.
In the world of quantum computing, quantum Fourier transform (QFT) has been one of the most important subroutines for quantum algorithms, as exemplified by Shor's factoring algorithms and phase estimation (which in itself has been used as a primitive in various quantum algorithms). In fact most of the well known quantum algorithms can be divided into two classes, QFT based algorithms and search based algorithms. The usual circuit for QFT (covered in almost every basic quantum algorithms course) needs
O(q2) gates (and
O(q) qubits) to perform the exact Fourier transform over
F2q. Cleve and Watrous (FOCS 2000) improved this gate count to
O(q(logq)2(loglogq)) using the integer multiplication algorithm in
O(n(logn)(loglogn)) time for two
n-bit integers (best known at that time). Our first main result shows that this gate count can be improved to
O(q(logq)). In fact, if there is a multiplication circuit, to multiply two
n-bit integers, with
O(n(logn)α) gates; we get a QFT circuit with
O(q(logq)α) gates (improving upon
O(q(logq)α+1)) gates from the construction of Cleve and Watrous). Given the recent claim by OpenAI about integer multiplication, this opens up the possibility of having a QFT circuit with
o(q(logq)) gates. On approximating the QFT over $\ZZ/(2^q \ZZ)$, the result of Ahokas, Cleve and Hales (ERATO 2003) showed that an approximating circuit can be built with
O(q(loglog(q/ε))α+1) gates, where
ε is the approximating parameter. Our second main result again improves this to
O(q(loglog(q/ε))α) gates.
Abstract There are various gate sets that can be used to describe a quantum computation. A particularly popular gate set in the literature on quantum computing consists of arbitrary single-qubit gates and two-qubit CNOT gates. A CNOT gate is however not always the natural multi-qubit interaction that can be implemented on a given physical quantum computer, necessitating a compilation step that transforms these CNOT gates to the native gate set. An especially interesting case where compilation is necessary is for ion trap quantum computers, where the natural entangling operation can act on more than two qubits and can even act globally on all qubits at once. This calls for an entirely different approach to constructing efficient circuits. In this paper we study the problem of converting a given circuit that uses two-qubit gates to one that uses global gates. Our three main contributions are as follows. First, we find an efficient algorithm for transforming an arbitrary circuit consisting of Clifford gates and arbitrary phase gates into a circuit consisting of single-qubit gates and a number of global interactions proportional to the number of non-Clifford phases present in the original circuit. Second, we find a general strategy to transform a global gate that targets all qubits into one that targets only a subset of the qubits. This approach scales linearly with the number of qubits that are not targeted, in contrast to the exponential scaling reported in (Maslov and Nam 2018 New J. Phys. 20 033018). Third, we improve on the number of global gates required to synthesise an arbitrary n-qubit Clifford circuit from the 12n − 18 reported in (Maslov and Nam 2018 New J. Phys. 20 033018) to 6n − 8.