Group Field Theory: An overview

We give a brief overview of the properties of a higher dimensional generalization of matrix model which arises naturally in the context of a background independent approach to quantum gravity, the so called group field theory. We show that this theory leads to a natural proposal for the physical scalar product of quantum gravity. We also show in which sense this theory provides a third quantization point of view on quantum gravity.Comment: 10 page

Spin Star as Switch for Quantum Networks

Quantum state transfer is an important task in quantum information processing. It is known that one can engineer the couplings of a one-dimensional spin chain to achieve the goal of perfect state transfer. To leverage the value of these spin chains, a spin star is potentially useful for connecting different parts of a quantum network. In this work, we extend the spin-chain engineering problem to the problems with a topology of a star network. We show that a permanently coupled spin star can function as a network switch for transferring quantum states selectively from one node to another by varying the local potentials only. Together with one-dimensional chains, this result allows applications of quantum state transfer be applied to more general quantum networks.Comment: 10 pages, 2 figur

Arithmetic on a Distributed-Memory Quantum Multicomputer

We evaluate the performance of quantum arithmetic algorithms run on a distributed quantum computer (a quantum multicomputer). We vary the node capacity and I/O capabilities, and the network topology. The tradeoff of choosing between gates executed remotely, through ``teleported gates'' on entangled pairs of qubits (telegate), versus exchanging the relevant qubits via quantum teleportation, then executing the algorithm using local gates (teledata), is examined. We show that the teledata approach performs better, and that carry-ripple adders perform well when the teleportation block is decomposed so that the key quantum operations can be parallelized. A node size of only a few logical qubits performs adequately provided that the nodes have two transceiver qubits. A linear network topology performs acceptably for a broad range of system sizes and performance parameters. We therefore recommend pursuing small, high-I/O bandwidth nodes and a simple network. Such a machine will run Shor's algorithm for factoring large numbers efficiently.Comment: 24 pages, 10 figures, ACM transactions format. Extended version of Int. Symp. on Comp. Architecture (ISCA) paper; v2, correct one circuit error, numerous small changes for clarity, add reference

Evolutionary Approaches to Optimization Problems in Chimera Topologies

Chimera graphs define the topology of one of the first commercially available quantum computers. A variety of optimization problems have been mapped to this topology to evaluate the behavior of quantum enhanced optimization heuristics in relation to other optimizers, being able to efficiently solve problems classically to use them as benchmarks for quantum machines. In this paper we investigate for the first time the use of Evolutionary Algorithms (EAs) on Ising spin glass instances defined on the Chimera topology. Three genetic algorithms (GAs) and three estimation of distribution algorithms (EDAs) are evaluated over $1000$ hard instances of the Ising spin glass constructed from Sidon sets. We focus on determining whether the information about the topology of the graph can be used to improve the results of EAs and on identifying the characteristics of the Ising instances that influence the success rate of GAs and EDAs.Comment: 8 pages, 5 figures, 3 table