Related papers: Preparing topological states with finite depth sim…
The study of gapped quantum many-body systems in three spatial dimensions has uncovered the existence of quantum states hosting quasiparticles that are confined, not by energetics but by the structure of local operators, to move along lower…
We present two protocols for implementing deterministic non-local multi-qubit quantum gates on qubits coupled to a common cavity mode. The protocols rely only on a classical drive of the cavity modes, while no external drive of the qubits…
Simulating physical systems on near-term quantum computers often requires preparing states within constrained subspaces, like those with fixed particle number or spin. We use Lie algebraic techniques to prove that hardware-efficient gates…
Current approaches for building quantum computing devices focus on two-level quantum systems which nicely mimic the concept of a classical bit, albeit enhanced with additional quantum properties. However, rather than artificially limiting…
We construct optimized implementations of the CNOT and other universal two-qubit gates that, unlike many of the previously proposed protocols, are carried out in a single step. The new protocols require tunable inter-qubit couplings but, in…
We construct a sequence of multi-site gates which transform an easily constructed product state into an approximation to the superfluid ground state of the Bose-Hubbard model. The mapping is exact in the one dimensional hard core limit, and…
We propose a family of explicit geometrically local circuits on a 2-dimensional planar grid of qudits, realizing any abelian non-chiral topological phase as an actively error-corrected fault-tolerant memory. These circuits are constructed…
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 present a scalable uniform technique for construction of highly conditional C$^n$-NOT quantum gates of trapped ion qubits, such as the Toffoli gate, without using ancilla states and circuits of an exorbitant number of concatenated one-…
It has long been known that long-ranged entangled topological phases can be exploited to protect quantum information against unwanted local errors. Indeed, conditions for intrinsic topological order are reminiscent of criteria for faithful…
We show how to prepare any graph state of up to 12 qubits with: (a) the minimum number of controlled-Z gates, and (b) the minimum preparation depth. We assume only one-qubit and controlled-Z gates. The method exploits the fact that any…
We discuss the procedure for gauging on-site $\mathbb{Z}_2$ global symmetries of three-dimensional lattice Hamiltonians that permute quasi-particles and provide general arguments demonstrating the non-Abelian character of the resultant…
We present an efficient quantum algorithm for preparing a pure state on a quantum computer, where the quantum state corresponds to that of a molecular system with a given number $m$ of electrons occupying a given number $n$ of spin…
The notion of universal quantum computation can be generalized to multi-level qudits, which offer advantages in resource usage and algorithmic efficiencies. Trapped ions, which are pristine and well-controlled quantum systems, offer an…
In this paper, the degenerate ground states of Z2 topological order on a plane with holes (the so-called surface codes) are used as the protected code subspace to build a topological quantum computer by tuning their quantum tunneling…
We propose a scheme to perform basic gates of quantum computing and prepare entangled states in a system with cold trapped ions located in a single mode optical cavity. General quantum computing can be made with both motional state of the…
A fundamental question in the theory of quantum computation is to understand the ultimate space-time resource costs for performing a universal set of logical quantum gates to arbitrary precision. Here we demonstrate that non-Abelian anyons…
In order to achieve fault-tolerant quantum computation, we need to repeat the following sequence of four steps: First, perform 1 or 2 qubit quantum gates (in parallel if possible). Second, do a syndrome measurement on a subset of the…
We provide explicit constant-depth local unitary circuits that realize general anyon permutations in Kitaev's quantum double models. This construction can be naturally understood through a correspondence between anyon permutation symmetries…
We review the general strategy of topologically protected quantum information processing based on non-Abelian anyons, in which quantum information is encoded into the fusion channels of pairs of anyons and in fusion paths for multi-anyon…