محاسبات کوانتومی

List of Articles محاسبات کوانتومی

Open Access Article
- Abstract Page
- Full-Text
1 - Optimizing Quantum Circuits by One-Way Quantum Computation Model Based on Pattern Geometries
M. Eslamy M. Saheb Zamani M. Sedighi M. Houshmand
20.1001.1.16823745.1395.14.4.10.8

A fundamentally quantum model of computation based on quantum entanglement and quantum measurement is called one-way quantum computation model (1WQC). Computations are shown by measurement patterns (or simply patterns) in this model where an initial highly entangled sta More

A fundamentally quantum model of computation based on quantum entanglement and quantum measurement is called one-way quantum computation model (1WQC). Computations are shown by measurement patterns (or simply patterns) in this model where an initial highly entangled state called a graph state is used to perform universal quantum computations. This graph together with the set of its input and output qubits is called the geometry of the pattern. Moreover, some optimization techniques have been introduced to simplify patterns. Previously, the 1WQC model has been applied to optimize quantum circuits. An approach for parallelizing quantum circuits has been proposed which takes a quantum circuit and then produces the corresponding pattern after performing the proposed optimization techniques for this model. Then it translates the optimized 1WQC patterns back to quantum circuits to parallelize the initial quantum circuit by using a set of rewriting rules. To improve previous works, in this paper, a new automatic approach is proposed to optimize patterns based on their geometries instead of using rewriting rules by applying optimization techniques simultaneously. Moreover, the optimized pattern is translated back to a quantum circuit and then this circuit is simplified by decreasing the number of auxiliary qubits. Results show that the quantum circuit cost metrics of the proposed approach is improved as compared to the previous ones. Manuscript profile
Open Access Article
- Abstract Page
- Full-Text
2 - Design of Parity Preserving Reversible Signed Multiplier Circuit
M. Haghparast A. Bolhassani
20.1001.1.16823745.1397.16.3.8.8

One of the major challenges and constraints in designing very large integrated circuits is the power dissipation of transistors. Reversible logic is one of the new paradigm in reducing the power consumption of digital circuits in the quantum computing field. In this pap More

One of the major challenges and constraints in designing very large integrated circuits is the power dissipation of transistors. Reversible logic is one of the new paradigm in reducing the power consumption of digital circuits in the quantum computing field. In this paper, an improved design of a parallel 5-bit parity preserving reversible signed multiplier circuit is presented. Reversible circuit designs with parity preserving property are an important issue for the implementation of fault tolerant systems in nanotechnology area. To design of the proposed multiplier, the reversible full adder circuit using 5×5 reversible HBF block with low quantum cost, and the 4×4 reversible HBL gate, with parity preserving property are proposed. The structure of the multiplier circuit consists of two parts of the partial product generation (PPG) and multi-operand addition (MOA). This structure is based on Baugh-Wooley and Wallace-Tree algorithms, which results in improved speed of operation in a 5-bit multiplier for signed digits. The proposed circuits are optimized based on important evaluation issues such as quantum cost, garbage outputs and constant inputs, and also are compared with the existing circuits. The main goal is to reduce the quantum cost, the number of constant inputs and garbage outputs in the design of the proposed multiplier circuit. The results of the final evaluation and comparison shows that the proposed multiplier in this study is improved by 26% in quantum cost, 9% in garbage outputs and 9% in constant inputs relative to the best existing designs. Manuscript profile
Open Access Article
- Abstract Page
- Full-Text
3 - Improved Realization of Controlled Unitary Gates in the One-Way Quantum Computation Model Using the Extended Measurement Calculus
M. Houshmand M. hooshmand
20.1001.1.16823745.1398.17.1.12.5

In one-way quantum computation model (1WQC), the quantum correlations in an entangled state, called a cluster state or graph state, are used to perform universal quantum computations using single-qubit measurements. In 1WQC, the computations are shown by measurement pat More

In one-way quantum computation model (1WQC), the quantum correlations in an entangled state, called a cluster state or graph state, are used to perform universal quantum computations using single-qubit measurements. In 1WQC, the computations are shown by measurement patterns or simply patterns. The synthesis problem in the 1WQC model is defined as extracting the pattern from a given arbitrary unitary matrix. The important criteria in evaluating measurement patterns in the 1WQC model, are the size, the depth and the number of entanglements of the pattern. In this paper, a new approach is proposed to synthesize controlled-unitary U gates where U is a single-qubit gate. To this end, for the first time, the idea of applying the extended measurement calculus, which utilizes the measurements in different Bloch sphere planes, is used in the synthesis of the 1WQC model. Some optimizations are proposed for this method and a new approach is presented to synthesize controlled-U gates for the 1WQC model which improves the evaluation criteria of size, depth and the number of entanglements in this model as compared to the best previous result by 9.1%, 30% and 18.1%, respectively. Manuscript profile
Open Access Article
- Abstract Page
- Full-Text
4 - Multi-Objective Logic Synthesis of Quantum Circuits
Arezoo Rajaei Mahboobeh Houshmand Seyyed Abed Hosseini
20.1001.1.16823745.1401.20.3.6.4

Quantum computing is a new method of information processing that is based on the concepts of quantum mechanics and leads to strange and powerful events in the quantum field. The logic synthesis of quantum circuits refers to the process of converting a given quantum gate More

Quantum computing is a new method of information processing that is based on the concepts of quantum mechanics and leads to strange and powerful events in the quantum field. The logic synthesis of quantum circuits refers to the process of converting a given quantum gate into a set of gates that can be implemented in quantum technologies. The most famous logic synthesis methods are CSD and QSD. The main goal of this study is to present a multi-objective logical synthesis method combining the above two methods in the quantum circuit model with the aim of optimizing the evaluation criteria. In this proposed method, the solution space is created from different combinations of CSD and QSD decomposition methods. The created solution space is a space with a very large exponential size. Then, using a bottom-up approach of multi-objective dynamic programming, a method is presented to search only a part of the entire solution space to find circuits with the optimal Pareto costs. The obtained results show that this method creates a balance between the evaluation criteria and produces many optimal Pareto solutions that can be selected according to different quantum technologies. Manuscript profile
Open Access Article
- Abstract Page
- Full-Text
5 - A Two-Level Method Based on Dynamic Programming for Partitioning and Optimization of the Communication Cost in Distributed Quantum Circuits
zohreh davarzani maryam zomorodi-moghadam M. Houshmand

Nowadays, quantum computing has played a significant role in increasing the speed of algorithms. Due to the limitations in the manufacturing technologies of quantum computers, the design of a large-scale quantum computer faces many challenges. One solution to overcome t More

Nowadays, quantum computing has played a significant role in increasing the speed of algorithms. Due to the limitations in the manufacturing technologies of quantum computers, the design of a large-scale quantum computer faces many challenges. One solution to overcome these challenges is the design of distributed quantum systems. In these systems, quantum computers are connected to each other through the teleportation protocol to transfer quantum information. Since quantum teleportation requires quantum resources, it is necessary to reduce the number of that. The purpose of this paper is to present a distributed quantum system considering the two goals of balanced distribution of qubits and minimizing the number of teleportation protocols in two levels. In the first level, by presenting a dynamic programming algorithm, an attempt has been made to distribute qubits in a balanced manner and reduce the number of connections between subsystems. According to the output partitioning obtained from the first level, in the second level and in the stage of implementation of global gates, when one of the qubits of this gate is teleported from the home to the desired destination, this qubit may be able to be used by a number of global gates, observing the precedence restrictions and as a result it reduces the number of teleportations. The obtained results show the better performance of the proposed algorithm. Manuscript profile

Current Issue

Published Issues

Menu

Browse

List of Articles محاسبات کوانتومی