English
Related papers

Related papers: A universal quantum circuit for two-qubit transfor…

200 papers

Gate-based quantum computation has been extensively investigated using quantum circuits based on qubits. In many cases, such qubits are actually made out of multilevel systems but with only two states being used for computational purpose.…

In this note we present explicit canonical forms for all the elements in the two-qubit CNOT-Dihedral group, with minimal numbers of controlled-S (CS) and controlled-X (CX) gates, using the generating set of quantum gates [X, T, CX, CS]. We…

Quantum Physics · Physics 2020-12-10 Shelly Garion , Andrew W. Cross

Circuit cutting, the partitioning of quantum circuits into smaller independent fragments, has become a promising avenue for scaling up current quantum-computing experiments. Here, we introduce a scheme for joint cutting of two-qubit…

Efficient verification of the functioning of quantum devices is a key to the development of quantum technologies, but is a daunting task as the system size increases. Here we propose a simple and general framework for verifying unitary…

Quantum Physics · Physics 2020-04-17 Huangjun Zhu , Haoyu Zhang

We study the resources required to achieve universal quantum computing via the gate sets that provide the fundamental instructions from which quantum algorithms are built. While single-gate universal sets are known, they rely on precisely…

Quantum Physics · Physics 2026-02-24 Robin Kaarsgaard

We present a quantum SWAP gate valid for quantum systems of an arbitrary dimension. The gate generalizes the CNOT implementation of the SWAP gate for qubits and keeps its most important properties, like symmetry and simplicity. We only use…

Quantum Physics · Physics 2014-09-30 Juan Carlos Garcia-Escartin , Pedro Chamorro-Posada

Future quantum devices often rely on favourable scaling with respect to the system components. To achieve desirable scaling, it is therefore crucial to implement unitary transformations in an efficient manner. We develop an upper bound for…

Quantum Physics · Physics 2018-06-13 Christian Arenz , Herschel Rabitz

We study in detail the algebraic structures underlying quantum circuits generated by CNOT gates. Our results allow us to propose polynomial-time heuristics to reduce the number of gates used in a given CNOT circuit and we also give…

Quantum Physics · Physics 2020-12-18 Marc Bataille

A quantum circuit is generalized to a nonunitary one whose constituents are nonunitary gates operated by quantum measurement. It is shown that a specific type of one-qubit nonunitary gates, the controlled-NOT gate, as well as all one-qubit…

Quantum Physics · Physics 2011-01-11 Hiroaki Terashima , Masahito Ueda

We supply a rigorous proof that an open dense set of all possible 2-qubit gates G has the property that if the quantum circuit model is restricted to only permit swap of qubits lines and the application of G to pairs of lines, then the…

Group Theory · Mathematics 2014-05-21 Bela Bauer , Claire Levaillant , Michael Freedman

Cat qubits have emerged as a promising candidate for quantum computation due to their higher error-correction thresholds and low resource overheads. In existing literature, the detuning of the two-photon drive is assumed to be zero for…

Quantum Physics · Physics 2024-07-31 A. Schlabes , R. Bhowmick , M. H. Ansari

We describe a method for achieving arbitrary 1-qubit gates and controlled-NOT gates within the context of the Single Cooper Pair Box (SCB) approach to quantum computing. Such gates are sufficient to support universal quantum computation.…

Quantum Physics · Physics 2007-05-23 P. Echternach , C. P. Williams , S. C. Dultz , P. Delsing , S. L. Braunstein , J. P. Dowling

High-fidelity single- and two-qubit gates are essential building blocks for a fault-tolerant quantum computer. While there has been much progress in suppressing single-qubit gate errors in superconducting qubit systems, two-qubit gates…

Near-term quantum computers are limited by the decoherence of qubits to only being able to run low-depth quantum circuits with acceptable fidelity. This severely restricts what quantum algorithms can be compiled and implemented on such…

We give a simple, closed-form formula, what we call the Deflation Identity, for converting any 2-qubit circuit with exactly two controlled-U's (and some 1-qubit rotations) into an equivalent circuit with just two CNOTs (and some 1-qubit…

Quantum Physics · Physics 2007-05-23 Robert R. Tucci

In this paper we apply the canonical decomposition of two qubit unitaries to find pulse schemes to control the proposed Kane quantum computer. We explicitly find pulse sequences for the CNOT, swap, square root of swap and controlled Z…

Quantum Physics · Physics 2009-11-10 Charles D. Hill , Hsi-Sheng Goan

A crucial requirement for quantum information processing is the realization of multiple-qubit quantum gates. Here, we demonstrate an electron spin based all-electrical two-qubit gate consisting of single spin rotations and inter-dot spin…

Quantum Physics · Physics 2015-05-30 R. Brunner , Y. -S. Shin , T. Obata , M. Pioro-Ladrière , T. Kubo , K. Yoshida , T. Taniyama , Y. Tokura , S. Tarucha

We present some compact quantum circuits for a deterministic quantum computing on electron-spin qubits assisted by quantum dots inside single-side optical microcavities, including the CNOT, Toffoli, and Fredkin gates. They are constructed…

Quantum Physics · Physics 2015-03-03 Hai-Rui Wei , Fu-Guo Deng

The most general structure (in matrix form) of a single-qubit gate is presented. Subsequently, used that to obtain a set of conditions for testing (a) whether a given 2-qubit gate is genuinely a 2-qubit gate, i.e., not decomposable into two…

Quantum Physics · Physics 2017-02-22 Kishore Thapliyal , Anirban Pathak

Quantum computing with qudits, quantum systems with $d > 2$ levels, offers a powerful extension beyond qubits, expanding the computational possibilities of quantum systems, allowing the simplification of the implementation of several…

Quantum Physics · Physics 2024-10-10 Francesco Pudda , Mario Chizzini , Luca Crippa
‹ Prev 1 3 4 5 6 7 10 Next ›