Related papers: Quantum computation and real multiplication
Physical systems, characterized by an ensemble of interacting elementary constituents, can be represented and studied by different algebras of observables or operators. For example, a fully polarized electronic system can be investigated by…
This article surveys the application of the representation theory of loop groups to simple models in quantum field theory and to certain integrable systems. The common thread in the discussion is the construction of quantum fields using…
A geometrical approach to quantum computation is presented, where a non-abelian connection is introduced in order to rewrite the evolution operator of an energy degenerate system as a holonomic unitary. For a simple geometrical model we…
If a large Quantum Computer (QC) existed today, what type of physical problems could we efficiently simulate on it that we could not simulate on a classical Turing machine? In this paper we argue that a QC could solve some relevant physical…
We formalize the quantum arithmetic, i.e. a relationship between number theory and operator algebras. Namely, it is proved that rational projective varieties are dual to the $C^*$-algebras with real multiplication. Our construction fits all…
The quantum Fourier transform (QFT) brings efficiency in many respects, especially usage of resource, for most operations on quantum computers. In this study, the existing QFT-based and non-QFT-based quantum arithmetic operations are…
We present the realization of Hurwitz algebras in terms of 2x2 vector matrices, which maintain the correspondence between the geometry of the vector spaces used in the classical physics and the underlined algebraic foundation of the quantum…
New features of systems with non-trivial topology such as fractional quantum numbers, inequivalent quantizations, good operators, topological anomalies, etc. are described in the framework of an algebraic quantization procedure on a group.…
We present near-term quantum algorithms for auxiliary-field quantum Monte Carlo (AFQMC), viewed as imaginary-time projection for ground-state calculation as an ensemble of one-body propagators driven by stochastic fields $\Omega$. Starting…
A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…
A system of unitary transformations providing two optimal copies of an arbitrary input cubit is obtained. An algorithm based on classical Boolean algebra and allowing one to find any unitary transformation realized by the quantum CNOT…
The surface code is currently the primary proposed method for performing quantum error correction. However, despite its many advantages, it has no native method to fault-tolerantly apply non-Clifford gates. Additional techniques are…
It is indicated that principal models of computation are indeed significantly related. The quantum field computation model contains the quantum computation model of Feynman. (The term "quantum field computer" was used by Freedman.) Quantum…
We study the structure and representations of a family of vertex algebras obtained from affine superalgebras by quantum reduction. As an application, we obtain in a unified way free field realizations and determinant formulas for all…
Quantum gates built out of braid group elements form the building blocks of topological quantum computation. They have been extensively studied in $SU(2)_k$ quantum group theories, a rich source of examples of non-Abelian anyons such as the…
In this paper we present a new algebraic structure (a super hyperbolic system in our terminology) for finite quantum systems, which is a generalization of the usual one in the two-level system. It fits into the so-called generalized Pauli…
Quantum Fourier transformation is important in many quantum algorithms. In this paper, we generalize quantum Fourier transformation over the Abelian group $\mathbb{Z}_N$ from two different points to get more efficient unitary…
We discuss how to construct models of interacting anyons by generalizing quantum spin Hamiltonians to anyonic degrees of freedom. The simplest interactions energetically favor pairs of anyons to fuse into the trivial ("identity") channel,…
We reconstruct finite-dimensional quantum theory from categorical principles. That is, we provide properties ensuring that a given physical theory described by a dagger compact category in which one may `discard' objects is equivalent to a…
Quantum computers leverage the principles of quantum mechanics to do computation with a potential advantage over classical computers. While a single classical computer transforms one particular binary input into an output after applying one…