Sort by
Markov-chain Monte Carlo method enhanced by a quantum alternating operator ansatz

Quantum computation is expected to accelerate certain computational tasks over classical counterparts. Its most primitive advantage is its ability to sample from classically intractable probability distributions. A promising approach to make use of this fact is the so-called quantum-enhanced Markov-chain Monte Carlo (qe-MCMC) method [D. Layden , ], which uses outputs from quantum circuits as the proposal distributions. In this paper, we propose the use of a quantum alternating operator ansatz (QAOA) for qe-MCMC and provide a strategy to optimize its parameters to improve convergence speed while keeping its depth shallow. The proposed QAOA-type circuit is designed to satisfy the specific constraint which qe-MCMC requires with arbitrary parameters. Through our extensive numerical analysis, we find a correlation in a certain parameter range between an experimentally measurable value, acceptance rate of MCMC, and the spectral gap of the MCMC transition matrix, which determines the convergence speed. This allows us to optimize the parameter in the QAOA circuit and achieve quadratic speedup in convergence. Since MCMC is used in various areas such as statistical physics and machine learning, this paper represents an important step toward realizing practical quantum advantage with currently available quantum computers through qe-MCMC. Published by the American Physical Society 2024

Open Access Just Published
Relevant
Robust Effective Ground State in a Nonintegrable Floquet Quantum Circuit.

An external periodic (Floquet) drive is believed to bring any initial state to the featureless infinite temperature state in generic nonintegrable isolated quantum many-body systems in the thermodynamic limit, irrespective of the driving frequency Ω. However, numerical or analytical evidence either proving or disproving this hypothesis is very limited and the issue has remained unsettled. Here, we study the initial state dependence of Floquet heating in a nonintegrable kicked Ising chain of length up to L=30 with an efficient quantum circuit simulator, showing a possible counterexample: the ground state of the effective Floquet Hamiltonian is exceptionally robust against heating, and could stay at finite energy density even after infinitely many Floquet cycles, if the driving period is shorter than a threshold value. This sharp energy localization transition or crossover does not happen for generic excited states. The exceptional robustness of the ground state is interpreted by (i)its isolation in the energy spectrum and (ii)the fact that those states with L-independent ℏΩ energy above the ground state energy of any generic local Hamiltonian, like the approximate Floquet Hamiltonian, are atypical and viewed as a collection of noninteracting quasiparticles. Our finding paves the way for engineering Floquet protocols with finite driving periods realizing long-lived, or possibly even perpetual, Floquet phases by initial state design.

Open Access Just Published
Relevant
Exponentially improved efficient machine learning for quantum many-body states with provable guarantees

Solving the ground state and the ground-state properties of quantum many-body systems is generically a hard task for classical algorithms. For a family of Hamiltonians defined on an m-dimensional space of physical parameters, the ground state and its properties at an arbitrary parameter configuration can be predicted via a machine learning protocol up to a prescribed prediction error ɛ, provided that a sample set (of size N) of the states can be efficiently prepared and measured. In a recent work [Huang , ], a rigorous guarantee for such a generalization was proved. Unfortunately, an exponential scaling for the provable sample complexity, N=mO(1ɛ), was found to be universal for generic gapped Hamiltonians. This result applies to the situation where the dimension of the parameter space is large, while the scaling with the accuracy is not an urgent factor, not entering the realm of more precise learning and prediction. In this work, we consider an alternative relevant scenario, where the effective dimension m is a finite, not necessarily large constant, while the scaling with the prediction error becomes the central concern. By jointly preserving the fundamental properties of density matrices in the learning protocol and utilizing the continuity of quantum states in the parameter range of interest, we rigorously obtain a polynomial sample complexity for predicting quantum many-body states and their properties, with respect to the prediction error ɛ and the number of qubits, n, with N=poly(ɛ−1,n,ln1δ), where poly denotes a polynomial function, and (1−δ) is the probability of success. Moreover, if restricted to learning local quantum-state properties, the number of samples can be further reduced to N=poly(ɛ−1,lnnδ). Numerical demonstrations confirm our findings, and an alternative approach utilizing statistical learning theory with reproducing kernel Hilbert space achieves consistent results. The mere continuity assumption indicates that our results are not restricted to gapped Hamiltonian systems and properties within the same phase. Published by the American Physical Society 2024

Open Access
Relevant