English
Related papers

Related papers: Optimal Synthesis of Multi-Controlled Qudit Gates

200 papers

Reversible logic has applications in various research areas including low-power design and quantum computation. In this paper, a rule-based optimization approach for reversible circuits is proposed which uses both negative and positive…

Quantum Physics · Physics 2012-09-06 Mona Arabzadeh , Mehdi Saeedi , Morteza Saheb Zamani

We develop a method to synthesize a class of entangling multi-qubit gates for a quantum computing platform with fixed Ising-type interaction with all-to-all connectivity. The only requirement on the flexibility of the interaction is that it…

We use a random search technique to find quantum gate sequences that implement perfect quantum state preparation or unitary operator synthesis with arbitrary targets. This approach is based on the recent discovery that there is a large…

Quantum Physics · Physics 2024-10-25 Sahel Ashhab , Fumiki Yoshihara , Miwako Tsuji , Mitsuhisa Sato , Kouichi Semba

Recently, reversible circuit synthesis has been intensively studied. One of the problems that has not been solved for a long time was exact minimization of gate count (GC) in 4-bit circuits. Finally, last year a tool of practical usage for…

Quantum Physics · Physics 2011-10-24 Marek Szyprowski , Pawel Kerntopf

This paper presents novel techniques for the synthesis of reversible networks of Toffoli gates, as well as improvements to previous methods. Gate count and technology oriented cost metrics are used. Our synthesis techniques are independent…

Quantum Physics · Physics 2011-08-01 D. Maslov , D. M. Miller , G. W. Dueck

We study the realization of a Toffoli gate with superconducting qubits in a circuit-QED setup using quantum-control methods. Starting with optimized piecewise-constant control fields acting on all qubits and typical strengths of XY-type…

Quantum Physics · Physics 2012-02-14 Vladimir M. Stojanovic , A. Fedorov , A. Wallraff , C. Bruder

We provide a method for compiling approximate multi-controlled single qubit gates into quantum circuits without ancilla qubits. The total number of elementary gates to decompose an n-qubit multi-controlled gate is proportional to 32n, and…

To solve classically hard problems, quantum computers need to be resilient to the influence of noise and decoherence. In such a fault-tolerant quantum computer, noise-induced errors must be detected and corrected in real-time to prevent…

The Toffoli gate is a fundamental building block for quantum arithmetic and reversible logic, yet its efficient realization remains a major challenge in both near-term and fault-tolerant quantum architectures. Recent advances in dynamic…

Quantum Physics · Physics 2026-05-21 Abhoy Kole , Till Schnittka , Rolf Drechsler

The primary objective of quantum circuit synthesis is to efficiently and accurately realize specific quantum algorithms or operations utilizing a predefined set of quantum gates, while also optimizing the circuit size. It holds a pivotal…

Quantum Physics · Physics 2025-10-22 Jialiang Tang , Jialin Zhang , Xiaoming Sun

Building a quantum computer is a daunting challenge since it requires good control but also good isolation from the environment to minimize decoherence. It is therefore important to realize quantum gates efficiently, using as few operations…

Quantum Physics · Physics 2019-10-28 T. Bækkegaard , L. B. Kristensen , N. J. S. Loft , C. K. Andersen , D. Petrosyan , N. T. Zinner

In this paper, we study the optimal simulation of three-qubit unitary by using two-qubit gates. First, we give a lower bound on the two-qubit gates cost of simulating a multi-qubit gate. Secondly, we completely characterize the two-qubit…

Quantum Physics · Physics 2013-01-17 Nengkun Yu , Mingsheng Ying

Quantum error correction is a crucial step beyond the current noisy-intermediate-scale quantum device towards fault-tolerant quantum computing. However, most of the error corrections ever demonstrated rely on post-selection of events or…

Quantum Physics · Physics 2021-09-07 Toshiaki Inada , Wonho Jang , Yutaro Iiyama , Koji Terashi , Ryu Sawada , Junichi Tanaka , Shoji Asai

From a geometric approach, we derive the minimum number of applications needed for an arbitrary Controlled-Unitary gate to construct a universal quantum circuit. A new analytic construction procedure is presented and shown to be either…

Quantum Physics · Physics 2009-11-10 Jun Zhang , Jiri Vala , Shankar Sastry , K. Birgitta Whaley

Quantum computation is traditionally expressed in terms of quantum bits, or qubits. In this work, we instead consider three-level qu$trits$. Past work with qutrits has demonstrated only constant factor improvements, owing to the $\log_2(3)$…

The three-input TOFFOLI gate is the workhorse of circuit synthesis for classical logic operations on quantum data, e.g., reversible arithmetic circuits. In physical implementations, however, TOFFOLI gates are decomposed into six CNOT gates…

Quantum Physics · Physics 2011-11-03 Vivek V. Shende , Igor L. Markov

The Toffoli gate is an important universal quantum gate, and will alongside the Clifford gates be available in future fault-tolerant quantum computing hardware. Many quantum algorithms rely on performing arbitrarily small single-qubit…

Quantum Physics · Physics 2026-03-13 Christoffer Hindlycke , Jakov Krnic , Jan-Åke Larsson

Reversible computation is gaining increasing relevance in the context of several post-CMOS technologies, the most prominent of those being Quantum computing. One of the key theoretical problem pertaining to reversible logic synthesis is the…

Emerging Technologies · Computer Science 2016-03-22 Anupam Chattopadhyay , Anubhab Baksi

We propose a method for exact circuit synthesis using a discrete gate set, as required for fault-tolerant quantum computing. Our approach translates the problem of synthesizing a gate specified by its unitary matrix into a boolean…

Quantum Physics · Physics 2025-03-20 Élie Gouzien , Nicolas Sangouard

In this paper, we have implemented and designed a sorting network for reversible logic circuits synthesis in terms of n*n Toffoli gates. The algorithm presented in this paper constructs a Toffoli Network based on swapping bit strings.…