Related papers: Universal quantum computation in the surface code …
Practical applications of quantum computing depend on fault-tolerant devices with error correction. Today, the most promising approach is a class of error-correcting codes called surface codes. We study the problem of compiling quantum…
The surface code is a powerful quantum error correcting code that can be defined on a 2-D square lattice of qubits with only nearest neighbor interactions. Syndrome and data qubits form a checkerboard pattern. Information about errors is…
Recently, operator quantum error-correcting codes have been proposed to unify and generalize decoherence free subspaces, noiseless subsystems, and quantum error-correcting codes. This note introduces a natural construction of such codes in…
A central challenge for the scaling of quantum computing systems is the need to control all qubits in the system without a large overhead. A solution for this problem in classical computing comes in the form of so called crossbar…
We revisit the question of universality in quantum computing and propose a new paradigm. Instead of forcing a physical system to enact a predetermined set of universal gates (e.g., single-qubit operations and CNOT), we focus on the…
Scalable quantum computation in realistic devices requires that precise control can be implemented efficiently in the presence of decoherence and operational errors. We propose a general constructive procedure for designing robust unitary…
Holonomic quantum computation exploits a quantum state's non-trivial, matrix-valued geometric phase (holonomy) to perform fault-tolerant computation. Holonomies arising from systems where the Hamiltonian traces a continuous path through…
We present a universal fault-tolerant quantum computing architecture based on identical particle qubits (IPQs), where we find that the first-order IPQ - bath interaction fundamentally differs from the conventional first-order qubit-bath…
Using electrostatic gates to control the electron positions, we present a new controlled-NOT gate based on quantum dots. The qubit states are chosen to be the spin states of an excess conductor electron in the quantum dot; and the main…
A universal set of quantum gates is constructed for the recently developed jump-error correcting quantum codes. These quantum codes are capable of correcting errors arising from the spontaneous decay of distinguishable qubits into…
Fault-tolerant, error-corrected quantum computation is commonly acknowledged to be crucial to the realisation of large-scale quantum algorithms that could lead to extremely impactful scientific or commercial results. Achieving a universal…
We show that universal holonomic quantum computation (HQC) can be achieved fault-tolerantly by adiabatically deforming the gapped stabilizer Hamiltonian of the surface code, where quantum information is encoded in the degenerate ground…
We propose a universal gate set for quantum computing with all-to-all connectivity and intrinsic robustness to bit-flip errors based on parity encoding. We show that logical controlled phase gate and $R_z$ rotations can be implemented in…
A quantum error correcting code protects encoded logical information against errors. Transversal gates are a naturally fault-tolerant way to manipulate logical qubits but cannot be universal themselves. Protocols such as magic state…
A geometrical approach to quantum computation is presented, where a non-abelian connection is introduced in order to rewrite the evolution operator of an energy degenerate system as a holonomic unitary. For a simple geometrical model we…
The hybrid approach to quantum computation simultaneously utilizes both discrete and continuous variables which offers the advantage of higher density encoding and processing powers for the same physical resources. Trapped ions, with…
A remarkable characteristic of quantum computing is the potential for reliable computation despite faulty qubits. This can be achieved through quantum error correction, which is typically implemented by repeatedly applying static syndrome…
Quantum algorithms for unstructured search problems rely on the preparation of a uniform superposition, traditionally achieved through Hadamard gates. However, this incidentally creates an auxiliary search space consisting of nonsensical…
The fragile nature of quantum information limits our ability to construct large quantities of quantum bits suitable for quantum computing. An important goal, therefore, is to minimize the amount of resources required to implement quantum…
Quantum error correction protocols will play a central role in the realisation of quantum computing; the choice of error correction code will influence the full quantum computing stack, from the layout of qubits at the physical level to…