Essentiality of the Non-stoquastic Hamiltonians and Driver Graph Design in Quantum Optimization Annealing

• URL: http://arxiv.org/abs/2105.02110v2
• Date: Tue, 26 Apr 2022 23:03:53 GMT
• Title: Essentiality of the Non-stoquastic Hamiltonians and Driver Graph Design in Quantum Optimization Annealing
• Authors: Vicky Choi
• Abstract summary: A non-stoquastic Hamiltonian can be stoquastic or properly non-stoquastic when its ground state has both positive and negative amplitudes. We show how to design an appropriate XX-driver graph with an appropriate XX-coupler strength without knowing the prior problem structure. The speedup is exponential in the original AC-distance, which can be sub-exponential or exponential in the system size.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: One of the distinct features of quantum mechanics is that the probability amplitude can have both positive and negative signs, which has no classical counterpart as the classical probability must be positive. Consequently, one possible way to achieve quantum speedup is to explicitly harness this feature. Unlike a stoquastic Hamiltonian whose ground state has only positive amplitudes (with respect to the computational basis), a non-stoquastic Hamiltonian can be eventually stoquastic or properly non-stoquastic when its ground state has both positive and negative amplitudes. In this paper, we describe that, for some hard instances which are characterized by the presence of an anti-crossing (AC) in a transverse-field quantum annealing (QA) algorithm, how to design an appropriate XX-driver graph (without knowing the prior problem structure) with an appropriate XX-coupler strength such that the resulting non-stoquastic QA algorithm is proper-non-stoquastic with two bridged anti-crossings (a double-AC) where the spectral gap between the first and second level is large enough such that the system can be operated diabatically in polynomial time. The speedup is exponential in the original AC-distance, which can be sub-exponential or exponential in the system size, over the stoquastic QA algorithm, and possibly the same order of speedup over the state-of-the-art classical algorithms in optimization. This work is developed based on the novel characterizations of a modified and generalized parametrization definition of an anti-crossing in the context of quantum optimization annealing introduced in [4].

Related papers

• Quantum Algorithms for Stochastic Differential Equations: A Schrödingerisation Approach [29.662683446339194]
  We propose quantum algorithms for linear differential equations. The gate complexity of our algorithms exhibits an $mathcalO(dlog(Nd))$ dependence on the dimensions. The algorithms are numerically verified for the Ornstein-Uhlenbeck processes, Brownian motions, and one-dimensional L'evy flights.
  arXiv  Detail & Related papers  (2024-12-19T14:04:11Z)
• Bayesian Quantum Amplitude Estimation [49.1574468325115]
  We introduce BAE, a noise-aware Bayesian algorithm for quantum amplitude estimation. We show that BAE achieves Heisenberg-limited estimation and benchmark it against other approaches.
  arXiv  Detail & Related papers  (2024-12-05T18:09:41Z)
• Solving the homogeneous Bethe-Salpeter equation with a quantum annealer [34.173566188833156]
  The homogeneous Bethe-Salpeter equation (hBSE) was solved for the first time by using a D-Wave quantum annealer. A broad numerical analysis of the proposed algorithms was carried out using both the proprietary simulated-anneaing package and the D-Wave Advantage 4.1 system.
  arXiv  Detail & Related papers  (2024-06-26T18:12:53Z)
• Bias-field digitized counterdiabatic quantum optimization [39.58317527488534]
  We call this protocol bias-field digitizeddiabatic quantum optimization (BF-DCQO) Our purely quantum approach eliminates the dependency on classical variational quantum algorithms. It achieves scaling improvements in ground state success probabilities, increasing by up to two orders of magnitude.
  arXiv  Detail & Related papers  (2024-05-22T18:11:42Z)
• Calculating the expected value function of a two-stage stochastic optimization program with a quantum algorithm [0.0]
  Two-stage programming is a problem formulation for decision-making under uncertainty. This work uses a quantum algorithm to estimate the expected value function with a speedup.
  arXiv  Detail & Related papers  (2024-02-23T00:07:34Z)
• Quadratic acceleration of multi-step probabilistic algorithms for state preparation [0.0]
  A non-unitary operator is typically designed to decay undesirable states contained in an initial state. Probabilistic algorithms do not accelerate the computational process compared to classical ones.
  arXiv  Detail & Related papers  (2023-08-07T14:07:03Z)
• Effectiveness of quantum annealing for continuous-variable optimization [0.0]
  We test the performance of quantum annealing applied to a one-dimensional continuous-variable function with a rugged energy landscape. We conclude that the hardware realization of quantum annealing has the potential to significantly outperform the best classical algorithms.
  arXiv  Detail & Related papers  (2023-05-11T07:59:19Z)
• Iterative Qubit Coupled Cluster using only Clifford circuits [36.136619420474766]
  An ideal state preparation protocol can be characterized by being easily generated classically. We propose a method that meets these requirements by introducing a variant of the iterative qubit coupled cluster (iQCC) We demonstrate the algorithm's correctness in ground-state simulations and extend our study to complex systems like the titanium-based compound Ti(C5H5)(CH3)3 with a (20, 20) active space.
  arXiv  Detail & Related papers  (2022-11-18T20:31:10Z)
• On optimization of coherent and incoherent controls for two-level quantum systems [77.34726150561087]
  This article considers some control problems for closed and open two-level quantum systems. The closed system's dynamics is governed by the Schr"odinger equation with coherent control. The open system's dynamics is governed by the Gorini-Kossakowski-Sudarshan-Lindblad master equation.
  arXiv  Detail & Related papers  (2022-05-05T09:08:03Z)
• Accelerated Convergence of Contracted Quantum Eigensolvers through a Quasi-Second-Order, Locally Parameterized Optimization [0.0]
  A contracted quantum eigensolver (CQE) finds a solution to the many-electron Schr"odinger equation on a quantum computer. In this work, we accelerate the convergence of the CQE and its wavefunction ansatz via tools from classical optimization theory.
  arXiv  Detail & Related papers  (2022-05-03T18:48:04Z)
• Q-FW: A Hybrid Classical-Quantum Frank-Wolfe for Quadratic Binary Optimization [44.96576908957141]
  We present a hybrid classical-quantum framework based on the Frank-Wolfe algorithm, Q-FW, for solving quadratic, linear iterations problems on quantum computers.
  arXiv  Detail & Related papers  (2022-03-23T18:00:03Z)
• Digitized-Counterdiabatic Quantum Optimization [4.336065967298193]
  We propose digitized-diabatic quantum optimization (DCQO) to achieve enhancement over adiabatic quantum optimization for the general Ising spin-glass model. This is accomplished via the digitization of adiabatic quantum algorithms that are catalysed by the addition of non-stoquastic counterdiabatic terms.
  arXiv  Detail & Related papers  (2022-01-03T18:21:54Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Stoquasticity in circuit QED [78.980148137396]
  We show that scalable sign-problem free path integral Monte Carlo simulations can typically be performed for such systems. We corroborate the recent finding that an effective, non-stoquastic qubit Hamiltonian can emerge in a system of capacitively coupled flux qubits.
  arXiv  Detail & Related papers  (2020-11-02T16:41:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.