Related papers: Tilted Interferometry Realizes Universal Quantum C…
We show how extended topological quantum field theories (TQFTs) can be used to obtain a kinematical setup for quantum gravity, i.e. a kinematical Hilbert space together with a representation of the observable algebra including operators of…
We study quantum field theories which have quantum groups as global internal symmetries. We show that in such theories operators are generically non-local, and should be thought as living at the ends of topological lines. We describe the…
Majorana-based quantum gates are not complete for performing universal topological quantum computation while Fibonacci-based gates are difficult to be realized electronically and hardly coincide with the conventional quantum circuit models.…
We consider how the Hamiltonian Quantum Computing scheme introduced in [arXiv:1509.01278] can be implemented using a 2D array of superconducting transmon qubits. We show how the scheme requires the engineering of strong attractive…
We show how quantum metrology protocols that seek to estimate the parameters of a Hamiltonian that exhibits a quantum phase transition can be efficiently simulated on an exponentially smaller quantum computer. Specifically, by exploiting…
Quantum computing is a promising new area of computing with quantum algorithms offering a potential speedup over classical algorithms if fault tolerant quantum computers can be built. One of the first applications of the classical computer…
We provide a characterization of tunneling between coupled topological insulators in 2D and 3D under the influence of a ferromagnetic layer. We explore conditions for such systems to exhibit integer quantum Hall physics and localized…
This is the first in a series of papers on an attempt to understand quantum field theory mathematically. In this paper we shall introduce and study BV QFT algebra and BV QFT as the proto-algebraic model of quantum field theory by exploiting…
We show that universal quantum computation can be achieved in the standard pure-state circuit model while, at any time, the entanglement entropy of all bipartitions is small---even tending to zero with growing system size. The result is…
Universal quantum computation requires the implementation of arbitrary control operations on the quantum register. In most cases, this is achieved by external control fields acting selectively on each qubit to drive single-qubit operations.…
Quantum error correction is an essential tool for reliably performing tasks for processing quantum information on a large scale. However, integration into quantum circuits to achieve these tasks is problematic when one realizes that…
One potential route toward fault-tolerant universal quantum computation is to use non-Abelian topological codes. In this work, we investigate how to achieve this goal with the quantum double model $\mathcal{D}(S_3)$ -- a specific…
Quantum state transfer between cavities is crucial for quantum information processing and quantum computation in optomechanical systems. Here, we present the first scheme for the transitionless intra-cavity quantum state transfer based on…
Measurement-based quantum computation is a model for quantum information processing utilizing local measurements on suitably entangled resource states for the implementation of quantum gates. A complete characterization for universal…
In this work, we propose and study in depth a universal quantum computing architecture based on a quantum construction of transistors. Our teleportation-based quantum transistors, called ``telesistors'', are ground states of systems with…
The Solovay-Kitaev algorithm is a fundamental result in quantum computation. It gives an algorithm for efficiently compiling arbitrary unitaries using universal gate sets: any unitary can be approximated by short gates sequences, whose…
Topological quantum phases cannot be characterized by Ginzburg-Landau type order parameters, and are instead described by non-local topological invariants. Experimental platforms capable of realizing such exotic states now include…
We consider the model of quantum computer, which is represented as a Ising spin lattice, where qubits (spin-half systems) are separated by the isolators (two spin-half systems). In the idle mode or at the single bit operations the total…
A medium-scale quantum computer with full universal quantum computing capability is necessary for various practical aims and testing applications. Here we report a 34-qubit quantum virtual machine (QtVM) based on a medium server. Our QtVM…
A problem of universality in simulation of evolution of quantum system and in theory of quantum computations is related with the possibility of expression or approximation of arbitrary unitary transformation by composition of specific…