Related papers: Elementary Particles as Gates for Universal Quantu…
Computations with a future quantum computer will be implemented through the operations by elementary quantum gates. It is now well known that the collection of 1-bit and 2-bit quantum gates are universal for quantum computation, i.e., any…
We propose a geometric explanation of the standard model of Glashow, Weinberg and Salam for the known elementary particles. Our model is a generic Quantum Field Theory in dimension four, obtained by developing along a Lorentz sub-manifold…
Qubits are neither fermions nor bosons. A Fock space description of qubits leads to a mapping from qubits to parafermions: particles with a hybrid boson-fermion quantum statistics. We study this mapping in detail, and use it to provide a…
We introduce the notion of quantum computational webs: These are quantum states universal for measurement-based computation which can be built up from a collection of simple primitives. The primitive elements - reminiscent of building…
We introduce group surface codes, which are a natural generalization of the $\mathbb{Z}_2$ surface code, and equivalent to quantum double models of finite groups with specific boundary conditions. We show that group surface codes can be…
We put forward a possible new interpretation and explanatory framework for quantum theory. The basic hypothesis underlying this new framework is that quantum particles are conceptual entities. More concretely, we propose that quantum…
We expand a set of notions recently introduced providing the general setting for a universal representation of the quantum structure on which quantum information stands. The dynamical evolution process associated with generic quantum…
Previous works (by Almiehri, Dong, Harlow, Pastakawski, Preskill, Yoshida and others) have established that quantum error correction plays an important role in understanding how the bulk degrees of freedom of an Anti-deSitter spacetime are…
We explore a way of universal quantum computation with particles which cannot occupy the same position simultaneously and are symmetric under exchange of particle labels. Therefore the associated creation and annihilation operators are…
It is shown that the generators of Clifford algebras behave as creation and annihilation operators for fermions and bosons. They can create extended objects, such as strings and branes, and can induce curved metric of our spacetime. At a…
Matchgates are a group of two-qubit gates associated with free fermions. They are classically simulatable if restricted to act between nearest neighbors on a one-dimensional chain, but become universal for quantum computation with…
Fermions are fundamental particles which obey seemingly bizarre quantum-mechanical principles, yet constitute all the ordinary matter that we inhabit. As such, their study is heavily motivated from both fundamental and practical incentives.…
A new model of quantum computation is considered, in which the connections between gates are programmed by the state of a quantum register. This new model of computation is shown to be more powerful than the usual quantum computation, e. g.…
A universal quantum computing scheme, with a universal set of logical gates, is proposed based on networks of 1D quantum systems. The encoding of information is in terms of universal features of gapped phases, for which effective field…
Quantum fields are considered as generators of infinite-dimensional Clifford algebra $Cl(\infty)$, which can be either orthogonal (in case of fermions) or symplectic (in case of bosons). A generic quantum state can be expressed as a…
The role of quantum groups and braid groups in the description of Standard Model particles is discussed. Some recent results on the use of the quantum group $SU_q(3)$ as a flavour symmetry are reviewed and a connection between two…
Each year, the gap between theoretical proposals and experimental endeavours to create quantum computers gets smaller, driven by the promise of fundamentally faster algorithms and quantum simulations. This occurs by the combination of…
A fundamental pillar of quantum mechanics concerns indistinguishable quantum particles. In three dimensions they may be classified into fermions or bosons, having, respectively, antisymmetric or symmetric wave functions under particle…
We show the Standard Model and SuperString Theories can be naturally based on a Quantum Computer foundation. The Standard Model of elementary particles can be viewed as defining a Quantum Computer Grammar and language. A Quantum Computer in…
Topological quantum computation by way of braiding of Majorana fermions is not universal quantum computation. There are several attempts to make universal quantum computation by introducing some additional quantum gates or quantum states.…