Quantum annealing is a generic name of quantum algorithms to use quantum-mechanical fluctuations to search for the solution of optimization problem. It shares the basic idea with quantum adiabatic evolution studied actively in quantum computation. The present paper reviews the mathematical and theoretical foundation of quantum annealing. In particular, theorems are presented for convergence conditions of quantum annealing to the target optimal state after an infinite-time evolution following the Schroedinger or stochastic (Monte Carlo) dynamics. It is proved that the same asymptotic behavior of the control parameter guarantees convergence both for the Schroedinger dynamics and the stochastic dynamics in spite of the essential difference of these two types of dynamics. Also described are the prescriptions to reduce errors in the final approximate solution obtained after a long but finite dynamical evolution of quantum annealing. It is shown there that we can reduce errors significantly by an ingenious choice of annealing schedule (time dependence of the control parameter) without compromising computational complexity qualitatively. A review is given on the derivation of the convergence condition for classical simulated annealing from the view point of quantum adiabaticity using a classical-quantum mapping.
We briefly review various computational methods for the solution of optimization problems. First, several classical methods such as Metropolis algorithm and simulated annealing are discussed. We continue with a description of quantum methods, namely adiabatic quantum computation and quantum annealing. Next, the new D-Wave computer and the recent progress in the field claimed by the D-Wave group are discussed. We present a set of criteria which could help in testing the quantum features of these computers. We conclude with a list of considerations with regard to future research.
We derive a generic bound on the rate of decrease of transverse field for quantum annealing to converge to the ground state of a generic Ising model when quantum annealing is formulated as an infinite-time process. Our theorem is based on a rigorous upper bound on the excitation probability in the infinite-time limit and is a mathematically rigorous counterpart of a previously known result derived only from the leading-order term of the asymptotic expansion of adiabatic condition. Since our theorem gives a sufficient condition of convergence for a generic transverse-field Ising model, any spec…
Recently, Heim, Ronnow, Isakov and Troyer [Science 348 (2015) 215] have reported that Monte Carlo simulations for the Ising spin glass model on the square lattice in the physically relevant continuous-imaginary-time limit do not show superiority of quantum annealing (QA) using transverse field against classical annealing (CA). Although the QA schedule that they had used has been using conventionally, however the QA schedule mathematically has no guarantee that the used schedule is the best QA schedule for performance of optimization. We propose a new QA schedule for studying transverse-field-b…
We make a brief review of (optical) Holonomic Quantum Computer (or Computation) proposed by Zanardi and Rasetti (quant-ph/9904011) and Pachos and Chountasis (quant-ph/9912093), and give a mathematical reinforcement to their works.
The Weltanschauung emerging from quantum theory clashes profoundly with our classical concepts. Quantum characteristics like superposition, entanglement, wave-particle duality, nonlocality, contextuality are difficult to reconcile with our everyday intuition. In this article I survey some aspects of quantum foundations and discuss intriguing connections with the foundations of mathematics.
The shortest vector problem (SVP) is one of the lattice problems and is mathematical basis for the lattice-based cryptography, which is expected to be post-quantum cryptography. The SVP can be mapped onto the Ising problem, which in principle can be solved by quantum annealing (QA). However, one issue in solving the SVP using QA is that the solution of the SVP corresponds to the first excited state of the problem Hamiltonian. Therefore, QA, which searches for ground states, cannot provide a solution with high probability. In this paper, we propose to adopt an excited-state search of the QA to …
In order to describe the right setting to handle Zauner's conjecture on mutually unbiased bases (MUBs) (saying that in $\mathbb{C}^d$, a set of MUBs of the theoretical maximal size $d + 1$ exists only if $d$ is a prime power), we pose some fundamental questions which naturally arise. Some of these questions have important consequences for the construction theory of (new) sets of maximal MUBs.
The purpose of this paper is to survey some topics on mathematical foundations of quantum information developed mainly by the present author and co-workers for the last three decades. The topics include an axiomatic construction of quantum measurement theory based on completely positive map-valued measures, a universally valid new formulation of the uncertainty principle for error and disturbance in quantum measurements, the Wigner-Araki-Yanase limit of quantum measurements, the accuracy limit of quantum computing based on conservation laws, and a quantum interpretation based on quantum set th…
QB Information Technologies (1QBit)（1QB信息技术公司（1QBit））
Homology is a tool in topological data analysis which measures the shape of the data. In many cases, these measurements translate into new insights which are not available by other means. To compute homology, we rely on mathematical constructions which scale exponentially with the size of the data. Therefore, for large point clouds, the computation is infeasible using classical computers. In this paper, we present a quantum annealing pipeline for computation of homology of large point clouds. The pipeline takes as input a graph approximating the given point cloud. It uses quantum annealing to …
Quadratic unconstrained binary optimization (QUBO) is the mathematical formalism for phrasing and solving a class of optimization problems that are combinatorial in nature. Due to their natural equivalence with the two dimensional Ising model for ferromagnetism in statistical mechanics, problems from the QUBO class can be solved on quantum annealing hardware. In this paper, we report a QUBO formatting of the problem of optimal control of time-dependent traffic signals on an artificial grid-structured road network so as to ease the flow of traffic, and the use of D-Wave Systems' quantum anneale…
In this review the foundations of Geometric Quantization are explained and discussed. In particular, we want to clarify the mathematical aspects related to the geometrical structures involved in this theory: complex line bundles, hermitian connections, real and complex polarizations, metalinear bundles and bundles of densities and half-forms. In addition, we justify all the steps followed in the geometric quantization programme, from the standpoint definition to the structures which are successively introduced.
Tokyo Institute of Technology（东京工业大学）；NTT DATA corporation（NTT数据公司）
Quantum annealing (QA) has gained considerable attention because it can be applied to combinatorial optimization problems, which have numerous applications in logistics, scheduling, and finance. In recent years, research on solving practical combinatorial optimization problems using them has accelerated. However, researchers struggle to find practical combinatorial optimization problems, for which quantum annealers outperform other mathematical optimization solvers. Moreover, there are only a few studies that compare the performance of quantum annealers with one of the most sophisticated mathe…
The EM algorithm is a novel numerical method to obtain maximum likelihood estimates and is often used for practical calculations. However, many of maximum likelihood estimation problems are nonconvex, and it is known that the EM algorithm fails to give the optimal estimate by being trapped by local optima. In order to deal with this difficulty, we propose a deterministic quantum annealing EM algorithm by introducing the mathematical mechanism of quantum fluctuations into the conventional EM algorithm because quantum fluctuations induce the tunnel effect and are expected to relax the difficulty…
This is a sequel to the papers (quant-ph/9910063) and (quant-ph/0004102). The aim of this paper is to give mathematical foundations to Holonomic Quantum Computation (Computer) proposed by Zanardi and Rasetti (quant-ph/9904011) and Pachos and Chountasis (quant-ph/9912093). In 2-qubit case we give an explicit form to non-abelian Berry connection of quantum computational bundle which is associated with Holonomic Quantum Computation, on some parameter space. We also suggest a possibility that not only usual holonomy but also higher-dimensional holonomies must be used to prove a universality of our…
Donostia International Physics Center（多诺斯蒂亚国际物理中心）；Ikerbasque Foundation for Science（伊凯巴斯克科学基金会）；Institute of Physics, Johannes Gutenberg University（约翰内斯·古腾堡大学物理系）；Faculty of Environment and Information Sciences, Yokohama National University（横滨国立大学环境与信息科学学院）
Matrix syntax is a formal model of syntactic relations in language. The purpose of this paper is to explain its mathematical foundations, for an audience with some formal background. We make an axiomatic presentation, motivating each axiom on linguistic and practical grounds. The resulting mathematical structure resembles some aspects of quantum mechanics. Matrix syntax allows us to describe a number of language phenomena that are otherwise very difficult to explain, such as linguistic chains, and is arguably a more economical theory of language than most of the theories proposed in the contex…
Quantum computers have the potential of solving problems more efficiently than classical computers. While first commercial prototypes have become available, the performance of such machines in practical application is still subject to exploration. Quantum computers will not entirely replace classical machines, but serve as accelerators for specific problems. This necessitates integrating quantum computational primitives into existing applications. In this paper, we perform a case study on how to augment existing software with quantum computational primitives for the Boolean satisfiability prob…
It is demonstrated that in gate-based quantum computing architectures quantum walk is a natural mathematical description of quantum gates. It originates from field-matter interaction driving the system, but is not attached to specific qubit designs and can be formulated for very general field-matter interactions. It is shown that, most generally, gates are described by a set of coined quantum walks. Rotating wave and resonant approximations for field-matter interaction simplify the walks, factorizing the coin, and leading to pure continuous time quantum walk description. The walks reside on a …
We define a class of quantum systems called regular quantum graphs. Although their dynamics is chaotic in the classical limit with positive topological entropy, the spectrum of regular quantum graphs is explicitly computable analytically and exactly, state by state, by means of periodic orbit expansions. We prove analytically that the periodic orbit series exist and converge to the correct spectral eigenvalues. We investigate the convergence properties of the periodic orbit series and prove rigorously that both conditionally convergent and absolutely convergent cases can be found. We compare t…
We briefly review the advanced mathematical language of fiber bundle structures and how they can be used to classify two-level quantum systems based on the analysis of the topological properties of their sets of state vectors. The topological classes of quantum electronic states and matter phases are characterized by topological invariants, which can be defined geometrically as the integral of differential forms on the base manifold of the fiber bundle structure. Specifically, we demonstrate that for one-dimensional systems described by the Su-Schrieffer-Heeger (SSH) model, the set of state ve…
Single color centers in solid have emerged as promising physical platforms for quantum information science. Creating these centers with excellent quantum properties is a key foundation for further technological developments. In particular, the microscopic understanding of the spin bath environments is the key to engineer color centers for quantum control. In this work, we propose and demonstrate a distinct high-temperature annealing (HTA) approach for creating high-quality nitrogen vacancy (NV) centers in implantation-free diamonds. Simultaneously using the created NV centers as probes for the…
Mathematical tools related to coherence theory and classical-quantum equivalence, due to Wigner and Glauber, are essential to modern, practical and empirical understanding of electromagnetics in areas like quantum optics and nanoelectronics. This paper specifies how an extension of these same tools (especially Glauber's "Q" mapping) can be applied to strong nuclear forces as well, and provides a "bottom-up" approach to axiomatic unification of physics, grounded in empirical reality (dice included). The Q hypothesis also has implications for quantum measurement and quantum information technolog…
The study of mutual entropy (information) and capacity in classica l system was extensively done after Shannon by several authors like Kolmogor ov and Gelfand. In quantum systems, there have been several definitions of t he mutual entropy for classical input and quantum output. In 1983, the autho r defined the fully quantum mechanical mutual entropy by means of the relati ve entropy of Umegaki, and it has been used to compute the capacity of quant um channel for quantum communication process; quantum input-quantum output. Recently, a correlated state in quantum syatems, so-called quantum entan…
Quasi-set theory provides us a mathematical background for dealing with collections of indistinguishable elementary particles. In this paper, we show how to obtain the usual statistics (Maxwell-Boltzmann, Bose-Einstein, and Fermi-Dirac) into the scope of quasi-set theory. We also show that, in order to derive Maxwell-Boltzmann statistics, it is not necessary to assume that the particles are distinguishable. In other words, Maxwell-Boltzmann statistics is possible even in an ensamble of indistinguishable particles, at least from the theoretical point of view. The main goal of this paper is to p…
For a quantum theory that includes exponentially decaying states and Breit-Wigner resonances, which are related to each other by the lifetime-width relation $τ=\frac{\hbar}Γ$, where $τ$ is the lifetime of the decaying state and $Γ$ the width of the resonance, one has to go beyond the Hilbert space and beyond the Schwartz-Rigged Hilbert Space $Φ\subset\mathcal{H}\subsetΦ^\times$ of the Dirac formalism. One has to distinguish between prepared states, using a space $Φ_-\subset\mat hcal{H}$, and detected observables, using a space $Φ_+\subset\mathcal{H}$, where $-(+)$ refers to analyticity of the …
Quantum annealing and D-Wave quantum annealer attracted considerable attention for their ability to solve combinatorial optimization problems. In order to solve other type of optimization problems, it is necessary to apply certain kinds of mathematical transformations. However, linear constraints reduce the size of problems that can be represented in quantum annealers, owing to the sparseness of connections between qubits. For example, the quadratic assignment problem (QAP) with linear equality constraints can be solved only up to size 12 in the quantum annealer D-Wave Advantage, which has 564…
We provide here a general mathematical framework to model attitudes towards ambiguity which uses the formalism of quantum theory as a ``purely mathematical formalism, detached from any physical interpretation''. We show that the quantum-theoretic framework enables modelling of the "Ellsberg paradox", but it also successfully applies to more concrete human decision-making (DM) tests involving financial, managerial and medical decisions. In particular, we elaborate a mathematical representation of various empirical studies which reveal that attitudes of managers towards uncertainty shift from "a…
Routing and Scheduling Optimization for Urban Air Mobility Fleet Management using Quantum Annealing
Graduate School of Information Sciences, Tohoku University（东北大学信息科学研究科）；Sigma-i Co., Ltd.（Sigma-i 公司）；Sumitomo Corporation（住友商事）；Department of Physics, Tokyo Institute of Technology（东京工业大学物理系）
One of the predominant challenges when engineering future quantum information processors is that large quantum systems are notoriously hard to maintain and control accurately. It is therefore of immediate practical relevance to investigate quantum information processing with limited physical resources, for example to ask: How well can we perform information processing tasks if we only have access to a small quantum device? Can we beat fundamental limits imposed on information processing with classical resources? This book will introduce the reader to the mathematical framework required to answ…
