English
Related papers

Related papers: Optimal Synthesis of Multi-Controlled Qudit Gates

200 papers

One of the challenges in quantum computing is the synthesis of unitary operators into quantum circuits with polylogarithmic gate complexity. Exact synthesis of generic unitaries requires an exponential number of gates in general. We propose…

Quantum Physics · Physics 2020-11-24 Daan Camps , Roel Van Beeumen

In this work, we report on a novel quantum gate approximation algorithm based on the application of parametric two-qubit gates in the synthesis process. The utilization of these parametric two-qubit gates in the circuit design allows us to…

Quantum Physics · Physics 2022-11-16 Péter Rakyta , Zoltán Zimborás

The current phase of quantum computing is in the Noisy Intermediate-Scale Quantum (NISQ) era. On NISQ devices, two-qubit gates such as CNOTs are much noisier than single-qubit gates, so it is essential to minimize their count. Quantum…

Quantum Physics · Physics 2022-03-24 Xin-Chuan Wu , Marc Grau Davis , Frederic T. Chong , Costin Iancu

Some two qubit interactions are singly sufficient for universal quantum computation but not without the use of an ancilla. Recent schemes for universal quantum computation have focused on hybrid physical systems using ancillae. In them, the…

Quantum Physics · Physics 2014-02-03 Kerem Halil-Shah , Daniel K. L. Oi

Compared with the idea of universal quantum computation, a direct synthesis of a multiqubit logic gate can greatly improve the efficiency of quantum information processing tasks. Here we propose an efficient scheme to implement a…

Quantum Physics · Physics 2020-12-02 H. D. Yin , X. X. Li , G. C. Wang , X. Q. Shao

We propose two Clifford+$T$ synthesis algorithms that are optimal with respect to $T$-count. The first algorithm, called deterministic synthesis, approximates any single-qubit unitary by a single-qubit Clifford+$T$ circuit with the minimum…

Quantum Physics · Physics 2025-10-09 Hayata Morisaki , Kaoru Sano , Seiseki Akibue

We study the achievements of quantum circuits comprised of several one- and two-qubit gates. Quantum process matrices are determined for the basic one- and two-qubit gate operations and concatenated to yield the process matrix of the…

Quantum Physics · Physics 2014-04-11 J. Gulliksen , D. D. Bhaktavatsala Rao , K. Mølmer

The Toffoli gate serving as a basic building block for reversible quantum computation, has manifested its great potentials in improving the error-tolerant rate in quantum communication. While current route to the creation of Toffoli gate…

Atomic Physics · Physics 2020-01-15 Dongmin Yu , Yichun Gao , Weiping Zhang , Jinming Liu , Jing Qian

Many quantum algorithms make use of ancilla, additional qubits used to store temporary information during computation, to reduce the total execution time. Quantum computers will be resource-constrained for years to come so reducing ancilla…

Quantum Physics · Physics 2020-02-26 Jonathan M. Baker , Casey Duckering , Frederic T. Chong

We introduce a fault-tolerant construction to implement a composite quantum operation of four overlapping Toffoli gates. The same construction can produce two independent Toffoli gates. This result lowers resource overheads in designs for…

Quantum Physics · Physics 2013-08-06 Cody Jones

There is a recent surge of interest and insights regarding the interplay of quantum optimal control and variational quantum algorithms. We study the framework in the context of qudits which are, for instance, definable as controllable…

Quantum Physics · Physics 2022-10-26 A. Barış Özgüler , Davide Venturelli

We design a circuit structure with linear depth to implement an $n$-qubit Toffoli gate. The proposed construction uses a quadratic-size circuit consists of elementary 2-qubit controlled-rotation gates around the x axis and uses no ancilla…

Quantum Physics · Physics 2015-06-15 Mehdi Saeedi , Massoud Pedram

Algorithms for quantum information processing are usually decomposed into sequences of quantum gate operations, most often realized with single- and two- qubit gates[1]. While such operations constitute a universal set for quantum…

Quantum Physics · Physics 2009-11-13 T. Monz , K. Kim , W. Hänsel , M. Riebe , A. Villar , P. Schindler , M. Chwalla , M. Hennrich , R. Blatt

We present improved circuits for the control-control-phase (Toffoli) gate and the control-swap (Fredkin) gate using three and four global two-qubit gates, respectively. This is a nearly double speed-up compared to the conventional circuits,…

Quantum Physics · Physics 2015-03-19 Svetoslav S. Ivanov , Peter A. Ivanov , Nikolay V. Vitanov

The quantum Toffoli gate allows universal reversible classical computation. It is also an important primitive in many quantum circuits and quantum error correction schemes. Here we demonstrate the realization of a Toffoli gate with three…

Quantum Physics · Physics 2013-02-15 Arkady Fedorov , Lars Steffen , Matthias Baur , M. P. da Silva , Andreas Wallraff

We extend the model of Ancilla Driven Quantum Computation (ADQC) by considering gates with arbitrary entangling power. By giving up stepwise determinism, universal QC can still be achieved through a variable length sequence of single qubit…

Quantum Physics · Physics 2013-03-11 Kerem Halil Shah , Daniel Kuan Li Oi

We examine the detailed scenario for implementing n-control-qubit Toffoli gates and select gates on ion-trap quantum computers, especially those that shuttle ions into interaction zones. We determine expected performance of these gates with…

Quantum Physics · Physics 2021-03-02 Nilesh Goel , J. K. Freericks

By using an ancilla qubit as a mediator, two distant qubits can undergo a non-local entangling unitary operation. This is desirable for when attempting to scale up or distribute quantum computation by combining fixed static local sets of…

Quantum Physics · Physics 2013-11-15 Kerem Halil Shah , Daniel K. L. Oi

Optimal control can be used to significantly improve multi-qubit gates in quantum information processing hardware architectures based on superconducting circuit quantum electrodynamics. We apply this approach not only to dispersive gates of…

Quantum Physics · Physics 2015-05-14 R. Fisher , F. Helmer , S. J. Glaser , F. Marquardt , T. Schulte-Herbrueggen

We present an algorithm for computing depth-optimal decompositions of logical operations, leveraging a meet-in-the-middle technique to provide a significant speed-up over simple brute force algorithms. As an illustration of our method we…

Quantum Physics · Physics 2013-11-28 Matthew Amy , Dmitri Maslov , Michele Mosca , Martin Roetteler
‹ Prev 1 3 4 5 6 7 10 Next ›