Related papers: Universal Quantum Gate Set from Multiple-Braiding …
This is a systematic introduction for physicists to the theory of algebras and groups with braid statistics, as developed over the last three years by the author. There are braided lines, braided planes, braided matrices and braided groups…
We construct some braided quantum groups over the circle group. These are analogous to the free orthogonal quantum groups and generalise the braided quantum SU(2) groups for complex deformation parameter. We describe their irreducible…
We propose a scalable scheme for optical quantum computing using measurement-induced continuous-variable quantum gates in a loop-based architecture. Here, time-bin-encoded quantum information in a single spatial mode is deterministically…
Quantum contextuality, a fundamental feature distinguishing quantum theory from classical models, is investigated via algebraic and topological structures inherent in modular tensor categories. This work rigorously demonstrates that braid…
In quantum control theory, a question of fundamental and practical interest is how an arbitrary unitary transformation can be decomposed into minimum number of elementary rotations for implementation, subject to various physical…
Exactly solvable models of topologically ordered phases with non-abelian anyons typically require complicated many-body interactions which do not naturally appear in nature. This motivates the "inverse problem" of quantum many-body physics:…
A possibility of performing the C-NOT gate operation at the ground and the first excited states of two harmonic oscillators interacting via a two-level system subject to complete control is demonstrated. The system resembles Turing machine,…
While there is a general consensus about the structure of one qubit operations in topological quantum computer, two qubits are as usual a more difficult and complex story of different attempts with varying approaches, problems and…
Uniformly controlled one-qubit gates are quantum gates which can be represented as direct sums of two-dimensional unitary operators acting on a single qubit. We present a quantum gate array which implements any n-qubit gate of this type…
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…
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…
The Fibonacci topological order is the prime candidate for the realization of universal topological quantum computation. We devise minimal quantum circuits to demonstrate the non-Abelian nature of the doubled Fibonacci topological order, as…
Gate-based quantum computers typically encode and process information in two-dimensional units called qubits. Using $d$-dimensional qudits instead may offer intrinsic advantages, including more efficient circuit synthesis, problem-tailored…
We develop invariant theory for the quantum group ${\rm U}_q$ of $G_2$ at generic $q$ in the setting of braided symmetric algebras. Let ${\mathcal A}_m$ be the braided symmetric algebra over $m$-copies of the $7$-dimensional simple ${\rm…
This article proposes a formalism which unifies Hamiltonian simulation techniques from different fields. This formalism leads to a competitive method to construct the Hamiltonian simulation with a comprehensible, simple-to-implement circuit…
The trinification grand unified theory (GUT) has gauge group SU(3)^3 and a discrete symmetry permuting the SU(3) factors. In common with other GUTs, the attractive nature of the fermionic multiplet assignments is obviated by the complicated…
We give quantum circuits that simulate an arbitrary two-qubit unitary operator up to global phase. For several quantum gate libraries we prove that gate counts are optimal in worst and average cases. Our lower and upper bounds compare…
Quantum simulations of many-body systems using 2-qubit Yang-Baxter gates offer a benchmark for quantum hardware. This can be extended to the higher dimensional case with $n$-qubit generalisations of Yang-Baxter gates called $n$-simplex…
We study the computation power of lattices composed of two dimensional systems (qubits) on which translationally invariant global two-qubit gates can be performed. We show that if a specific set of 6 global two qubit gates can be performed,…
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…