Related papers: Shortest Route to Non-Abelian Topological Order on…
Gauge theories, while describing fundamental interactions in nature, also emerge in a wide variety of physical systems. Abelian gauge fields have been predicted and observed in a number of novel quantum many-body systems, topological…
Very recently, increasing attention has been focused on non-Abelian topological charges, e.g. the quaternion group Q8. Different from Abelian topological band insulators, these systems involve multiple tangled bulk bandgaps and support…
Given an integer $D$ and an ordinary isogeny class of abelian varieties defined over a finite field $\mathbb{F}_q$ with commutative $\mathbb{F}_q$-endomorphism algebra, we provide algorithms for computing all isogenies of degree dividing…
Braiding and fusion rules of topological excitations are indispensable topological invariants in topological quantum computation and topological orders. While excitations in 2D are always particle-like anyons, those in 3D incorporate not…
Non-Abelian quantum holonomies, i.e., unitary state changes solely induced by geometric properties of a quantum system, have been much under focus in the physics community as generalizations of the Abelian Berry phase. Apart from being a…
A quantum computer can perform exponentially faster than its classical counterpart. It works on the principle of superposition. But due to the decoherence effect, the superposition of a quantum state gets destroyed by the interaction with…
Systems displaying quantum topological order feature robust characteristics that are very attractive to quantum computing schemes. Topological quantum field theories have proven to be powerful in capturing the quintessential attributes of…
Variational quantum eigensolver (VQE) is a promising algorithm suitable for near-term quantum machines. VQE aims to approximate the lowest eigenvalue of an exponentially sized matrix in polynomial time. It minimizes quantum resource…
Solving linear ordinary differential equations (ODE) is one of the most promising applications for quantum computers to demonstrate exponential advantages. The challenge of designing a quantum ODE algorithm is how to embed non-unitary…
Holonomies, arising from non-Abelian geometric transformations of quantum states in Hilbert space, offer a promising way for quantum computation. These holonomies are not commutable and thus can be used for the realization of a universal…
The Fibonacci topological order is the simplest platform for a universal topological quantum computer, consisting of a single type of non-Abelian anyon, $\tau$, with fusion rule $\tau\times\tau=1+\tau$. While it has been proposed that the…
Ising-type non-Abelian anyons are likely to occur in a number of physical systems, including quantum Hall systems, where recent experiments support their existence. In general, non-Abelian anyons may be utilized to provide a topologically…
Recent theoretical insights into the possibility of non-Abelian phases in $\nu=2/3$ fractional quantum Hall states revived the interest in the numerical phase diagram of the problem. We investigate the effect of various kinds of two-body…
Non-Abelian topological order (TO) enables topologically protected quantum computation with its anyonic quasiparticles. Recently, TO with $S_3$ gauge symmetry was identified as a sweet spot -- simple enough to emerge from finite-depth…
Ubiquitous in quantum computing is the step to encode data into a quantum state. This process is called quantum state preparation, and its complexity for non-structured data is exponential on the number of qubits. Several works address this…
We present an operational procedure to transform global symmetries into local symmetries at the level of individual quantum states, as opposed to typical gauging prescriptions for Hamiltonians or Lagrangians. We then construct a compatible…
When we consider a finite abelian group acting linearly on a polynomial ring, we can find monomial generators for the subring of invariants. By Noether's degree bound and Hilbert's finiteness theorem, we know that there are finitely many…
We describe the simulation of dihedral gauge theories on digital quantum computers. The nonabelian discrete gauge group $D_N$ -- the dihedral group -- serves as an approximation to $U(1)\times\mathbb{Z}_2$ lattice gauge theory. In order to…
One-way quantum computing achieves the full power of quantum computation by performing single particle measurements on some many-body entangled state, known as the resource state. As single particle measurements are relatively easy to…
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…