We report on the energy-expectation-value landscapes produced by the single-layer ($p=1$) Quantum Approximate Optimization Algorithm (QAOA) when being used to solve Ising problems. The landscapes are obtained using an analytical formula that we derive. The formula allows us to predict the landscape for any given Ising problem instance and consequently predict the optimal QAOA parameters for heuristically solving that instance using the single-layer QAOA. We have validated our analytical formula by showing that it accurately reproduces the landscapes published in recent experimental reports. We then applied our methods to address the question: how well is the single-layer QAOA able to solve large benchmark problem instances? We used our analytical formula to calculate the optimal energy-expectation values for benchmark MAX-CUT problems containing up to $7\,000$ vertices and $41\,459$ edges. We also calculated the optimal energy expectations for general Ising problems with up to $100\,000$ vertices and $150\,000$ edges. Our results provide an estimate for how well the single-layer QAOA may work when run on a quantum computer with thousands of qubits. In addition to providing performance estimates when optimal angles are used, we are able to use our analytical results to investigate the difficulties one may encounter when running the QAOA in practice for different classes of Ising instances. We find that depending on the parameters of the Ising Hamiltonian, the expectation-value landscapes can be rather complex, with sharp features that necessitate highly accurate rotation gates in order for the QAOA to be run optimally on quantum hardware. We also present analytical results that explain some of the qualitative landscape features that are observed numerically.
We propose a method to evaluate parameters in the Hamiltonian of the Ising chain under site-dependent transverse fields, with a proviso that we can control and measure one of the edge spins only. We evaluate the eigenvalues of the Hamiltonian and the time-evoultion operator exactly for a 3-spin chain, from which we obtain the expectation values of $σ_x$ of the first spin. The parameters are found from the peak positions of the Fourier transform of the expectation value. There are four assumptions in our method, which are mild enough to be satisfied in many physical systems.
We investigate the relation between the classical ergodicity and the quantum eigenstate thermalization in the fully connected Ising ferromagnets. In the case of spin-1/2, an expectation value of an observable in a single energy eigenstate coincides with the long-time average in the underlying classical dynamics, which is a consequence of the Wentzel-Kramers-Brillouin approximation. In the case of spin-1, the underlying classical dynamics is not necessarily ergodic. In that case, it turns out that, in the thermodynamic limit, the statistics of the expectation values of an observable in the ener…
We explore ideas for generating sounds and eventually music by using quantum devices in the NISQ era using quantum circuits. In particular, we first consider a concept for a "qeyboard", i.e. a quantum keyboard, where the real-time behaviour of expectation values using a time evolving quantum circuit can be associated to sound features like intensity, frequency and tone. Then, we examine how these properties can be extracted from physical quantum systems, taking the Ising model as an example. This can be realized by measuring physical quantities of the quantum states of the system, e.g. the ene…
We exactly construct one- and two-qubit holonomic quantum gates in terms of isospectral deformations of an Ising model Hamiltonian. A single logical qubit is constructed out of two spin-1/2 particles; the qubit is a dimer. We find that the holonomic gates obtained are discrete but dense in the unitary group. Therefore an approximate gate for a desired one can be constructed with arbitrary accuracy.
In this letter, we provide analytical and numerical evidence that the single-layer Quantum Approximate Optimization Algorithm (QAOA) on universal Ising spin models produces thermal-like states. We find that these pseudo-Boltzmann states can not be efficiently simulated on classical computers according to the general state-of-the-art condition that ensures rapid mixing for Ising models. Moreover, we observe that the temperature depends on a hidden universal correlation between the energy of a state and the covariance of other energy levels and the Hamming distances of the state to those energie…
This paper presents a method of computing approximate conservation laws and eigenstates of integrability-broken models using the concept of adiabatic continuation. Given some Hamiltonian, eigenstates and conserved operators may be computed by using those of a simple Hamiltonian close by in parameter space, dressed by some unitary rotation. However, most adiabatic continuation analyses only use this unitary implicitly. In this work, approximate adiabatic gauge potentials are used to construct a state dressing using variational methods, to compute eigenstates via a rotated truncated spectrum app…
We study the non-equilibrium dynamics of a homogeneous quantum Ising ring after a quench, in which the transverse field $g$ suddenly changes from zero to a nonzero value. The long-timescale reduced dynamics of a single spin and of two nearest-neighbor spins, which involves the evaluation of expectation values of odd operators that break the fermion parity, is exactly obtained for finite-size but large rings through the use of a recently developed Pfaffian method [N. Wu, Phys. Rev. E 101, 042108 (2020)]. Time dependence of the transverse and longitudinal magnetizations, single-spin purity, expe…
In this paper, we describe the usage of the Quantum Approximate Optimization Algorithm (QAOA), which is a quantum-classical heuristic, to solve a combinatorial optimization and integer programming task known as Vehicle Routing Problem (VRP). We outline the Ising formulation for VRP and present a detailed procedure to solve VRP by minimizing its simulated Ising Hamiltonian using the IBM Qiskit platform. Here, we attempt to find solutions for the VRP problems: (4,2), (5,2), and (5,3), where each (n, k) represents a VRP problem with n locations and k vehicles. We find that the performance of QAOA…
We introduce an approximate description of an $N$-qubit state, which contains sufficient information to estimate the expectation value of any observable with precision independent of $N$. We show, in fact, that the error in the estimation of the observables' expectation values decreases as the inverse of the square root of the number of the system's identical preparations and increases, at most, linearly in a suitably defined, $N$-independent, seminorm of the observables. Building the approximate description of the $N$-qubit state only requires repetitions of single-qubit rotations followed by…
We study the Kitaev-Ising model, where ferromagnetic Ising interactions are added to the Kitaev model on a lattice. This model has two phases which are characterized by topological and ferromagnetic order. Transitions between these two kinds of order are then studied on a quasi-one dimensional system, a ladder, and on a two dimensional periodic lattice, a torus. By exactly mapping the quasi-one dimensional case to an anisotropic XY chain we show that the transition occurs at zero $λ$ where $λ$ is the strength of the ferromagnetic coupling. In the two dimensional case the model is mapped to a 2…
We study equilibrium as well as dynamical properties of the finite-size fully connected Ising model with a transverse field at the zero temperature. In relation to the equilibrium, we present approximate ground and first excited states that have large overlap -- except near the phase transition point -- with the exact energy eigenstates. For both the approximate and exact eigenstates, we compute the energy gap, concurrence, and geometric measure of quantum entanglement. We observe a good match in the case of energy gap and geometric entanglement between the approximate and exact eigenstates. W…
Quantum computers and simulators may offer significant advantages over their classical counterparts, providing insights into quantum many-body systems and possibly improving performance for solving exponentially hard problems, such as optimization and satisfiability. Here we report the implementation of a low-depth Quantum Approximate Optimization Algorithm (QAOA) using an analog quantum simulator. We estimate the ground state energy of the Transverse Field Ising Model with long-range interactions with tunable range and we optimize the corresponding combinatorial classical problem by sampling …
Encoding classical data on quantum spin Hamiltonians yields ordered spin ground states which are used to discriminate data types for binary classification. The Ising Hamiltonian is a typical spin model to encode classical data onto qubits, known as the ZZ feature map. We assess the ground states of the Ising Hamiltonian encoded with three separate data sets containing two classes of data. A new methodology is proposed to predict a certain data class using the ground state of the encoded Ising Hamiltonian. Ground state observables are obtained through quantum simulation on a quantum computer, a…
The origin of thermal and quantum entanglement in a class of three-dimensional spin models, at low momenta, is traced to purely topological reasons. The establishment of the result is facilitated by the gauge principle which, when used in conjunction with the duality mapping of the spin models, enables us to recast them as lattice Chern-Simons gauge theories. The thermal and quantum entanglement measures are expressed in terms of the expectation values of Wilson lines, loops, and their generalisations. For continuous spins, these are known to yield the topological invariants of knots and links…
We construct a map between the quantum field theory of free Weyl or Majorana fermions and the probability distribution of a classical statistical ensemble for Ising spins or discrete bits. More precisely, a Grassmann functional integral based on a real Grassmann algebra specifies the time evolution of the real wave function $q_τ(t)$ for the Ising states $τ$. The time dependent probability distribution of a generalized Ising model obtains as $p_τ(t)=q^2_τ(t)$. The functional integral employs a lattice regularization for single Weyl or Majorana spinors. We further introduce the complex structure…
We consider the calculation of ground-state expectation values for the non-Hermitian Z(N) spin chain described by free parafermions. For N=2 the model reduces to the quantum Ising chain in a transverse field with open boundary conditions. Use is made of the Hellmann-Feynman theorem to obtain exact results for particular single site and nearest-neighbour ground-state expectation values for general N which are valid for sites deep inside the chain. These results are tested numerically for N=3, along with how they change as a function of distance from the boundary.
Rigetti Computing（里盖蒂计算公司）；Information Sciences Institute, University of Southern California（南加州大学信息科学研究所）
We introduce an approximate description of an $N$-qubit state, which contains sufficient information to estimate the expectation value of any observable to a precision that is upper bounded by the ratio of a suitably-defined seminorm of the observable to the square root of the number of the system's identical preparations $M$, with no explicit dependence on $N$. We describe an operational procedure for constructing the approximate description of the state that requires, besides the quantum state preparation, only single-qubit rotations followed by single-qubit measurements. We show that follow…
In a number of classical statistical-physical models, there exists a characteristic dimensionality called the upper critical dimension above which one observes the mean-field critical behavior. Instead of constructing high-dimensional lattices, however, one can also consider infinite-dimensional structures, and the question is whether this mean-field character extends to quantum-mechanical cases as well. We therefore investigate the transverse-field quantum Ising model on the globally coupled network and the Watts-Strogatz small-world network by means of quantum Monte Carlo simulations and the…
Quantum excitations in lattice systems always propagate at a finite maximum velocity. We probe this mechanism by considering a defect travelling at a constant velocity in the quantum Ising spin chain in transverse field. Independently of the microscopic details of the defect, we characterize the expectation value of local observables at large times and large distances from the impurity, where a Local Quasi Stationary State (LQSS) emerges. The LQSS is strongly affected by the defect velocity: for superluminal defects, it exhibits a growing region where translational invariance is spontaneously …
Finding the ground states of the Ising Hamiltonian [1] maps to various combinatorial optimization problems in biology, medicine, wireless communications, artificial intelligence, and social network. So far no efficient classical and quantum algorithm is known for these problems, and intensive research is focused on creating physical systems - Ising machines - capable of finding the absolute or approximate ground states of the Ising Hamiltonian [2-6]. Here we report a novel Ising machine using a network of degenerate optical parametric oscillators (OPOs). Spins are represented with above-thresh…
A linear-time algorithm is presented for the construction of the Gibbs distribution of configurations in the Ising model, on a quantum computer. The algorithm is designed so that each run provides one configuration with a quantum probability equal to the corresponding thermodynamic weight. The partition function is thus approximated efficiently. The algorithm neither suffers from critical slowing down, nor gets stuck in local minima. The algorithm can be A linear-time algorithm is presented for the construction of the Gibbs distribution of configurations in the Ising model, on a quantum comput…
We discuss real time evolution for the quantum Ising model in one spatial dimension with $N_s$ sites. In the limit where the nearest neighbor interactions $J$ in the spatial directions are small, there is a simple physical picture where qubit states can be interpreted as approximate particle occupations. Using exact diagonalization, for initial states with one or two particles, we show that for small $J$, discrete Bessel functions provide very accurate expressions for the evolution of the occupancies corresponding to initial states with one and two particles. Boundary conditions play an import…
Ising machines are hardware solvers which aim to find the absolute or approximate ground states of the Ising model. The Ising model is of fundamental computational interest because it is possible to formulate any problem in the complexity class NP as an Ising problem with only polynomial overhead. A scalable Ising machine that outperforms existing standard digital computers could have a huge impact for practical applications for a wide variety of optimization problems. In this review, we survey the current status of various approaches to constructing Ising machines and explain their underlying…
We study a three-dimensional (3D) classical Ising model that is exactly solvable when some coupling constants take certain imaginary values. The solution combines and generalizes the Onsager-Kaufman solution of the 2D Ising model and the solution of Kitaev's honeycomb model, leading to a three-parameter phase diagram with a third order phase transition between two distinct phases. Interestingly, the phases of this model are distinguished by topological features: the expectation value of a certain family of loop observables depend only on the topology of the loop (whether the loop is contractib…
We propose that neuromorphic computing can perform quantum operations. Spiking neurons in the active or silent states are connected to the two states of Ising spins. A quantum density matrix is constructed from the expectation values and correlations of the Ising spins. As a step towards quantum computation we show for a two qubit system that quantum gates can be learned as a change of parameters for neural network dynamics. Our proposal for probabilistic computing goes beyond Markov chains, which are based on transition probabilities. Constraints on classical probability distributions relate …
We study the phase transition from two different topological phases to the ferromagnetic phase by focusing on points of the phase transition. To this end, we present a detailed mapping from such models to the Ising model in a transverse field. Such a mapping is derived by re-writing the initial Hamiltonian in a new basis so that the final model in such a basis has a well-known approximated phase transition point. Specifically, we consider the toric codes and the color codes on some various lattices with Ising perturbation. Our results provide a useful table to compare the robustness of the top…
We present an approximate analytical solution to the dynamic equation of two Ising-coupled qubits with oscillating classical control fields that are nonperpendicular to the static drift fields. This is a situation that has recently arisen in some solid-state experiments. With our solution we derive the analytical expressions for the local invariants as well as the local rotations needed to isolate a purely nonlocal gate. This determines the set of parameters that are required to generate any entangling gate. Moreover, we use our results to describe a recent experimental work on capacitively co…
We present an algorithm to approximate partition functions of 3-body classical Ising models on two-dimensional lattices of arbitrary genus, in the real-temperature regime. Even though our algorithm is purely classical, it is designed by exploiting a connection to topological quantum systems, namely the color codes. The algorithm performance is exponentially better than other approaches which employ mappings between partition functions and quantum state overlaps. In addition, our approach gives rise to a protocol for quantum simulation of such Ising models by simply measuring local observables …
In this paper, we derive a new generalisation of the strong subadditivity of the entropy to the setting of general conditional expectations onto arbitrary finite-dimensional von Neumann algebras. The latter inequality, which we call approximate tensorization of the relative entropy, can be expressed as a lower bound for the sum of relative entropies between a given density and its respective projections onto two intersecting von Neumann algebras in terms of the relative entropy between the same density and its projection onto an algebra in the intersection, up to multiplicative and additive co…
We explore the Mott insulating state of single-band bosonic pairing Hamiltonians using analytical approaches and large scale density matrix renormalization group calculations. We focus on the second Mott lobe which exhibits a magnetic quantum phase transition in the Ising universality class. We use this feature to discuss the behavior of a range of physical observables within the framework of the 1D quantum Ising model and the strongly anisotropic Heisenberg model. This includes the properties of local expectation values and correlation functions both at and away from criticality. Depending on…
We study the problem of approximating the Ising model partition function with complex parameters on bounded degree graphs. We establish a deterministic polynomial-time approximation scheme for the partition function when the interactions and external fields are absolutely bounded close to zero. Furthermore, we prove that for this class of Ising models the partition function does not vanish. Our algorithm is based on an approach due to Barvinok for approximating evaluations of a polynomial based on the location of the complex zeros and a technique due to Patel and Regts for efficiently computin…
