Related papers: Realizing an exact entangling gate using Fibonacci…
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…
Harnessing non-abelian statistics of anyons to perform quantum computational tasks is getting closer to reality. While the existence of universal anyons by braiding alone such as the Fibonacci anyon is theoretically a possibility,…
Indistinguishability of particles is a fundamental principle of quantum mechanics. For all elementary and quasiparticles observed to date - including fermions, bosons, and Abelian anyons - this principle guarantees that the braiding of…
We propose and analyze a physical system capable of performing topological quantum computation with Majorana zero modes (MZM) in a one-dimensional topological superconductor (1DTS). One of the leading methods to realize quantum gates in…
Quantum compiling, a process that decomposes the quantum algorithm into a series of hardware-compatible commands or elementary gates, is of fundamental importance for quantum computing. We introduce an efficient algorithm based on deep…
A quantum computer can perform exponentially faster than its classical counterpart. It works on the principle of superposition. But due to the decoherence effect, the superposition of a quantum state gets destroyed by the interaction with…
The anyonic excitations of topological two-body color code model are used to implement a set of gates. Because of two-body interactions, the model can be simulated in optical lattices. The excitations have nontrivial mutual statistics, and…
Which gates are universal for quantum computation? Although it is well known that certain gates on two-level quantum systems (qubits), such as the controlled-not (CNOT), are universal when assisted by arbitrary one-qubit gates, it has only…
We introduce a pentagon equation solver, available as part of SageMath, and use it to construct braid group representations associated to certain anyon systems. We recall the category-theoretic framework for topological quantum computation…
A convenient and effective way in the quantum double model to study anyons in a topological space with a tensor product structure is to create and braid anyons using ribbon operators connected to a common base site [A. Kitaev Ann.\ Phys.…
We propose a new fast scalable method for achieving a two-qubit entangling gate between arbitrary distant qubits in a network by exploiting dispersionless propagation in uniform chains. This is achieved dynamically by switching on a strong…
Optimal control theory is a versatile tool that presents a route to significantly improving figures of merit for quantum information tasks. We combine it here with the geometric theory for local equivalence classes of two-qubit operations…
Superconducting qubits are a promising candidate for building a quantum computer. A continued challenge for fast yet accurate gates to minimize the effects of decoherence. Here we apply numerical methods to design fast entangling gates,…
Entangling gates are an essential component of quantum computers. However, generating high-fidelity gates, in a scalable manner, remains a major challenge in all quantum information processing platforms. Accordingly, improving the fidelity…
We provide an analytic way to implement any arbitrary two-qubit unitary operation, given an entangling two-qubit gate together with local gates. This is shown to provide explicit construction of a universal quantum circuit that exactly…
We investigate capacitively coupled two-qubit quantum gates based on quantum dots. For exchange-only coded qubits electron spin $S$ and its projection $S_z$ are exact quantum numbers. Capacitive coupling between qubits, as distinct from…
The realization of strong photon-photon interactions has presented an enduring challenge across photonics, particularly in quantum computing, where two-photon gates form essential components for scalable quantum information processing…
The three-spin-$1/2$ decoherence-free subsystem defines a logical qubit protected from collective noise and supports exchange-only universal gates. Such logical qubits are well-suited for implementation with electrically-defined quantum…
A universal quantum computer can be constructed using abelian anyons. Two qubit quantum logic gates such as controlled-NOT operations are performed using topological effects. Single-anyon operations such as hopping from site to site on a…
Quantum algorithms on near-term quantum processors are typically executed using shallow quantum circuits composed of one- and two-qubit gates. However, as circuit depth and gate number increase, gate imperfections and qubit decoherence…