Related papers: Extending matchgates into universal quantum comput…
We present a fault-tolerant universal quantum computing architecture based on a code concatenation of biased-noise qubits and the parity architecture. The parity architecture can be understood as an LDPC code tailored specifically to obtain…
In an ordinary quantum algorithm the gates are applied in a fixed order on the systems. The introduction of indefinite causal structures allows to relax this constraint and control the order of the gates with an additional quantum state. It…
Quantum gates are the building blocks of quantum circuits, which in turn are the cornerstones of quantum information processing. In this work, we theoretically investigate a single-step implementation of both a universal two- (CNOT) and…
The perfect NOT transformation, probabilistic perfect NOT transformation and conjugate transformation are studied. Perfect NOT transformation criteria on a quantum state set $S$ of a qubit are obtained. Two necessary and sufficient…
We propose a universal quantum computing scheme in which the orthogonal qubit states $|0>$ and $|1>$ are identical in their single-particle spin and charge properties. Each qubit is contained in a single quantum dot and gate operations are…
We provide several schemes to construct the continuous-variable SWAP gate and present a Hermitian generalized many-body continuous controlled^n-NOT gate. We introduce and study the hybrid controlled-NOT gate and controlled-SWAP gate, and…
It has been shown that, for even $n$, evolving $n$ qubits according to a Hamiltonian that is the sum of pairwise interactions between the particles, can be used to exactly implement an $(n+1)$-qubit fanout gate using a particular…
We improve on the results of [A. Jackson et al. Proc. Natl. Acad. Sci. U.S.A 121 (6). 2024] on the verification of analogue quantum simulators by eliminating the use of universal Hamiltonians, removing the need for two-qubit gates, and no…
Although a universal quantum computer is still far from reach, the tremendous advances in controllable quantum devices, in particular with solid-state systems, make it possible to physically implement "quantum simulators". Quantum…
Quantum circuits with gates (local unitaries) respecting a global symmetry have broad applications in quantum information science and related fields, such as condensed matter theory and quantum thermodynamics. However, despite their…
Near-term quantum computers are primarily limited by errors in quantum operations (or gates) between two quantum bits (or qubits). A physical machine typically provides a set of basis gates that include primitive 2-qubit (2Q) and 1-qubit…
We present some deterministic schemes to construct universal quantum gates, that is, controlled- NOT, three-qubit Toffoli, and Fredkin gates, between flying photon qubits and stationary electron-spin qubits assisted by quantum dots inside…
Quantum computers based on silicon are promising candidates for long term universal quantum computation due to the long coherence times of electron and nuclear spin states. Furthermore, the continuous progress of micro- and nano-…
In order to establish the computational equivalence between quantum Turing machines (QTMs) and quantum circuit families (QCFs) using Yao's quantum circuit simulation of QTMs, we previously introduced the class of uniform QCFs based on an…
Native multi-qubit parity gates have various potential quantum computing applications, such as entanglement creation, logical state encoding and parity measurement in quantum error correction. Here, using simultaneous cross-resonance drives…
The steady increase in control over individual quantum systems has backed the dream of a quantum technology that provides functionalities beyond any classical device. Two particularly promising applications have been explored during the…
Diagonal quantum circuits are quantum circuits comprising only diagonal gates in the computational basis. In spite of a classical feature of diagonal quantum circuits in the sense of commutativity of all gates, their computational power is…
The ability to connect distant qubits plays a fundamental role in quantum computing. Therefore, quantum systems candidates for quantum computation must be able to interact all their constituent qubits. Here, we model the quantum dot spin…
Anyons obtained from a finite gauge theory have a computational power that depends on the symmetry group. The relationship between group structure and computational power is discussed in this paper. In particular, it is shown that anyons…
Virtual $Z$ gates have become integral for implementing fast, high-fidelity single-qubit operations. However, virtual $Z$ gates require that the system's two-qubit gates are microwave-activated or normalise the single-qubit $Z$…