Related papers: Universal Quantum Computation with the nu=5/2 Frac…
The model of a topological quantum computer is a promising one due to its natural resistance to noise and other errors. Operations in such a computer are implemented by braiding the trajectories of anyons. While it is easy to understand how…
The integer and fractional quantum Hall states are known to break down at high dc bias, exhibiting deviation from the ideal incompressible behavior. We measure breakdown of the \nu = 2, 3, 4, 5 integer and the \nu = 4/3 and 5/3 fractional…
Quantum compiling, a process that decomposes the quantum algorithm into a series of hardware-compatible commands or elementary gates, is of fundamental importance for quantum computing. We introduce an efficient algorithm based on deep…
Fourier transform is an essential ingredient in Shor's factoring algorithm. In the standard quantum circuit model with the gate set $\{\U(2), \textrm{CNOT}\}$, the discrete Fourier transforms $F_N=(\omega^{ij})_{N\times N},i,j=0,1,..., N-1,…
We present a systematic numerical construction of a universal quantum gate set for topological quantum computation based on the non-semisimple Ising anyons model. By employing a Genetic Algorithm-enhanced Solovay-Kitaev Algorithm…
Quantum computing promises revolutionary advances in modeling materials and molecules. However, the up-to-date runtime estimates for utility-scale applications on certain quantum hardware systems are in the order of years rendering quantum…
Some models of the 5/2 fractional quantum Hall state predict that the quasi-particles, which carry the charge, have non-Abelian statistics: exchange of two quasi-particles changes the wave function more dramatically than just the usual…
The conductance for tunneling through a point contact between two $\nu =1/3$ quantum Hall edges is described by a universal scaling function, which has recently been measured experimentally. We compute this universal function exactly, by…
Braiding defects in topological stabiliser codes has been widely studied as a promising approach to fault-tolerant quantum computing. Here, we explore the potential and limitations of such schemes in codes of all spatial dimensions. We…
While implementing a quantum algorithm it is crucial to reduce the quantum resources, in order to obtain the desired computational advantage. For most fault-tolerant quantum error-correcting codes the cost of implementing the non-Clifford…
In one-way quantum computation (1WQC) model, universal quantum computations are performed using measurements to designated qubits in a highly entangled state. The choices of bases for these measurements as well as the structure of the…
Non-Abelian topological orders offer an intriguing path towards fault-tolerant quantum computation, where information can be encoded and manipulated in a topologically protected manner immune to arbitrary local noises and perturbations.…
Non-semisimple extensions of the Ising anyon model developed in our previous work enable universal topological quantum computation via braiding alone, overcoming the Clifford-only limitation of semisimple theories. The non-semisimple theory…
Exploring an efficient and scalable architecture of fault-tolerant quantum computing (FTQC) is vital for demonstrating useful quantum computing. Here, we propose and evaluate a scalable and practical architecture with a…
Universal quantum entangling gates are a crucial building block in the large-scale quantum computation and quantum communication, and it is an important task to find simple ways to implement them. Here an effective quantum circuit for the…
Quantum computers promise dramatic speed ups for many computational tasks. For large-scale quantum computation however, the inevitable coupling of physical qubits to the noisy environment imposes a major challenge for a real-life…
Large-scale quantum computation will only be achieved if experimentally implementable quantum error correction procedures are devised that can tolerate experimentally achievable error rates. We describe a quantum error correction procedure…
Continuous-time quantum walk is one of the alternative approaches to quantum computation, where a universal set of quantum gates can be achieved by scattering a quantum walker on some specially-designed structures embedded in a sparse graph…
Noisy quantum simulation is challenging since one has to take into account the stochastic nature of the process. The dominating method for it is the density matrix approach. In this paper, we evaluate conditions for which this method is…
The fractionally charged quasiparticles appearing in the 5/2 fractional quantum Hall plateau are predicted to have an extra non-local degree of freedom, known as topological charge. We show how this topological charge can block the…