Related papers: Transversal AND in Quantum Codes
Uniformly controlled one-qubit gates are quantum gates which can be represented as direct sums of two-dimensional unitary operators acting on a single qubit. We present a quantum gate array which implements any n-qubit gate of this type…
We present a native three-qubit entangling gate that exploits engineered interactions to realize control-control-target and control-target-target operations in a single coherent step. Unlike conventional decompositions into multiple…
We present an algorithm to construct quantum circuits for encoding and inverse encoding of quantum convolutional codes. We show that any quantum convolutional code contains a subcode of finite index which has a non-catastrophic encoding…
We present an algorithm for efficiently approximating of qubit unitaries over gate sets derived from totally definite quaternion algebras. It achieves $\varepsilon$-approximations using circuits of length $O(\log(1/\varepsilon))$, which is…
We show a significant reduction of the number of quantum operations and the improvement of the circuit depth for the realization of the Toffoli gate by using qudits. This is done by establishing a general relation between the dimensionality…
In this short review, I draw attention to new developments in the theory of fault tolerance in quantum computation that may give concrete direction to future work in the development of superconducting qubit systems. The basics of quantum…
Implementing quantum algorithms on realistic hardware requires translating high-level global operations into sequences of native elementary gates, a process known as quantum compiling. Physical limitations, such as constraints in…
The usual scenario in fault tolerant quantum computation involves certain amount of qubits encoded in each code block, transversal operations between them and destructive measurements of ancillary code blocks. We introduce a new approach in…
Fault-tolerant quantum computers which can solve hard problems rely on quantum error correction. One of the most promising error correction codes is the surface code, which requires universal gate fidelities exceeding the error correction…
Accurate and efficient implementation of parallel quantum gates is crucial for scalable quantum information processing. However, the unavoidable crosstalk between qubits in current noisy processors impedes the achievement of high gate…
The challenge of quantum computing is to combine error resilience with universal computation. Diagonal gates such as the transversal $T$ gate play an important role in implementing a universal set of quantum operations. This paper…
We propose a scheme for the implementation of quantum gates which is based on the qubit encoding in antiferromagnetic molecular rings. We show that a proper engineering of the intercluster link would result in an effective coupling that…
Two-level quantum systems, qubits, are not the only basis for quantum computation. Advantages exist in using qudits, d-level quantum systems, as the basic carrier of quantum information. We show that color codes, a class of topological…
One of the leading quantum computing architectures is based on the two-dimensional (2D) surface code. This code has many advantageous properties such as a high error threshold and a planar layout of physical qubits where each physical qubit…
We present quantum circuits to implement an exhaustive key search for the Advanced Encryption Standard (AES) and analyze the quantum resources required to carry out such an attack. We consider the overall circuit size, the number of qubits,…
We present a quantum algorithm for multiplying two $n$-bit integers with overall circuit depth and $T$-depth both bounded by $O(\log^{2} n)$, while using $O(n^{2})$ gates and ancillary qubits. Our construction generates partial products via…
Of the many potential hardware platforms, superconducting quantum circuits have become the leading contender for constructing a scalable quantum computing system. All current architecture designs necessitate a 2D arrangement of…
Recently it has been shown that Repeat-Until-Success (RUS) circuits can approximate a given single-qubit unitary with an expected number of $T$ gates of about $1/3$ of what is required by optimal, deterministic, ancilla-free decompositions…
Specific quantum algorithms exist to-in theory-break elliptic curve cryptographic protocols. Implementing these algorithms requires designing quantum circuits that perform elliptic curve arithmetic. To accurately judge a cryptographic…
A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environment. The new basis consists of two single-qubit gates…