scholarly journals Synthesis of quantum circuits in Linear Nearest neighbor Model using Positive Davio Lattices

2011 ◽  
Vol 24 (1) ◽  
pp. 71-87 ◽  
Author(s):  
Marek Perkowski ◽  
Martin Lukac ◽  
Dipal Shah ◽  
Michitaka Kameyama
Keyword(s):  
Nearest Neighbor ◽  
Dimensional Space ◽  
Synthesis Method ◽  
Logic Synthesis ◽  
Quantum Circuits ◽  
Quantum Gates ◽  
Synthesis Methods ◽  
Cost Models ◽  
Quantum Cost ◽  
One Dimensional

We present a logic synthesis method based on lattices that realize quantum arrays in One-Dimensional Ion Trap technology. This means that all gates are built from 2x2 quantum primitives that are located only on neighbor qubits in a one-dimensional space (called also vector of qubits or Linear Nearest Neighbor (LNN) architecture). The Logic circuits designed by the proposed method are realized only with 3*3 Toffoli, Feynman and NOT quantum gates and the usage of the commonly used multi-input Toffoli gates is avoided. This realization method of quantum circuits is different from most of reversible circuits synthesis methods from the literature that use only high level quantum cost based on the number of quantum gates. Our synthesis approach applies to both standard and LNN quantum cost models. It leads to entirely new CAD algorithms for circuit synthesis and substantially decreases the quantum cost for LNN quantum circuits. The drawback of synthesizing circuits in the presented LNN architecture is the addition of ancilla qubits.

scholarly journals Block-based quantum-logic synthesis

2011 ◽  
Vol 11 (3&4) ◽  
pp. 262-277
Author(s):  
Mehdi Saeedi ◽  
Mona Arabzadeh ◽  
Morteza Saheb Zamani ◽  
Mehdi Sedighi
Keyword(s):  
Quantum Logic ◽  
Nearest Neighbor ◽  
Synthesis Method ◽  
Logic Synthesis ◽  
Quantum Circuit ◽  
Basic Block ◽  
Synthesis Methods ◽  
Quantum Logic Synthesis ◽  
Block Based ◽  
Arbitrary Quantum

In this paper, the problem of constructing an efficient quantum circuit for the implementation of an arbitrary quantum computation is addressed. To this end, a basic block based on the cosine-sine decomposition method is suggested which contains $l$ qubits. In addition, a previously proposed quantum-logic synthesis method based on quantum Shannon decomposition is recursively applied to reach unitary gates over $l$ qubits. Then, the basic block is used and some optimizations are applied to remove redundant gates. It is shown that the exact value of $l$ affects the number of one-qubit and CNOT gates in the proposed method. In comparison to the previous synthesis methods, the value of $l$ is examined consequently to improve either the number of CNOT gates or the total number of gates. The proposed approach is further analyzed by considering the nearest neighbor limitation. According to our evaluation, the number of CNOT gates is increased by at most a factor of $\frac{5}{3}$ if the nearest neighbor interaction is applied.

scholarly journals Quantum Implementation of Powell’s Conjugate Direction Method

2019 ◽  
Vol 23 (4) ◽  
pp. 726-734
Author(s):  
Kehan Chen ◽  
Fei Yan ◽  
Kaoru Hirota ◽  
Jianping Zhao ◽  
◽  
...  
Keyword(s):  
Search Algorithm ◽  
Quantum Circuit ◽  
Data Fitting ◽  
Quadratic Equation ◽  
Quantum Circuits ◽  
Quantum Gates ◽  
Circuit Implementation ◽  
One Dimensional ◽  
Conjugate Direction ◽  
Conjugate Direction Method

A quantum circuit implementation of Powell’s conjugate direction method (“Powell’s method”) is proposed based on quantum basic transformations in this study. Powell’s method intends to find the minimum of a function, including a sequence of parameters, by changing one parameter at a time. The quantum circuits that implement Powell’s method are logically built by combining quantum computing units and basic quantum gates. The main contributions of this study are the quantum realization of a quadratic equation, the proposal of a quantum one-dimensional search algorithm, the quantum implementation of updating the searching direction array (SDA), and the quantum judgment of stopping the Powell’s iteration. A simulation demonstrates the execution of Powell’s method, and future applications, such as data fitting and image registration, are discussed.

Analyzing Heuristic-based Randomized Search Strategies for the Quantum Circuit Compilation Problem

2020 ◽  
Vol 174 (3-4) ◽  
pp. 259-281
Author(s):  
Angelo Oddi ◽  
Riccardo Rasconi
Keyword(s):  
Quantum Computing ◽  
Nearest Neighbor ◽  
Quantum Algorithm ◽  
Quantum Circuit ◽  
Quantum Circuits ◽  
Quantum Gates ◽  
Ranking Functions ◽  
Solution Quality ◽  
Circuit Realization ◽  
Definition Of

In this work we investigate the performance of greedy randomised search (GRS) techniques to the problem of compiling quantum circuits to emerging quantum hardware. Quantum computing (QC) represents the next big step towards power consumption minimisation and CPU speed boost in the future of computing machines. Quantum computing uses quantum gates that manipulate multi-valued bits (qubits). A quantum circuit is composed of a number of qubits and a series of quantum gates that operate on those qubits, and whose execution realises a specific quantum algorithm. Current quantum computing technologies limit the qubit interaction distance allowing the execution of gates between adjacent qubits only. This has opened the way to the exploration of possible techniques aimed at guaranteeing nearest-neighbor (NN) compliance in any quantum circuit through the addition of a number of so-called swap gates between adjacent qubits. In addition, technological limitations (decoherence effect) impose that the overall duration (makespan) of the quantum circuit realization be minimized. One core contribution of the paper is the definition of two lexicographic ranking functions for quantum gate selection, using two keys: one key acts as a global closure metric to minimise the solution makespan; the second one is a local metric, which favours the mutual approach of the closest qstates pairs. We present a GRS procedure that synthesises NN-compliant quantum circuits realizations, starting from a set of benchmark instances of different size belonging to the Quantum Approximate Optimization Algorithm (QAOA) class tailored for the MaxCut problem. We propose a comparison between the presented meta-heuristics and the approaches used in the recent literature against the same benchmarks, both from the CPU efficiency and from the solution quality standpoint. In particular, we compare our approach against a reference benchmark initially proposed and subsequently expanded in [1] by considering: (i) variable qubit state initialisation and (ii) crosstalk constraints that further restrict parallel gate execution.

Realization of a new permutative gate library using controlled-kth-root-of-NOT quantum gates for exact minimization of quantum circuits

2014 ◽  
Vol 12 (05) ◽  
pp. 1450034 ◽  
Author(s):  
Zhiqiang Li ◽  
Xiaoyu Song ◽  
Marek Perkowski ◽  
Hanwu Chen ◽  
Xiaoxia Feng
Keyword(s):  
Quantum Logic ◽  
Logic Gate ◽  
Logic Circuits ◽  
Quantum Circuits ◽  
Quantum Gates ◽  
Quantum Cost ◽  
Efficient Synthesis ◽  
Quantum Logic Gate ◽  
Synthesis Algorithm ◽  
Direct Use

Since non-permutative quantum gates have more complex rules than permutative quantum gates, it is very hard to synthesize quantum logic circuits using non-permutative quantum gates, such as controlled-square-root-of-NOT gates (CV∕CV+ gates). In the efficient synthesis algorithm, direct use of quantum non-permutative gates should be avoided. Rather, the key method is to use quantum gates to create new permutative quantum gates that then replace non-permutative quantum gates. This method assumes the library of quantum gate primitives are constructed so as to have the lowest possible quantum cost. In this paper, we first propose some new CV∕CV+-like gates, i.e. controlled-kth-root-of-NOT gates where k = 2,4,8,…, and give all corresponding matrixes. Further, we also present a novel generic method to quickly and directly construct this new optimal quantum logic gate library using CNOT and these non-permutative quantum gates. Our method introduces new means to find permutative quantum gates with lower quantum cost.

A method for synthesis and optimization for linear nearest neighbor quantum circuits by parallel processing

2018 ◽  
Vol 18 (13&14) ◽  
pp. 1095-1114
Author(s):  
Zongyuan Zhang ◽  
Zhijin Guan ◽  
Hong Zhang ◽  
Haiying Ma ◽  
Weiping Ding
Keyword(s):  
Parallel Processing ◽  
Large Scale ◽  
Nearest Neighbor ◽  
Matrix Multiplication ◽  
Quantum Circuit ◽  
Quantum Circuits ◽  
Quantum Cost ◽  
The Matrix ◽  
Speed Up ◽  
Serial Algorithm

In order to realize the linear nearest neighbor{(LNN)} of the quantum circuits and reduce the quantum cost of linear reversible quantum circuits, a method for synthesizing and optimizing linear reversible quantum circuits based on matrix multiplication of the structure of the quantum circuit is proposed. This method shows the matrix representation of linear quantum circuits by multiplying matrices of different parts of the whole circuit. The LNN realization by adding the SWAP gates is proposed and the equivalence of two ways of adding the SWAP gates is proved. The elimination rules of the SWAP gates between two overlapped adjacent quantum gates in different cases are proposed, which reduce the quantum cost of quantum circuits after realizing the LNN architecture. We propose an algorithm based on parallel processing in order to effectively reduce the time consumption for large-scale quantum circuits. Experiments show that the quantum cost can be improved by 34.31\% on average and the speed-up ratio of the GPU-based algorithm can reach 4 times compared with the CPU-based algorithm. The average time optimization ratio of the benchmark large-scale circuits in RevLib processed by the parallel algorithm is {95.57\%} comparing with the serial algorithm.

Study of the one-dimensional Holstein model with next-nearest-neighbor hopping

2010 ◽  
Vol 23 (2) ◽  
pp. 025601 ◽  
Author(s):  
Monodeep Chakraborty ◽  
A N Das ◽  
Atisdipankar Chakrabarti
Keyword(s):  
Nearest Neighbor ◽  
One Dimensional ◽  
Holstein Model ◽  
The One

scholarly journals Interrelations of Synthesis Method, Polyethylene Glycol Coating, Physico-Chemical Characteristics, and Antimicrobial Activity of Silver Nanoparticles

Nanomaterials ◽  
2020 ◽  
Vol 10 (12) ◽  
pp. 2475
Author(s):  
Amirah Shafilla Mohamad Kasim ◽  
Arbakariya Bin Ariff ◽  
Rosfarizan Mohamad ◽  
Fadzlie Wong Faizal Wong
Keyword(s):  
Antimicrobial Activity ◽  
Silver Nanoparticles ◽  
Polyethylene Glycol ◽  
Pathogenic Bacteria ◽  
Synthesis Method ◽  
Chemical Characteristics ◽  
Synthesis Methods ◽  
Uniform Size ◽  
Transmission Electron Microscopy Analysis ◽  
Physico Chemical

Silver nanoparticles (AgNPs) have been found to have extensive biomedical and biological applications. They can be synthesised using chemical and biological methods, and coated by polymer to enhance their stability. Hence, the changes in the physico-chemical characteristics of AgNPs must be scrutinised due to their importance for biological activity. The UV-Visible absorption spectra of polyethylene glycol (PEG) -coated AgNPs displayed a distinctive narrow peak compared to uncoated AgNPs. In addition, High-Resolution Transmission Electron Microscopy analysis revealed that the shapes of all AgNPs, were predominantly spherical, triangular, and rod-shaped. Fourier-Transform Infrared Spectroscopy analysis further confirmed the role of PEG molecules in the reduction and stabilisation of the AgNPs. Moreover, dynamic light scattering analysis also revealed that the polydispersity index values of PEG-coated AgNPs were lower than the uncoated AgNPs, implying a more uniform size distribution. Furthermore, the uncoated and PEG-coated biologically synthesised AgNPs demonstrated antagonisms activities towards tested pathogenic bacteria, whereas no antagonism activity was detected for the chemically synthesised AgNPs. Overall, generalisation on the interrelations of synthesis methods, PEG coating, characteristics, and antimicrobial activity of AgNPs were established in this study.

scholarly journals Sol-Gel Synthesis of the Double Perovskite Sr2FeMoO6 by Microwave Technique

Materials ◽  
2021 ◽  
Vol 14 (14) ◽  
pp. 3876
Author(s):  
Jesús Valdés ◽  
Daniel Reséndiz ◽  
Ángeles Cuán ◽  
Rufino Nava ◽  
Bertha Aguilar ◽  
...  
Keyword(s):  
Particle Size ◽  
Hydrothermal Synthesis ◽  
Microwave Radiation ◽  
Structural Characteristics ◽  
Sol Gel ◽  
Synthesis Method ◽  
Double Perovskite ◽  
Synthesis Methods ◽  
X Ray ◽  
Sol Gel Synthesis

The effect of microwave radiation on the hydrothermal synthesis of the double perovskite Sr2FeMoO6 has been studied based on a comparison of the particle size and structural characteristics of products from both methods. A temperature, pressure, and pH condition screening was performed, and the most representative results of these are herein presented and discussed. Radiation of microwaves in the hydrothermal synthesis method led to a decrease in crystallite size, which is an effect from the reaction temperature. The particle size ranged from 378 to 318 nm when pH was 4.5 and pressure was kept under 40 bars. According to X-ray diffraction (XRD) results coupled with the size-strain plot method, the product obtained by both synthesis methods (with and without microwave radiation) have similar crystal purity. The Scanning Electron Microscopy (SEM) and Energy Dispersive X-ray Spectroscopy (EDS) techniques showed that the morphology and the distribution of metal ions are uniform. The Curie temperature obtained by thermogravimetric analysis indicates that, in the presence of microwaves, the value was higher with respect to traditional synthesis from 335 K to 342.5 K. Consequently, microwave radiation enhances the diffusion and nucleation process of ionic precursors during the synthesis, which promotes a uniform heating in the reaction mixture leading to a reduction in the particle size, but keeping good crystallinity of the double perovskite. Precursor phases and the final purity of the Sr2FeMoO6 powder can be controlled via hydrothermal microwave heating on the first stages of the Sol-Gel method.

scholarly journals Microwave-Assisted vs. Conventional Hydrothermal Synthesis of MoS2 Nanosheets: Application towards Hydrogen Evolution Reaction

Crystals ◽  
2020 ◽  
Vol 10 (11) ◽  
pp. 1040 ◽  
Author(s):  
Getachew Solomon ◽  
Raffaello Mazzaro ◽  
Vittorio Morandi ◽  
Isabella Concina ◽  
Alberto Vomiero
Keyword(s):  
Hydrothermal Synthesis ◽  
Hydrothermal Method ◽  
Hydrogen Evolution ◽  
Hydrogen Evolution Reaction ◽  
Current Density ◽  
Crystal Morphology ◽  
Synthesis Method ◽  
Synthesis Methods ◽  
Mos2 Nanosheets ◽  
Microwave Assisted

Molybdenum sulfide (MoS2) has emerged as a promising catalyst for hydrogen evolution applications. The synthesis method mainly employed is a conventional hydrothermal method. This method requires a longer time compared to other methods such as microwave synthesis methods. There is a lack of comparison of the two synthesis methods in terms of crystal morphology and its electrochemical activities. In this work, MoS2 nanosheets are synthesized using both hydrothermal (HT-MoS2) and advanced microwave methods (MW-MoS2), their crystal morphology, and catalytical efficiency towards hydrogen evolution reaction (HER) were compared. MoS2 nanosheet is obtained using microwave-assisted synthesis in a very short time (30 min) compared to the 24 h hydrothermal synthesis method. Both methods produce thin and aggregated nanosheets. However, the nanosheets synthesized by the microwave method have a less crumpled structure and smoother edges compared to the hydrothermal method. The as-prepared nanosheets are tested and used as a catalyst for hydrogen evolution results in nearly similar electrocatalytic performance. Experimental results showed that: HT-MoS2 displays a current density of 10 mA/cm2 at overpotential (−280 mV) compared to MW-MoS2 which requires −320 mV to produce a similar current density, suggesting that the HT-MoS2 more active towards hydrogen evolutions reaction.

Sign in / Sign up

Export Citation Format

Share Document