The Other Kind of Quantum Computing.

Andrew S. Glassner

Giulio Chiribella, Giacomo Mauro D’Ariano, Paolo Perinotti +1 more

The manuscript poses and addresses a new very fundamental issue in Quantum Computer Science, which is going to have a radical impact on the way we currently conceive quantum computation. We show that there exists a new kind of higher-order quantum computation, potentially much more powerful than the usual quantum processing, which is feasible, but cannot be realized by a usual quantum circuit. In order to implement this new kind of computations one needs to change the rules of quantum circuits, also considering circuits with the geometry of the connections that can be itself in a quantum superposition. The new kind of computation poses also fundamental problems for unexplored aspects of quantum mechanics in a non-fixed causal framework, which go far beyond computer-science problems, and may be of relevance in quantum gravity.

Davor Pavuna

Samyak Jhaveri, A. Krone-Martins, Cristina Videira Lopes

Quantum computers are becoming a reality. The advantage of quantum computing is that it has the potential to solve computationally complex problems in a fixed amount time, independent of the size of the problem. However, the kinds of problems for which these computers are a good fit, and the ways to express those problems, are substantially different from the kinds of problems and expressions used in classical computing. Quantum annealers, in particular, are currently the most promising and available quantum computing devices in the short term. However, they are also the most foreign compared to classical programs, as they require a different kind of computational thinking. In order to ease the transition into this new world of quantum computing, we present a novel quantum approach to a well-known software problem: code clone detection. We express code clone detection as a subgraph isomorphism problem that is mapped into a quadratic optimization problem, and solve it using a DWave quantum annealing computer. We developed a quantum annealing algorithm that compares Abstract Syntax Trees (AST) and reports an energy value that indicates how similar they are.

Liu Ya-ji

In this thesis,several basic conceptions of quantum computation are introduced,such as entanglement,quantum bit.Several kinds of main quantum algorithms are illustrated,such as Shor algorithm-the quantum algorithm for factoring,Grover search-the search for the disordering database,Hogg search-high structurization search.On the basis of knowledge of basic theories of quantum computation computing and quantum algorithm,two kinds of systems which play important role in the experiment of quantum computation was introduced,Nuclear magnetic resonance and cavity atom system.

Yu. I. Manin