Related papers: Robust universal Hamiltonian quantum computing usi…
We show, for the first time, that continuous dynamical decoupling can preserve the coherence of a two-qubit state as it evolves during a SWAP quantum operation. Hence, because the Heisenberg exchange interaction alone can be used for…
A cluster state cannot be a unique ground state of a two-body interacting Hamiltonian. Here, we propose the creation of a cluster state of logical qubits encoded in spin-1/2 particles by adiabatically weakening two-body interactions. The…
In the absence of fault tolerant quantum error correction for analog, Hamiltonian quantum computation, error suppression via energy penalties is an effective alternative. We construct families of distance-$2$ stabilizer subsystem codes we…
Holonomic quantum computation exploits the geometric evolution of eigenspaces of a degenerate Hamiltonian to implement unitary evolution of computational states. In this work we introduce a framework for performing scalable quantum…
The nonadiabatic geometric quantum computation is promising as it is robust against certain types of local noises. However, its experimental implementation is challenging due to the need of complex control on multi-level and/or multiple…
Perturbative gadgets are a tool to encode part of a Hamiltonian, usually the low-energy subspace, into a different Hamiltonian with favorable properties, for instance, reduced locality. Many constructions of perturbative gadgets have been…
While quantum simulators promise to explore quantum many-body physics beyond classical computation, their capabilities are limited by the available native interactions in the hardware. On many platforms, accessible Hamiltonians are largely…
We present a simple quantum many-body system - a two-dimensional lattice of qubits with a Hamiltonian composed of nearest-neighbor two-body interactions - such that the ground state is a universal resource for quantum computation using…
We present control schemes for open quantum systems that combine decoupling and universal control methods with coding procedures. By exploiting a general algebraic approach, we show how appropriate encodings of quantum states result in…
Quantum information processing requires a high degree of isolation from the detrimental effects of the environment as well as an extremely precise level of control on the way quantum dynamics unfolds in the information-processing system. In…
Due to its geometric nature, holonomic quantum computation is fault-tolerant against certain types of control errors. Although proposed more than a decade ago, the experimental realization of holonomic quantum computation is still an open…
Experimental implementations of quantum computer architectures are now being investigated in many different physical settings. The full set of requirements that must be met to make quantum computing a reality in the laboratory [1] is…
To implement a set of universal quantum logic gates based on non-Abelian geometric phases, it is a conventional wisdom that quantum systems beyond two levels are required, which is extremely difficult to fulfil for superconducting qubits,…
We present a scalable framework for accurately modeling many-body interactions in surface-code quantum processor units (QPUs). Combining a concise diagrammatic formalism with high-precision numerical methods, our approach efficiently…
Adiabatic quantum computing is a universal model for quantum computing whose implementation using a gate-based quantum computer requires depths that are unreachable in the early fault-tolerant era. To mitigate the limitations of near-term…
In this work we extend the notion of universal quantum Hamiltonians to the setting of translationally-invariant systems. We present a construction that allows a two-dimensional spin lattice with nearest-neighbour interactions, open…
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…
At present, several models for quantum computation have been proposed. Adiabatic quantum computation scheme particularly offers this possibility and is based on a slow enough time evolution of the system, where no transitions take place. In…
We give a careful proof that a parallelized version of adiabatic quantum computation can efficiently simulate universal gate model quantum computation. The proof specifies an explicit parameter-dependent Hamiltonian $H({\lambda})$ that is…
Implementing a qubit quantum computer in continuous-variable systems conventionally requires the engineering of specific interactions according to the encoding basis states. In this work, we present a unified formalism to conduct universal…