Related papers: Universal quantum computing and three-manifolds
There are two types of universality in measurement-based quantum computation (MBQC): ${\it strict}$ and ${\it computational}$. It is well known that the former is stronger than the latter. We present a method of transforming from a certain…
Quantum computation offers the potential to solve fundamental yet otherwise intractable problems across a range of active fields of research. Recently, universal quantum-logic gate sets - the building blocks for a quantum computer - have…
Inspired by connections to two dimensional quantum theory, we define several models of computation based on permuting distinguishable particles (which we call balls), and characterize their computational complexity. In the quantum setting,…
We show that braidings of the metaplectic anyons $X_\epsilon$ in $SO(3)_2=SU(2)_4$ with their total charge equal to the metaplectic mode $Y$ supplemented with measurements of the total charge of two metaplectic anyons are universal for…
An equivalence is established between orthogonal pure state qubits on the Bloch sphere and massless Weyl spinors, when the Bloch vector is taken as the physical three-momentum. A family of unitary, coordinate dependent transformations is…
Using the cubic honeycomb (cubic tessellation) of Euclidean 3-space, we define a quantum system whose states, called quantum knots, represent a closed knotted piece of rope, i.e., represent the particular spatial configuration of a knot…
We prove that universal quantum computation is possible using only (i) the physically natural measurement on two qubits which distinguishes the singlet from the triplet subspace, and (ii) qubits prepared in almost any three different…
We review the canonical quantisation of the geometry of the spacetime in the cases of a simply and a non-simply connected manifold. In the former, we analyse the information contained in the solutions of the Wheeler-DeWitt equation and…
Implementing a qubit quantum computer in continuous-variable systems conventionally requires the engineering of specific interactions according to the encoding basis states. In this work, we present a unified formalism to conduct universal…
The computational efficiency of quantum mechanics can be defined in terms of the qubit circuit model, which is characterized by a few simple properties: each computational gate is a reversible transformation in a connected matrix group;…
We study measurement-based quantum computation (MQC) using as quantum resource the planar code state on a two-dimensional square lattice (planar analogue of the toric code). It is shown that MQC with the planar code state can be efficiently…
We propose a universal quantum computing scheme in which the orthogonal qubit states $|0>$ and $|1>$ are identical in their single-particle spin and charge properties. Each qubit is contained in a single quantum dot and gate operations are…
Physical constraints such as positivity endow the set of quantum states with a rich geometry if the system dimension is greater than two. To shed some light on the complicated structure of the set of quantum states, we consider a…
The 1->3 quantum phase covariant cloning, which optimally clones qubits belonging to the equatorial plane of the Bloch sphere, achieves the fidelity Fcov(1->3)=0.833, larger than for the 1->3 universal cloning Funiv(1->3)=0.778. We show how…
Physical quantum systems are commonly composed of more than two levels and offer the capacity to encode information in higher-dimensional spaces beyond the qubit, starting with the three-level qutrit. Here, we encode neutral-atom qutrits in…
We generalize the $F_K$ invariant, i.e. $\widehat{Z}$ for the complement of a knot $K$ in the 3-sphere, the knots-quivers correspondence, and $A$-polynomials of knots, and find several interconnections between them. We associate an $F_K$…
In quantum physics (QP) education, the use of representations such as diagrams and visual aids that connect to mathematical concepts is crucial. Research in representation theory indicates that combining symbolic-mathematical elements (e.g.…
We propose a method for quantum computation which uses control of spin-orbit coupling in a linear array of single electron quantum dots. Quantum gates are carried out by pulsing the exchange interaction between neighboring electron spins,…
We consider a model of quantum computation using qubits where it is possible to measure whether a given pair are in a singlet (total spin $0$) or triplet (total spin $1$) state. The physical motivation is that we can do these measurements…
The concept of qudit (a d-level system) cluster state is proposed by generalizing the qubit cluster state (Phys. Rev. Lett. \textbf{86}, 910 (2001)) according to the finite dimensional representations of quantum plane algebra. We…