IEEE International Conference on Soft Computing and Measurements (SCM)

Multithreading programming for FPRM quantum circuits design

I. V. Matveeva, В. А. Калмычков, A. V. Dorokhov

Published May 1, 2017• 1 citation

Abstract

In this paper we examined the separate aspects of design and analysis of the quantum circuits specifications on the computer platforms with the parallelism support. Idea of multi-thread programming for the quantum circuits synthesis and selection is shown, taking into consideration the subsequent use of the Linear Nearest Neighbor (LNN) approach. Our experience on some multi-core platforms is represented.

DOI: 10.1109/scm.2017.7970564

Related papers

Quantum circuits specifications design with lexical verification

В. А. Калмычков, Aleksandr V. Krasilnikov, I. V. Matveeva

In this paper we present our experience in quantum circuits design automation on the different notations basis. The need of rules and methods for generation of primitive quantum gates sequence for the quantum circuits on the basis of the Linear Nearest Neighbor (LNN) notation is shown. Our lexical verification methodology for quantum circuit specifications in each stage of its design is represented.

IEEE International Conference on Soft Computing and Measurements (SCM)May 1, 20155 citations

Parallelizing quantum circuit synthesis

Olivia Di Matteo, C Olivia Di Matteo

I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. ii We present an algorithmic framework for parallel quantum circuit synthesis using meet-in-the-middle synthesis techniques. We also present two implementations thereof, using both threaded and hybrid parallelization techniques. We give examples where applying parallelism offers a speedup on the time of circuit synthesis for 2-and 3-qubit circuits. We use a threaded algorithm to synthesize 3-qubit circuits with optimal T-count 9, and 11, breaking the previous record of T-count 7. As the estimated runtime of the framework is inversely proportional to the number of processors, we propose an implementation using hybrid parallel programming which can take full advantage of a computing cluster’s thousands of cores. This implementation has the potential to synthesize circuits which were previously deemed impossible due to the exponential runtime of existing algorithms.

Jan 1, 201532 citations

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

Zongyuan Zhang, Zhijin Guan, Hong Zhang +2 more

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.

Quantum Information and ComputationNov 1, 20183 citations

Enabling Multi-threading in Heterogeneous Quantum-Classical Programming Models

Akihiro Hayashi, Austin S. Adams, Jeffrey Young +4 more

While quantum computers enable significant performance improvements for certain classes of applications, building a well-defined programming model has been a pressing issue. In this paper, we address some of the key limitations to realizing a generic heterogeneous parallel programming model for quantum-classical heterogeneous platforms. We discuss our experience in enabling user-level multi-threading in QCOR [1] as well as challenges that need to be addressed for programming future quantum-classical systems. Specifically, we discuss our design and implementation of introducing C++-based parallel constructs to enable 1) parallel execution of a quantum kernel with std::thread and 2) asynchronous execution with std::async. To do so, we provide a detailed overview of the current implementation of the QCOR programming model and runtime, and discuss how we add 1) thread-safety to some of its user-facing API routines, and 2) increase parallelism in QCOR by removing data races that inhibit multi-threading so as to better utilize available computing resources. We also present preliminary performance results with the Quantum++ [2] back end on a single-node Ryzen9 3900X machine that has 12 physical cores (24 hardware threads) with 128GB of RAM. The results show that running two Bell kernels with 12 threads per kernel in parallel outperforms running the kernels one after the other each with 24 threads (1.63× improvement). In addition, we observe the same trend when running two Shor’s algorthm kernels in parallel (1.22× faster than executing the kernels one after the other). Furthermore, the parallel version is better in terms of strong scalability. We believe that our design, implementation, and results will open up an opportunity not only for 1) enabling quicker prototyping of parallel-aware quantum-classical algorithms on quantum circuit simulators in the short-term, but also for 2) realizing a generic parallel programming model for quantum-classical heterogeneous platforms in the long-term.

arXiv:2301.11559IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd ForumMay 1, 20235 citations

Model Design of Quantum Logic Circuits Based on Reed-Muller Expressions

Irina Matveeva, В. А. Калмычков, Anatolii Dorokhov

The article considers the design flow for automatic generation of the quantum circuit model specifications as a fragment of the logical unit of a quantum computer. Reed-Muller expressions is base for this generation. The model representation takes into account the features of the quantum circuit realization in the notation of the linear nearest neighborhood (LNN), the proposed templates provide the automatic selection of the optimal gates composition.

International Russian Automation Conference (RusAutoCon)Sep 1, 20182 citations

Nearest Neighbour based Synthesis of Quantum Boolean Circuits

Amlan Chakrabarti, Susmita Sur‐Kolay

Abstract—Quantum Boolean circuit synthesis issues are becoming a key area of research in the domain of quantum computing. For gate-level synthesis, minterm based and Reed-Muller canonical decomposition techniques are adopted as common approaches. Physical implementation of quantum circuits have inherent constraints and hence nearest neighbour template of input lines is gaining importance. In this work, we present a brief analysis of the various Fixed Polarity Reed Muller (FPRM) expressions for a given quantum Boolean circuit and also introduce the rules for the nearest neighbour template-based synthesis of these forms. The corresponding circuit costs are evaluated.

Engineering lettersJan 1, 200729 citations