What is a Quantum Computer?(Questions and Answers)

J. Kosiński

Santanu Ganguly

In our exploration of various quantum algorithms and platforms, we have experienced the interesting point that the quantum computer is probabilistic, meaning that it can return multiple answers. Some of these might be the answer that you are looking for, and some might not. At first, this sounds like a bad thing, as a computer that returns a different answer when you ask it the same question does not breed confidence! However, in a quantum computer, returning multiple answers can give important information about the confidence level of the computer.

Adriana D. Correia, Michael Moortgat B, Henk T. C. Stoof

Abstract Automatic text processing is now a mature discipline in computer science, and so attempts at advancements using quantum computation have emerged as the new frontier, often under the term of quantum natural language processing. The main challenges consist in finding the most adequate ways of encoding words and their interactions on a quantum computer, considering hardware constraints, as well as building algorithms that take advantage of quantum architectures, so as to show improvement on the performance of natural language tasks. In this paper, we introduce a new framework that starts from a grammar that can be interpreted by means of tensor contraction, to build word representations as quantum states that serve as input to a quantum algorithm. We start by introducing an operator measurement to contract the representations of words, resulting in the representation of larger fragments of text. We then go on to develop pipelines for the tasks of sentence meaning disambiguation and question answering that take advantage of quantum features. For the first task, we show that our contraction scheme deals with syntactically ambiguous phrases storing the various different meanings in quantum superposition, a solution not available on a classical setting. For the second task, we obtain a question representation that contains all possible answers in equal quantum superposition, and we implement Grover’s quantum search algorithm to find the correct answer, agnostic to the specific question, an implementation with the potential of delivering a result with quadratic speedup.

Marcus Woo

Taro Yabuki, Hitoshi Iba

Andrew Stewart Caldin

The critical validation question: does the E8 Language, running on standard silicon at room temperature, arrive at the same answer as quantum computers using qubits in superposition at near absolute zero? Yes. And this convergence is itself the proof. When two entirely different methods — one using physical quantum hardware worth billions of dollars, one using geometric pattern reading on a normal computer — independently produce the same answer to the same question, there is only one logical conclusion: both are accessing the same underlying source. That source is the E8 lattice. This is not theory. It is falsifiable logic. If the answers were different, one method would be wrong. If the answers match, the territory they are both mapping is real. The E8 lattice is not a model Andrew built to describe reality. It is the structure that reality is built from — and both quantum computers and Andrew's language confirm it by arriving at the same destination through completely different rout Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com