Related papers: Universal quantum computation on a semiconductor q…
Even-denominator fractional quantum Hall (FQH) states can be viewed as topological superconductors of composite fermions, supporting a charged chiral mode and $|\mathcal{C}_{cf}|$ neutral Majorana modes set by the Chern number…
The construction of a quantum computer remains a fundamental scientific and technological challenge, in particular due to unavoidable noise. Quantum states and operations can be protected from errors using protocols for fault-tolerant…
Fault-tolerant quantum computing requires a universal gate set, but the necessary non-Clifford gates represent a significant resource cost for most quantum error correction architectures. Magic state cultivation offers an efficient…
For important classes of many-fermion problems, quantum Monte Carlo (QMC) methods allow exact calculations of ground-state and finite-temperature properties, without the sign problem. The list spans condensed matter, nuclear physics, and…
The recently proposed Universal Blind Quantum Computation (UBQC) protocol allows a client to perform an arbitrary quantum computation on a remote server such that perfect privacy is guaranteed if the client is capable of producing random…
We propose to use residual parafermions of the overscreened Kondo effect for topological quantum computation. A superconducting proximity gap of $\Delta<T_K$ can be utilized to isolate the parafermion from the continuum of excitations and…
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…
We propose a scheme to implement quantum computation in decoherence-free subspace with superconducting devices inside a cavity by unconventional geometric manipulation. Universal single-qubit gates in encoded qubit can be achieved with…
We describe how continuous-variable abelian anyons, created on the surface of a continuous-variable analogue of Kitaev's lattice model can be utilized for quantum computation. In particular, we derive protocols for the implementation of…
Measurement-based quantum computation describes a scheme where entanglement of resource states is utilized to simulate arbitrary quantum gates via local measurements. Recent works suggest that symmetry-protected topologically non-trivial,…
The search for a Majorana Fermion has been an area of intense interest in condensed matter research of late. This elusive particle, predicted to exist in 1937, has been sought after for both fundamental and practical reasons. On the…
The Gottesman-Knill theorem holds that operations from the Clifford group, when combined with preparation and detection of qubit states in the computational basis, are insufficient for universal quantum computation. Indeed, any measurement…
Quantum computation provides great speedup over its classical counterpart for certain problems. One of the key challenges for quantum computation is to realize precise control of the quantum system in the presence of noise. Control of the…
Majorana fermions, quantum particles that are their own anti-particles, are not only of fundamental importance in elementary particle physics and dark matter, but also building blocks for fault-tolerant quantum computation. Recently…
Two classes of topological superconductors and Majorana modes in condensed matter systems are known to date: one, in which impurity disorder strongly suppresses topological superconducting gap and is detrimental to Majorana modes, and the…
We present a new scheme for Majorana modes in systems with nonsymmporhic-symmetry-protected band degeneracy. We reveal that when the gapless fermionic excitations are encoded with conventional superconductivity and magnetism, which can be…
Contemporary quantum computers encode and process quantum information in binary qubits (d = 2). However, many architectures include higher energy levels that are left as unused computational resources. We demonstrate a superconducting…
Any residual coupling of a quantum computer to the environment results in computational errors. Encoding quantum information in a so-called decoherence-free subspace provides means to avoid these errors. Despite tremendous progress in…
We study the computation power of lattices composed of two dimensional systems (qubits) on which translationally invariant global two-qubit gates can be performed. We show that if a specific set of 6 global two qubit gates can be performed,…
Building a quantum computer is a daunting challenge since it requires good control but also good isolation from the environment to minimize decoherence. It is therefore important to realize quantum gates efficiently, using as few operations…