Related papers: Controlled not connectivity in the Clifford group

Arithmetic operations are an important component of many quantum algorithms. As such, coming up with optimized quantum circuits for these operations leads to more efficient implementations of the corresponding algorithms. In this paper, we…

We analyse the implementation of a fast nonadiabatic CZ gate between two transmon qubits with tuneable coupling. The gate control method is based on a theory of dynamical invariants which leads to reduced leakage and robustness against…

Universal quantum computing relies on high-fidelity entangling operations. Here we demonstrate that four coupled qubits can operate as a quantum gate, where two qubits control the operation on two target qubits (a four-qubit gate). This…

We discuss a measurement-based implementation of a controlled-NOT (CNOT) quantum gate. Such a gate has recently been discussed for free electron qubits. Here we extend this scheme for qubits encoded in product states of two (or more)…

We consider qubit coupling resulting from the capacitive coupling between two double quantum dot (DQD) single-triplet qubits. Calculations of the coupling when the two DQDs are detuned symmetrically or asymmetrically are performed using a…

Efficiently implementing Clifford circuits is crucial for quantum error correction and quantum algorithms. Linear reversible circuits, equivalent to circuits composed of CNOT gates, have important applications in classical computing. In…

We show that single-qudit universality in Clifford-based gate sets follows a trichotomy determined by the prime factorization of the local dimension $d$. For prime $d$, any gate outside the Clifford group is universal. For prime-power…

Applications for noisy intermediate-scale quantum computing devices rely on the efficient entanglement of many qubits to reach a potential quantum advantage. Although entanglement is typically generated using two-qubit gates, direct control…

Constructing quantum codes with good parameters and useful transversal gates is a central problem in quantum error correction. In this paper, we continue our work in arXiv:2502.01864 and construct the first family of asymptotically good…

We use our Clifford algebra technique, that is nilpotents and projectors which are binomials of the Clifford algebra objects $\gamma^a$ with the property $\{\gamma^a,\gamma^b\}_+ = 2 \eta^{ab}$, for representing quantum gates and quantum…

We propose a scheme for realizing quantum controlled phase gates with two nonidentical quantum dots trapped in two coupled photonic crystal cavities and driven by classical laser fields under the condition of non-small hopping limit. During…

Though Cliffords and matchgates are both examples of classically simulable circuits, they are considered simulable for different reasons. The celebrated Gottesman-Knill explains the simulability Cliffords, and the efficient simulability of…

We use electronic microwave control methods to implement addressed single-qubit gates with high speed and fidelity, for $^{43}\text{Ca}^{+}$ hyperfine "atomic clock" qubits in a cryogenic (100K) surface trap. For a single qubit, we…

Stabilizer codes are a simple and successful class of quantum error-correcting codes. Yet this success comes in spite of some harsh limitations on the ability of these codes to fault-tolerantly compute. Here we introduce a new metric for…

We provide a recursively defined sequence of flag circuits which will detect logical errors induced by non-fault-tolerant $R_{\overline{Z}}(\frac{\pi}{2^l})$ gates on CSS codes with a fault distance of two. As applications, we give a family…

We construct a polynomial-time classical algorithm that samples from the output distribution of noisy geometrically local Clifford circuits with any product-state input and single-qubit measurements in any basis. Our results apply to…

Generating samples from the output distribution of a quantum circuit is a ubiquitous task used as a building block of many quantum algorithms. Here we show how to accomplish this task on a noisy quantum processor lacking full-blown error…

We introduce a scheme for realizing arbitrary controlled-unitary operations in a two qubit system. If the 2 \times 2 unitary matrix is special unitary (has unit determinant), the controlled-unitary gate operation can be realized in a single…

We give an algorithm which produces a unique element of the Clifford group $\mathcal{C}_n$ on $n$ qubits from an integer $0\le i < |\mathcal{C}_n|$ (the number of elements in the group). The algorithm involves $O(n^3)$ operations. It is a…

We propose a Lyapunov control design to achieve specific (or a family of) unitary time-evolution operators, i.e., quantum gates in the Schr\"{o}dinger picture by tracking control. Two examples are presented. In the first, we illustrate how…