Quantum Computation and Real Multiplication

We propose a construction of anyon systems associated to quantum tori with real multiplication and the embedding of quantum tori in AF algebras. These systems generalize the Fibonacci anyons, with weaker categorical properties, and are obtained from the basic modules and the real multiplication structure

ROM-based quantum computation: Experimental explorations using Nuclear Magnetic Resonance, and future prospects

ROM-based quantum computation (QC) is an alternative to oracle-based QC. It has the advantages of being less ``magical'', and being more suited to implementing space-efficient computation (i.e. computation using the minimum number of writable qubits). Here we consider a number of small (one and two-qubit) quantum algorithms illustrating different aspects of ROM-based QC. They are: (a) a one-qubit algorithm to solve the Deutsch problem; (b) a one-qubit binary multiplication algorithm; (c) a two-qubit controlled binary multiplication algorithm; and (d) a two-qubit ROM-based version of the Deutsch-Jozsa algorithm. For each algorithm we present experimental verification using NMR ensemble QC. The average fidelities for the implementation were in the ranges 0.9 - 0.97 for the one-qubit algorithms, and 0.84 - 0.94 for the two-qubit algorithms. We conclude with a discussion of future prospects for ROM-based quantum computation. We propose a four-qubit algorithm, using Grover's iterate, for solving a miniature ``real-world'' problem relating to the lengths of paths in a network.Comment: 11 pages, 5 figure

Non-traditional Calculations of Elementary Mathematical Operations: Part 1. Multiplication and Division

Different computational systems are a set of functional units and processors that can work together and exchange data with each other if required. In most cases, data transmission is organized in such a way that enables for the possibility of connecting each node of the system to the other node of the system. Thus, a computer system consists of components for performing arithmetic operations, and an integrated data communication system, which allows for information interaction between the nodes, and combines them into a single unit. When designing a given type of computer systems, problems might occur if:– computing nodes of the system cannot simultaneously start and finish data processing over a certain time interval;– procedures for processing data in the nodes of the system do not start and do not end at a certain time;– the number of computational nodes of the inputs and outputs of the system is different.This article proposes an unconventional approach to constructing a mathematical model of adaptive-quantum computation of arithmetic operations of multiplication and division using the principle of predetermined random self-organization proposed by Ashby in 1966, as well as the method of the dynamics of averages and of the adaptive system of integration of the system of logical-differential equations for the dynamics of number-average states of particles S1, S2 of sets. This would make it easier to solve some of the problems listed above

Gate-Level Simulation of Quantum Circuits

While thousands of experimental physicists and chemists are currently trying to build scalable quantum computers, it appears that simulation of quantum computation will be at least as critical as circuit simulation in classical VLSI design. However, since the work of Richard Feynman in the early 1980s little progress was made in practical quantum simulation. Most researchers focused on polynomial-time simulation of restricted types of quantum circuits that fall short of the full power of quantum computation. Simulating quantum computing devices and useful quantum algorithms on classical hardware now requires excessive computational resources, making many important simulation tasks infeasible. In this work we propose a new technique for gate-level simulation of quantum circuits which greatly reduces the difficulty and cost of such simulations. The proposed technique is implemented in a simulation tool called the Quantum Information Decision Diagram (QuIDD) and evaluated by simulating Grover's quantum search algorithm. The back-end of our package, QuIDD Pro, is based on Binary Decision Diagrams, well-known for their ability to efficiently represent many seemingly intractable combinatorial structures. This reliance on a well-established area of research allows us to take advantage of existing software for BDD manipulation and achieve unparalleled empirical results for quantum simulation