Related papers: Elementary Particles as Gates for Universal Quantu…
We construct lattice gauge theories in which the elements of the link matrices are represented by non-commuting operators acting in a Hilbert space. These quantum link models are related to ordinary lattice gauge theories in the same way as…
The most successful "Standard Model" allows one to define the so-called "Elementary Particles". Now from another point of view, philosophical, how can we think of them? Which kind of a status can be attributed to Elementary Particles and…
In the fundamental laws of physics, gauge fields mediate the interaction between charged particles. An example is quantum electrodynamics -- the theory of electrons interacting with the electromagnetic field -- based on U(1) gauge symmetry.…
We develop the idea that the particles of the standard model may arise from excitations of quantum geometry. A previously proposed topological model of preons is developed so that it incorporates an unbounded number of generations. A…
We review quantum information processing with cold neutral particles, that is, atoms or polar molecules. First, we analyze the best suited degrees of freedom of these particles for storing quantum information, and then we discuss both…
We study the problem of particle indistinguishability for the three cases known in nature: identical classical particles, identical bosons and identical fermions. By exploiting the fact that different types of particles are associated with…
We propose a new way of implementing several elementary quantum gates for qubits in the coherent state basis. The operations are probabilistic and employ single photon subtractions as the driving force. Our schemes for single-qubit phase…
A set of universal quantum gates is a vital part of the theory of quantum computing, but is absent in the developing theory of Relativistic Quantum Information (RQI). Yet, the Unruh--DeWitt (UDW) detector formalism can be elevated to…
Unitary operations are the building blocks of quantum programs. Our task is to design effcient or optimal implementations of these unitary operations by employing the intrinsic physical resources of a given n-qubit system. The most common…
The Variational Quantum Eigensolver approach to the electronic structure problem on a quantum computer involves measurement of the Hamiltonian expectation value. Formally, quantum mechanics allows one to measure all mutually commuting or…
We follow the example of Cabibbo by revising the Standard Model (SM) to present a universal mass structure for fermions. A universal Higgs coupling for each species of fundamental fermions moves the SM towards a Theory of Matter, albeit…
A class of fermionic quantum field theories with interactions is shown to be equivalent to probabilistic cellular automata, namely cellular automata with a probability distribution for the initial states. Probabilistic cellular automata on…
An approach to gauge theory in the context of locally conformally flat space-time is described. It is discussed how there are a number of natural principal bundles associated with any given locally conformally flat space-time $X$. The…
Artificial neural networks have been proposed as potential algorithms that could benefit from being implemented and run on quantum computers. In particular, they hold promise to greatly enhance Artificial Intelligence tasks, such as image…
We introduce a pentagon equation solver, available as part of SageMath, and use it to construct braid group representations associated to certain anyon systems. We recall the category-theoretic framework for topological quantum computation…
Quantum computers are discussed in the general framework of computation, the laws of physics and the foundations of quantum mechanics.
Quantum computers require quantum logic, something fundamentally different to classical Boolean logic. This difference leads to a greater efficiency of quantum computation over its classical counter-part. In this review we explain the basic…
Quantum walk has been regarded as a primitive to universal quantum computation. By using the operations required to describe the single particle discrete-time quantum walk on a position space we demonstrate the realization of the universal…
Quantum computers are a promising candidate to radically expand computational science through increased computing power and more effective algorithms. In particular quantum computing could have a tremendous impact in the field of quantum…
We show that a set of gates that consists of all one-bit quantum gates (U(2)) and the two-bit exclusive-or gate (that maps Boolean values $(x,y)$ to $(x,x \oplus y)$) is universal in the sense that all unitary operations on arbitrarily many…