Modular Component-Based Quantum Circuit Synthesis

نویسندگان

چکیده

In this article, we present a novel method for synthesizing quantum circuits from user-supplied components. Given input-output state vectors and component gates, our synthesizer aims to construct circuit that implements the provided functionality in terms of supplied gates. To achieve this, basically use an enumerative search with pruning. accelerate procedure, however, perform pruning at module level; instead simply enumerating candidate by appending gates sequence, stack modules, which are groups gate operations. With modular approach, can effectively reduce space directing way bridges gap between current specification. Evaluation on 17 benchmark problems shows technique is highly effective circuits. Our successfully synthesized 16 out 96.6 seconds average. On other hand, conventional, gate-level synthesis algorithm succeeded 10 average time 639.1 seconds. increased speed baseline 20.3x commonly solved both approaches.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modular Structural Component Design Using the Decomposition-based Assembly Synthesis

The design problem addressed in this study involves simultaneous optimization of two structures for the locations of joints and joint attributes (assembly synthesis), while investigating the possibility of sharing some of the components among two products (design for modularity). A genetic algorithm is employed for the solution of the problem. The objective function attempts to minimize the red...

متن کامل

Quantum Ternary Circuit Synthesis Using Projection Operations

Basic logic gates and their operations in ternary quantum domain are involved in the synthesis of ternary quantum circuits. Only a few works define ternary algebra for ternary quantum logic realization. In this paper, a ternary logic function is expressed in terms of projection operations including a new one. A method to realize new multi-qutrit ternary gates in terms of generalized ternary gat...

متن کامل

The synthesis of a quantum circuit

As two basic building blocks for any quantum circuit, we consider the 1-qubit NEGATOR(θ) circuit and the 1-qubit PHASOR(θ) circuit, extensions of the NOT gate and PHASE gate, respectively: NEGATOR(π) = NOT and PHASOR(π) = PHASE. Quantum circuits (acting on w qubits) consisting of controlled NEGATORs are represented by matrices from XU(2); quantum circuits (acting on w qubits) consisting of cont...

متن کامل

Software Architecture for Quantum Circuit Synthesis

This paper presents a new methodology together with its corresponding software analysis that create incentives for quantum circuit synthesis. Our circuit synthesis and architecture design approaches bring a new view on quantum circuit synthesis. This paper presents a software architecture that transforms a high-level software circuit description into a circuit layout, thus attaining quantum cir...

متن کامل

Faster Quantum Number Factoring via Circuit Synthesis

A major obstacle to implementing Shor’s quantum number-factoring algorithm is the large size of modular-exponentiation circuits. We reduce this bottleneck by customizing reversible circuits for modular multiplication to individual runs of Shor’s algorithm. Our circuit-synthesis procedure exploits spectral properties of multiplication operators and constructs optimized circuits from the traces o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ACM on programming languages

سال: 2023

ISSN: ['2475-1421']

DOI: https://doi.org/10.1145/3586039