English
Related papers

Related papers: A Single Universal n-bit Gate for Reversible Circu…

200 papers

Implementation of high-dimensional (HD) quantum gates shows very promising perspectives for HD quantum computation. A bipartite quantum system with arbitrary dimensions $n$ and $m$ is termed a quNit-quMit. Here we propose a synthesis scheme…

Quantum Physics · Physics 2026-04-14 Gui-Long Jiang , Hai-Rui Wei

We propose the generalized controlled X (GCX) gate as the two-qudit elementary gate, and based on Cartan decomposition, we also give the one-qudit elementary gates. Then we discuss the physical implementation of these elementary gates and…

Quantum Physics · Physics 2015-06-12 Yao-Min Di , Hai-Rui Wei

The creation of composite quantum gates that implement quantum response functions $\hat{U}(\theta)$ dependent on some parameter of interest $\theta$ is often more of an art than a science. Through inspired design, a sequence of $L$…

Quantum Physics · Physics 2018-02-02 Guang Hao Low , Theodore J. Yoder , Isaac L. Chuang

We present a simple algorithm that implements an arbitrary $n$-qubit unitary operator using a Clifford+T circuit with T-count $O(2^{4n/3} n^{2/3})$. This improves upon the previous best known upper bound of $O(2^{3n/2} n)$, while the best…

Quantum Physics · Physics 2025-10-01 Xinyu Tan

Coherent gate errors are a concern in many proposed quantum computing architectures. These errors can be effectively handled through composite pulse sequences for single-qubit gates, however, such techniques are less feasible for entangling…

In this work, we consider error detection via simulation for reversible circuit architectures. We rigorously prove that reversibility augments the performance of this simple error detection protocol to a considerable degree. A single…

Hardware Architecture · Computer Science 2023-01-11 Lukas Burgholzer , Robert Wille , Richard Kueng

While a couple of impressive quantum technologies have been proposed, they have several intrinsic limitations which must be considered by circuit designers to produce realizable circuits. Limited interaction distance between gate qubits is…

Quantum Physics · Physics 2012-09-06 Mehdi Saeedi , Robert Wille , Rolf Drechsler

Gate-based quantum computers typically encode and process information in two-dimensional units called qubits. Using $d$-dimensional qudits instead may offer intrinsic advantages, including more efficient circuit synthesis, problem-tailored…

We report optimal and asymptotically optimal reversible circuits composed of NOT, CNOT, and Toffoli (NCT) gates, keeping the count by the subsets of the gate types used. This study fine tunes the circuit complexity figures for the…

Quantum Physics · Physics 2018-07-25 Dmitri Maslov

In this paper, we show the equivalence of the set of unitaries computable by the circuits over the Clifford and T library and the set of unitaries over the ring $\mathbb{Z}[\frac{1}{\sqrt{2}},i]$, in the single-qubit case. We report an…

Quantum Physics · Physics 2013-03-01 Vadym Kliuchnikov , Dmitri Maslov , Michele Mosca

Quantum computers require quantum processors. An important part of the processor of any computer is the arithmetic unit, which performs binary addition, subtraction, division and multiplication, however multiplication can be performed using…

Quantum Physics · Physics 2018-11-14 Rasha Montaser , Ahmed Younes , Mahmoud Abdel-Aty

This paper presents a heuristic cost minimization approach to synthesizing linear reversible circuits. Two bidirectional linear reversible circuit synthesis methods are introduced, the Alternating Elimination with Cost Minimization method…

Emerging Technologies · Computer Science 2014-07-02 Ben Schaeffer , Marek Perkowski

We say that collection of $n$-qudit gates is universal if there exists $N_0\geq n$ such that for every $N\geq N_0$ every $N$-qudit unitary operation can be approximated with arbitrary precision by a circuit built from gates of the…

Quantum Physics · Physics 2007-05-23 Gabor Ivanyos

Motivated by practical concerns in cryptography, we study pseudorandomness properties of permutations on $\{0,1\}^n$ computed by random circuits made from reversible $3$-bit gates (permutations on $\{0,1\}^3$). Our main result is that a…

Cryptography and Security · Computer Science 2025-02-12 William Gay , William He , Nicholas Kocurek , Ryan O'Donnell

Which gates are universal for quantum computation? Although it is well known that certain gates on two-level quantum systems (qubits), such as the controlled-not (CNOT), are universal when assisted by arbitrary one-qubit gates, it has only…

Using geometric phases to realize noise-resilient quantum computing is an important method to enhance the control fidelity. In this work, we experimentally realize a universal nonadiabatic geometric quantum gate set in a superconducting…

The reversible logic can be used in various research areas, e.g. quantum computation, cryptography and signal processing. In the paper we study reversible logic circuits with additional inputs, which consist of NOT, CNOT and…

Computational Complexity · Computer Science 2016-03-22 Dmitry V. Zakablukov

The composite rotation approach has been used to develop a range of robust quantum logic gates, including single qubit gates and two qubit gates, which are resistant to systematic errors in their implementation. Single qubit gates based on…

Quantum Physics · Physics 2009-11-11 Li Xiao , Jonathan A. Jones

The capacity to randomly pick a unitary across the whole unitary group is a powerful tool across physics and quantum information. A unitary $t$-design is designed to tackle this challenge in an efficient way, yet constructions to date rely…

Quantum Physics · Physics 2020-02-19 Rawad Mezher , Joe Ghalbouni , Joseph Dgheim , Damian Markham

In this paper, we present the experimental realization of multi-qubit gates $% \Lambda_n(not) $ in macroscopic ensemble of three-qubit and four-qubit molecules. Instead of depending heavily on the two-bit universal gate, which served as the…

Quantum Physics · Physics 2009-11-06 J. F. Du , M. J. Shi , J. H. Wu , X. Y. Zhou , R. D. Han