The Quantum Alternating Operator Ansatz (QAOA+) framework has recently gained attention due to its ability to solve discrete optimization problems on noisy intermediate-scale quantum (NISQ) devices in a manner that is amenable to derivation of worst-case guarantees. We design a technique in this framework to tackle a few problems over maximal matchings in graphs. Even though maximum matching is polynomial-time solvable, most counting and sampling versions are #P-hard.
We design a few algorithms that generates superpositions over matchings allowing us to sample from them. In particular, we get a superposition over all possible matchings when given the empty state as input and a superposition over all maximal matchings when given the W -states as input.
Our main result is that the expected size of the matchings corresponding to the output states of our QAOA+ algorithm when ran on a 2-regular graph is greater than the expected matching size obtained from a uniform distribution over all matchings. This algorithm uses a W -state as input and we prove that this input state is better compared to using the empty matching as the input state.
The hybrid quantum-classical algorithm is actively examined as a technique applicable even to intermediate-scale quantum computers. To execute this algorithm, the hardware efficient ansatz is often used, thanks to its implementability and expressibility; however, this ansatz has a critical issue in its trainability in the sense that it generically suffers from the so-called gradient vanishing problem. This issue can be resolved by limiting the circuit to the class of shallow alternating layered ansatz. However, even though the high trainability of this ansatz is proved, it is still unclear whe…
This paper investigates the experimental performance of a discrete portfolio optimization problem relevant to the financial services industry on the gate-model of quantum computing. We implement and evaluate a portfolio rebalancing use case on an idealized simulator of a gate-model quantum computer. The characteristics of this exemplar application include trading in discrete lots, non-linear trading costs, and the investment constraint. We design a novel problem encoding and hard constraint mixers for the Quantum Alternating Operator Ansatz, and compare to its predecessor the Quantum Approxima…
We present a new hybrid, local search algorithm for quantum approximate optimization of constrained combinatorial optimization problems. We focus on the Maximum Independent Set problem and demonstrate the ability of quantum local search to solve large problem instances on quantum devices with few qubits. This hybrid algorithm iteratively finds independent sets over carefully constructed neighborhoods and combines these solutions to obtain a global solution. We study the performance of this algorithm on 3-regular, Community, and Erdős-Rényi graphs with up to 100 nodes.
The maximum independent set (MIS) problem of graph theory using the quantum alternating operator ansatz is studied. We perform simulations on the Rigetti Forest simulator for the square ring, $K_{2,3}$, and $K_{3,3}$ graphs and analyze the dependence of the algorithm on the depth of the circuit and initial states. The probability distribution of observation of the feasible states representing maximum independent sets is observed to be asymmetric for the MIS problem, which is unlike the Max-Cut problem where the probability distribution of feasible states is symmetric. For asymmetric graphs it …
The next few years will be exciting as prototype universal quantum processors emerge, enabling implementation of a wider variety of algorithms. Of particular interest are quantum heuristics, which require experimentation on quantum hardware for their evaluation, and which have the potential to significantly expand the breadth of quantum computing applications. A leading candidate is Farhi et al.'s Quantum Approximate Optimization Algorithm, which alternates between applying a cost-function-based Hamiltonian and a mixing Hamiltonian. Here, we extend this framework to allow alternation between m…
This paper establishes the tractability of finding the optimal Nash equilibrium, as well as the optimal social solution, to a discrete congestion game using a gate-model quantum computer. The game is of the type originally posited by Rosenthal in the 1970's. To find the optimal Nash equilibrium, we formulate an optimization problem encoding based on potential functions and path selection constraints, and solve it using the Quantum Alternating Operator Ansatz. We compare this formulation to its predecessor, the Quantum Approximate Optimization Algorithm. We implement our solution on an idealize…
Gate-based universal quantum computers form a rapidly evolving field of quantum computing hardware technology. In previous work, we presented a quantum algorithm for lattice protein folding on a cubic lattice, tailored for quantum annealers. In this paper, we introduce a novel approach for solving the lattice protein folding problem on universal gate-based quantum computing architectures. Lattice protein models are coarse-grained representations of proteins that have been used extensively over the past thirty years to examine the principles of protein folding and design.These models can be use…
The Quantum Alternating Operator Ansatz is a generalization of the Quantum Approximate Optimization Algorithm (QAOA) designed for finding approximate solutions to combinatorial optimization problems with hard constraints. In this paper, we study Maximum $k$-Vertex Cover under this ansatz due to its modest complexity, while still being more complex than the well studied problems of Max-Cut and Max E3-LIN2. Our approach includes (i) a performance comparison between easy-to-prepare classical states and Dicke states as starting states, (ii) a performance comparison between two $XY$-Hamiltonian mix…
Variational quantum algorithms (VQAs) are the quantum analog of classical neural networks (NNs). A VQA consists of a parameterized quantum circuit (PQC) which is composed of multiple layers of ansatzes (simpler PQCs, which are an analogy of NN layers) that differ only in selections of parameters. Previous work has identified the alternating layered ansatz as potentially a new standard ansatz in near-term quantum computing. Indeed, shallow alternating layered VQAs are easy to implement and have been shown to be both trainable and expressive. In this work, we introduce a training algorithm with …
We develop a framework for analyzing layered quantum algorithms such as quantum alternating operator ansätze. Our framework relates quantum cost gradient operators, derived from the cost and mixing Hamiltonians, to classical cost difference functions that reflect cost function neighborhood structure. By considering QAOA circuits from the Heisenberg picture, we derive exact general expressions for expectation values as series expansions in the algorithm parameters, cost gradient operators, and cost difference functions. This enables novel interpretability and insight into QAOA behavior in vario…
Determining Hamiltonian ground states and energies is a challenging task with many possible approaches on quantum computers. While variational quantum eigensolvers are popular approaches for near term hardware, adiabatic state preparation is an alternative that does not require noisy optimization of parameters. Beyond adiabatic schedules, QAOA is an important method for optimization problems. In this work we modify QAOA to apply to finding ground states of molecules and empirically evaluate the modified algorithm on several molecules. This modification applies physical insights used in classic…
We introduce a variational wavefunction for many-body ground states that involves imaginary time evolution with two different Hamiltonians in an alternating fashion with variable time intervals. We successfully apply the ansatz on the one- and two-dimensional transverse-field Ising model and systematically study its scaling for the one-dimensional model at criticality. We find the total imaginary time required scales logarithmically with system size, in contrast to the linear scaling in conventional Quantum Monte Carlo. We suggest this is due to unique dynamics permitted by alternating imagina…
A Parameter Setting Heuristic for the Quantum Alternating Operator Ansatz
Quantum Artificial Intelligence Laboratory (QuAIL), NASA Ames Research Center（量子人工智能实验室，NASA艾姆斯研究中心）；USRA Research Institute for Advanced Computer Science (RIACS)（美国大学研究协会高级计算机科学研究所）；Department of Computer Science, University of Chicago（芝加哥大学计算机系）
We introduce multiple parametrized circuit ansätze and present the results of a numerical study comparing their performance with a standard Quantum Alternating Operator Ansatz approach. The ansätze are inspired by mixing and phase separation in the QAOA, and also motivated by compilation considerations with the aim of running on near-term superconducting quantum processors. The methods are tested on random instances of a weighted quadratic binary constrained optimization problem that is fully connected for which the space of feasible solutions has constant Hamming weight. For the parameter set…
Variational Quantum Algorithms (VQAs) have received considerable attention due to their potential for achieving near-term quantum advantage. However, more work is needed to understand their scalability. One known scaling result for VQAs is barren plateaus, where certain circumstances lead to exponentially vanishing gradients. It is common folklore that problem-inspired ansatzes avoid barren plateaus, but in fact, very little is known about their gradient scaling. In this work we employ tools from quantum optimal control to develop a framework that can diagnose the presence or absence of barren…
The variational quantum eigensolver (VQE) is an attracting possible application of near-term quantum computers. Originally, the aim of the VQE is to find a ground state for a given specific Hamiltonian. It is achieved by minimizing the expectation value of the Hamiltonian with respect to an ansatz state by tuning parameters \(\bmθ\) on a quantum circuit which constructs the ansatz. Here we consider an extended problem of the VQE, namely, our objective in this work is to "generalize" the optimized output of the VQE just like machine learning. We aim to find ground states for a given set of Hami…
Variational quantum algorithms (VQAs) have shown strong evidences to gain provable computational advantages for diverse fields such as finance, machine learning, and chemistry. However, the heuristic ansatz exploited in modern VQAs is incapable of balancing the tradeoff between expressivity and trainability, which may lead to the degraded performance when executed on the noisy intermediate-scale quantum (NISQ) machines. To address this issue, here we demonstrate the first proof-of-principle experiment of applying an efficient automatic ansatz design technique, i.e., quantum architecture search…
The Quantum Approximate Optimization Algorithm (QAOA) is a standard method for combinatorial optimization with a gate-based quantum computer. The QAOA consists of a particular ansatz for the quantum circuit architecture, together with a prescription for choosing the variational parameters of the circuit. We propose modifications to both. First, we define the Gibbs objective function and show that it is superior to the energy expectation value for use as an objective function in tuning the variational parameters. Second, we describe an Ansatz Architecture Search (AAS) algorithm for searching th…
In this paper, applying the Bethe ansatz method, we investigate the Schrödinger equation for the three quasi-exactly solvable double-well potentials, namely the generalized Manning potential, the Razavy bistable potential and the hyperbolic Shifman potential. General exact expressions for the energies and the associated wave functions are obtained in terms of the roots of a set of algebraic equations. Also, we solve the same problems using the Lie algebraic approach of quasi-exact solvability through the sl(2) algebraization and show that the results are the same. The numerical evaluation of t…
We present a novel methodological framework for quantum spatial search, generalising the Childs & Goldstone ($\mathcal{CG}$) algorithm via alternating applications of marked-vertex phase shifts and continuous-time quantum walks. We determine closed form expressions for the optimal walk time and phase shift parameters for periodic graphs. These parameters are chosen to rotate the system about subsets of the graph Laplacian eigenstates, amplifying the probability of measuring the marked vertex. The state evolution is asymptotically optimal for any class of periodic graphs having a fixed number o…
The hidden $\mathbb{Z}_2$ symmetry of the asymmetric quantum Rabi model (AQRM) has recently been revealed via a systematic construction of the underlying symmetry operator. Based on the AQRM result, we propose an ansatz for the general form of the symmetry operators for AQRM-related models. Applying this ansatz we obtain the symmetry operator for three models: the anisotropic AQRM, the asymmetric Rabi-Stark model (ARSM) and the anisotropic ARSM.
This paper proposes a highly efficient quantum algorithm for portfolio optimisation targeted at near-term noisy intermediate-scale quantum computers. Recent work by Hodson et al. (2019) explored potential application of hybrid quantum-classical algorithms to the problem of financial portfolio rebalancing. In particular, they deal with the portfolio optimisation problem using the Quantum Approximate Optimisation Algorithm and the Quantum Alternating Operator Ansatz. In this paper, we demonstrate substantially better performance using a newly developed Quantum Walk Optimisation Algorithm in find…
We study quantum computing algorithms for solving certain constrained resource allocation problems we coin as Mission Covering Optimization (MCO). We compare formulations of constrained optimization problems using Quantum Annealing techniques and the Quantum Alternating Operator Ansatz (Hadfield et al. arXiv:1709.03489v2, a generalized algorithm of the Quantum Approximate Optimization Algorithm, Farhi et al. arXiv:1411.4028v1) on D-Wave and IBM machines respectively using the following metrics: cost, timing, constraints held, and qubits used. We provide results from two different MCO scenarios…
Noise-Induced Barren Plateaus in Variational Quantum Algorithms
Los Alamos National Laboratory（洛斯阿拉莫斯国家实验室）；Imperial College London（伦敦帝国学院）；University of Strathclyde（思克莱德大学）；National Physical Laboratory（国家物理实验室）；Center for Nonlinear Studies, Los Alamos National Laboratory（洛斯阿拉莫斯国家实验室非线性研究中心）
A Quantum Multi-Programming Framework to Maximize Quantum Resources for the LUCJ Ansatz
Center for Computational Life Sciences, Lerner Research Institute, The Cleveland Clinic（克利夫兰诊所莱纳研究所计算生命科学中心）；IBM Quantum, IBM Research（IBM量子，IBM研究）；Department of Chemistry, Michigan State University（密歇根州立大学化学系）
Efficient application of the factorized form of the unitary coupled-cluster ansatz for the variational quantum eigensolver algorithm by using linear combination of unitaries
针对变分量子本征求解器中分解 UCC 算符实现复杂度高的问题，本文利用隐藏 SU(2) 对称性和酉线性组合，将秩 n 算符的整体复杂度降至 n³。
QuOp_MPI is a Python package designed for parallel simulation of quantum variational algorithms. It presents an object-orientated approach to quantum variational algorithm design and utilises MPI-parallelised sparse-matrix exponentiation, the fast Fourier transform and parallel gradient evaluation to achieve the highly efficient simulation of the fundamental unitary dynamics on massively parallel systems. In this article, we introduce QuOp_MPI and explore its application to the simulation of quantum algorithms designed to solve combinatorial optimisation algorithms including the Quantum Approx…
By applying an ansatz to the eigenfunction, an exact closed form solution of the Schrödinger equation in 2D is obtained with the potentials, $V(r)=ar^2+br^4+cr^6$, $V(r)=ar+br^2+cr^{-1}$ and $V(r)=ar^2+br^{-2}+cr^{-4}+dr^{-6}$, respectively. The restrictions on the parameters of the given potential and the angular momentum $m$ are obtained.
Calculating the physical properties of quantum thermal states is a difficult problem for classical computers, rendering it intractable for most quantum many-body systems. A quantum computer, by contrast, would make many of these calculations feasible in principle, but it is still non-trivial to prepare a given thermal state or sample from it. It is also not known how to prepare special simple purifications of thermal states known as thermofield doubles, which play an important role in quantum many-body physics and quantum gravity. To address this problem, we propose a variational scheme to pre…
We provide a detailed formulation of the recently proposed variational approach [Y. Ashida et al., Phys. Rev. Lett. 121, 026805 (2018)] to study ground-state properties and out-of-equilibrium dynamics for generic quantum spin-impurity systems. Motivated by the original ideas by Tomonaga, Lee, Low, and Pines, we construct a canonical transformation that completely decouples the impurity from the bath degrees of freedom. By combining this transformation with a Gaussian ansatz for the fermionic bath, we obtain a family of variational many-body states that can efficiently encode the strong entangl…
University of Cambridge（剑桥大学）；University of Colorado Boulder（科罗拉多大学博尔德分校）
We examine the usefulness of applying neural networks as a variational state ansatz for many-body quantum systems in the context of quantum information-processing tasks. In the neural network state ansatz, the complex amplitude function of a quantum state is computed by a neural network. The resulting multipartite entanglement structure captured by this ansatz has proven rich enough to describe the ground states and unitary dynamics of various physical systems of interest. In the present paper, we initiate the study of neural network states in quantum information-processing tasks. We demonstra…
Every solution of the Bethe-ansatz equations (BAE) is characterized by a set of quantum numbers, by which we can evaluate it numerically. However, no general rule is known how to give quantum numbers for the physical solutions of BAE. For the spin-1/2 XXX chain we rigorously derive all the quantum numbers for the complete set of the Bethe-ansatz eigenvectors in the two down-spin sector with any chain length $N$. Here we obtain them both for real and complex solutions. Consequently, we prove the completeness of the Bethe ansatz and give an exact expression for the number of real solutions which…
The magnetic dressing phenomenon occurs when spins precessing in a static field (holding field) are subject to an additional, strong, alternating field. It is usually studied when such extra field is homogeneous and oscillates in one direction. We study the dynamics of spins under dressing condition in two unusual configurations. In the first instance, an inhomogeneous dressing field produces space dependent dressing phenomenon, which helps to operate the magnetometer in strongly inhomogeneous static field. In the second instance, beside the usual configuration with static and the strong ortho…
