Related papers: Shortest Route to Non-Abelian Topological Order on…
The non-abelian topological phase with Fibonacci anyons minimally supports universal quantum computation. In order to investigate the possible phase transitions out of the Fibonacci topological phase, we propose a generic quantum-net…
Quantum gates in topological quantum computation are performed by braiding non-Abelian anyons. These braiding processes can presumably be performed with very low error rates. However, to make a topological quantum computation architecture…
In a previous paper [quant-ph/0408045] we described a quantum algorithm to prepare an arbitrary state of a quantum register with arbitrary fidelity. Here we present an alternative algorithm which uses a small number of quantum oracles…
Variational algorithms are a promising paradigm for utilizing near-term quantum devices for modeling electronic states of molecular systems. However, previous bounds on the measurement time required have suggested that the application of…
Recently it has been shown that the non-local correlations needed for measurement based quantum computation (MBQC) can be revealed in the ground state of the Affleck-Kennedy-Lieb-Tasaki (AKLT) model involving nearest neighbor spin-3/2…
A large class of fractional quantum Hall (FQH) states can be classified according to their pattern of zeros, which describes the order of zeros in ground state wave functions as various clusters of electrons are brought together. The…
For a given parent fractional quantum Hall (FQH) state at filling fraction $\nu$, the hierarchy construction produces FQH states at nearby filling fractions $\{\nu_n\}$ by condensing minimally charged quasiholes or quasiparticles of the…
Measurement plays a quintessential role in the control of quantum systems. Beyond initialization and readout which pertain to projective measurements, weak measurements in particular, through their back-action on the system, may enable…
Quantum simulations of non-Abelian gauge theories require efficient mappings onto quantum computers and practical state preparation and measurement procedures. A truncation of the Hilbert space of non-Abelian lattice gauge theories with…
We give a gauge description of the adiabatic charge pumping in closed systems, both in Abelian and non-Abelian processes, and by means of asymptotic Wilson loops in a suitable parameter manifold. Our geometric formulation provides new…
The progress in building quantum computers to execute quantum algorithms has recently been remarkable. Grover's search algorithm in a binary quantum system provides considerable speed-up over classical paradigm. Further, Grover's algorithm…
We present a quantum process-tomography protocol based on a low-degree ansatz for the quantum channel, i.e. when it can be expressed as a fixed-degree polynomial in terms of Pauli operators. We demonstrate how to perform tomography of such…
Designing quantum processors is a complex task that demands advanced verification methods to ensure their correct functionality. However, traditional methods of comprehensively verifying quantum devices, such as quantum process tomography,…
The discovery of topological phases in condensed matter systems has changed the modern conception of phases of matter. The global nature of topological ordering makes these phases robust and hence promising for applications. However, the…
We reconstruct all (2+1)D quantum double models of finite groups from their boundary symmetries through the repeated application of a gauging procedure, extending the existing construction for abelian groups. We employ the recently proposed…
Fractional quantum Hall states have been observed at filling factor $\nu=3/4$ in GaAs hole system and bilayer graphene. In theoretical bootstrap analysis, it was revealed that non-Abelian topological orders with Ising anyons can be realized…
Observation of non-Abelian statistics for the e/4 quasiparticles in the \nu=5/2 fractional quantum Hall state remains an outstanding experimental problem. The non-Abelian statistics are linked to the presence of additional low energy states…
In quantum computing the decoherence time of the qubits determines the computation time available and this time is very limited when using current hardware. In this paper we minimize the execution time (the depth) for a class of circuits…
Adiabatic quantum optimization is a procedure to solve a vast class of optimization problems by slowly changing the Hamiltonian of a quantum system. The evolution time necessary for the algorithm to be successful scales inversely with the…
A crucial subroutine in quantum computing is to load the classical data of $N$ complex numbers into the amplitude of a superposed $n=\lceil \log_2N\rceil$-qubit state. It has been proven that any algorithm universally implementing this…