Related papers: An Explicit Construction of Quantum Expanders
A new type of algebras that represent a generalization of both quantum groups and braided groups is defined. These algebras are given by a pair of solutions of the Yang--Baxter equation that satisfy some additional conditions. Several…
Quantum computation teaches us that quantum mechanics exhibits exponential complexity. We argue that the standard scientific paradigm of "predict and verify" cannot be applied to testing quantum mechanics in this limit of high complexity.…
A simple mathematical extension of quantum theory is presented. As well as opening the possibility of alternative methods of calculation, the additional formalism implies a new physical interpretation of the standard theory by providing a…
The structure of covariant instruments is studied and a general structure theorem is derived. A detailed characterization is given to covariant instruments in the case of an irreducible representation of a locally compact group.
We show that there are well separated families of quantum expanders with asymptotically the maximal cardinality allowed by a known upper bound. This has applications to the "growth" of certain operator spaces: It implies asymptotically…
Controlling the waveform of light is the key for a versatile light source in classical and quantum electronics. Although pulse shaping of classical light is a mature technique and has been used in various fields, more advanced applications…
Quantum algorithms have the potential to provide exponential speedups over some of the best known classical algorithms. These speedups may enable quantum devices to solve currently intractable problems such as those in the fields of…
Deutsch, Feynman, and Manin viewed quantum computing as a kind of universal physical simulation procedure. Much of the writing about quantum Turing machines has shown how these machines can simulate an arbitrary unitary transformation on a…
The heat-kernel expansion and $\zeta$-regularization techniques for quantum field theory and extended objects on curved space-times are reviewed. In particular, ultrastatic space-times with spatial section consisting in manifold with…
This paper introduces a formal metalanguage called the lambda-q calculus for the specification of quantum programming languages. This metalanguage is an extension of the lambda calculus, which provides a formal setting for the specification…
Consider $\alpha \in \Q(i)$ satisfying $|\alpha| >1$. Let $\D = \{0,1,\ldots,|a_0|-1\}$, where $a_0$ is the independent coefficient of the minimal primitive polynomial of $\alpha$. We introduce a way of expanding complex numbers in base…
An extension of Quantum Group is described. We propose to unite the quantum groups with parameter q and with parameter modularly dual to q.
In the span of four decades, quantum computation has evolved from an intellectual curiosity to a potentially realizable technology. Today, small-scale demonstrations have become possible for quantum algorithmic primitives on hundreds of…
In this paper the notion of quantum finite one-counter automata (QF1CA) is introduced. Introduction of the notion is similar to that of the 2-way quantum finite state automata by A.Kondacs and J.Watrous. The well-formedness conditions for…
A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify the quantum advantage of an untrusted prover. That is, a quantum prover can correctly answer the verifier's challenges and…
A key notion bridging the gap between {\it quantum operator algebras} \cite{LZ10} and {\it vertex operator algebras} \cite{Bor}\cite{FLM} is the definition of the commutativity of a pair of quantum operators (see section 2 below). This is…
In spite of its popularity, it has not been possible to vindicate the conventional wisdom that classical mechanics is a limiting case of quantum mechanics. The purpose of the present paper is to offer an alternative formulation of classical…
Let $\textbf{U}^+$ be the positive part of the quantum group $\textbf{U}$ associated with a generalized Cartan matrix. In the case of finite type, Lusztig constructed the canonical basis $\textbf{B}$ of $\textbf{U}^+$ via two approaches.…
This thesis studies the categorical formalisation of quantum computing, through the prism of type theory, in a three-tier process. The first stage of our investigation involves the creation of the dagger lambda calculus, a lambda calculus…
We construct a large collection of "quantum projective spaces", in the form of Koszul, Calabi-Yau algebras with the Hilbert series of a polynomial ring. We do so by starting with the toric ones (the q-symmetric algebras), and then deforming…