scholarly journals A Quantum Cellular Automata Type Architecture with Quantum Teleportation for Quantum Computing

Entropy ◽  
2019 ◽  
Vol 21 (12) ◽  
pp. 1235
Author(s):  
Dimitrios Ntalaperas ◽  
Konstantinos Giannakis ◽  
Nikos Konofaos
Keyword(s):  
Fourier Transform ◽  
Cellular Automata ◽  
Quantum Teleportation ◽  
Nearest Neighbor ◽  
Input Pulse ◽  
Quantum Gate ◽  
Quantum Cellular Automata ◽  
Quantum Fourier Transform ◽  
Single Qubit ◽  
Qubit Operations

We propose an architecture based on Quantum Cellular Automata which allows the use of only one type of quantum gate per computational step, using nearest neighbor interactions. The model is built in partial steps, each one of them analyzed using nearest neighbor interactions, starting with single-qubit operations and continuing with two-qubit ones. A demonstration of the model is given, by analyzing how the techniques can be used to design a circuit implementing the Quantum Fourier Transform. Since the model uses only one type of quantum gate at each phase of the computation, physical implementation can be easier since at each step only one kind of input pulse needs to be applied to the apparatus.

Quantum Teleportation of Multiple Qubits Based on Quantum Fourier Transform

2018 ◽  
Vol 22 (12) ◽  
pp. 2427-2430 ◽  
Author(s):  
Dan Song ◽  
Chen He ◽  
Zhengwen Cao ◽  
Geng Chai
Keyword(s):  
Fourier Transform ◽  
Quantum Teleportation ◽  
Quantum Fourier Transform

scholarly journals Structural distortions in molecular-based quantum cellular automata: a minimal model based study

2014 ◽  
Vol 16 (33) ◽  
pp. 17777-17785 ◽  
Author(s):  
Alejandro Santana Bonilla ◽  
Rafael Gutierrez ◽  
Leonardo Medrano Sandonas ◽  
Daijiro Nozaki ◽  
Alessandro Paolo Bramanti ◽  
...  
Keyword(s):  
Cellular Automata ◽  
Minimal Model ◽  
Nearest Neighbor ◽  
Cell Interactions ◽  
Quantum Cellular Automata ◽  
Structural Distortions ◽  
Molecular Charge ◽  
Binary Information ◽  
A Cell ◽  
Charge Configuration

Molecular-based quantum cellular automata (m-QCA) offer a novel alternative in which binary information can be encoded in the molecular charge configuration of a cell and propagated via nearest-neighbor Coulombic cell–cell interactions. Structural distortions of the cells may have however a sensitive influence on the m-QCA response and thus, potentially alter its functionality.

Bilinear interpolation method for quantum images based on quantum Fourier transform

2018 ◽  
Vol 16 (04) ◽  
pp. 1850031 ◽  
Author(s):  
Panchi Li ◽  
Xiande Liu
Keyword(s):  
Image Processing ◽  
Fourier Transform ◽  
Nearest Neighbor ◽  
Interpolation Method ◽  
New Method ◽  
Basic Operation ◽  
Quantum Fourier Transform ◽  
Bilinear Interpolation ◽  
Image Scaling ◽  
Bicubic Interpolation

Image scaling is the basic operation that is widely used in classic image processing, including nearest-neighbor interpolation, bilinear interpolation, and bicubic interpolation. In quantum image processing (QIP), the research on image scaling is focused on nearest-neighbor interpolation, while the related research of bilinear interpolation is very rare, and that of bicubic interpolation has not been reported yet. In this study, a new method based on quantum Fourier transform (QFT) is designed for bilinear interpolation of images. Firstly, some basic functional modules are constructed, in which the new method based on QFT is adopted for the design of two core modules (i.e. addition and multiplication), and then these modules are used to design quantum circuits for the bilinear interpolation of images, including scaling-up and down. Finally, the complexity analysis of the scaling circuits based on the elementary gates is deduced. Simulation results show that the scaling image using bilinear interpolation is clearer than that using the nearest-neighbor interpolation.

The quantum Fourier transform on a linear nearest neighbor architecture

2007 ◽  
Vol 7 (4) ◽  
pp. 383-391
Author(s):  
Y. Takahashi ◽  
N. Kunihiro ◽  
K. Ohta
Keyword(s):  
Fourier Transform ◽  
Nearest Neighbor ◽  
Quantum Circuit ◽  
Quantum Fourier Transform ◽  
Factoring Algorithm

We show how to construct an efficient quantum circuit for computing a good approximation of the quantum Fourier transform on a linear nearest neighbor architecture. The constructed circuit uses no ancillary qubits and its depth and size are $O(n)$ and $O(n\log n)$, respectively, where $n$ is the length of the input. The circuit is useful for decreasing the size of Fowler et al.'s quantum circuit for Shor's factoring algorithm on a linear nearest neighbor architecture.

scholarly journals DECOMPOSITION OF UNITARY MATRICES AND QUANTUM GATES

2013 ◽  
Vol 11 (01) ◽  
pp. 1350015 ◽  
Author(s):  
CHI-KWONG LI ◽  
REBECCA ROBERTS ◽  
XIAOYAN YIN
Keyword(s):  
General Scheme ◽  
Quantum Gate ◽  
Quantum Gates ◽  
Unitary Matrix ◽  
Additional Structure ◽  
Unitary Matrices ◽  
Decomposition Scheme ◽  
Single Qubit ◽  
Matlab Program

A general scheme is presented to decompose a d-by-d unitary matrix as the product of two-level unitary matrices with additional structure and prescribed determinants. In particular, the decomposition can be done by using two-level matrices in d - 1 classes, where each class is isomorphic to the group of 2 × 2 unitary matrices. The proposed scheme is easy to apply, and useful in treating problems with the additional structural restrictions. A Matlab program is written to implement the scheme, and the result is used to deduce the fact that every quantum gate acting on n-qubit registers can be expressed as no more than 2n-1(2n-1) fully controlled single-qubit gates chosen from 2n-1 classes, where the quantum gates in each class share the same n - 1 control qubits. Moreover, it is shown that one can easily adjust the proposed decomposition scheme to take advantage of additional structure evolving in the process.

Sign in / Sign up

Export Citation Format

Share Document