Optimal Clifford Initial States for Ising Hamiltonians

• URL: http://arxiv.org/abs/2312.01036v2
• Date: Sat, 24 Feb 2024 17:31:35 GMT
• Title: Optimal Clifford Initial States for Ising Hamiltonians
• Authors: Bikrant Bhattacharyya, Gokul Subramanian Ravi
• Abstract summary: CAFQA is a classical bootstrap for Variational Quantum Algorithms. We analyze the Clifford states that minimization for a new type of Hamiltonian, namely Transverse Field Ising Hamiltonians.
• Score: 0.40015650275668363
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Evaluating quantum circuits is currently very noisy. Therefore, developing classical bootstraps that help minimize the number of times quantum circuits have to be executed on noisy quantum devices is a powerful technique for improving the practicality of Variational Quantum Algorithms. CAFQA is a previously proposed classical bootstrap for VQAs that uses an initial ansatz that reduces to Clifford operators. CAFQA has been shown to produce fairly accurate initialization for VQA applied to molecular chemistry Hamiltonians. Motivated by this result, in this paper we seek to analyze the Clifford states that optimize the cost function for a new type of Hamiltonian, namely Transverse Field Ising Hamiltonians. Our primary result connects the problem of finding the optimal CAFQA initialization to a submodular minimization problem which in turn can be solved in polynomial time.

Related papers

• Evaluating a quantum-classical quantum Monte Carlo algorithm with Matchgate shadows [5.610728118087272]
  Recent work proposed a hybrid quantum-classical quantum Monte Carlo (QC-QMC) algorithm using Clifford shadows to determine the ground state of a Fermionic Hamiltonian. This approach displayed inherent noise resilience and the potential for improved accuracy compared to its purely classical counterpart. In this work, we investigate an improved QC-QMC scheme utilizing the recently developed Matchgate shadows technique, which removes the aforementioned exponential bottleneck.
  arXiv  Detail & Related papers  (2024-04-28T20:10:49Z)
• Compressed-sensing Lindbladian quantum tomography with trapped ions [44.99833362998488]
  Characterizing the dynamics of quantum systems is a central task for the development of quantum information processors. We propose two different improvements of Lindbladian quantum tomography (LQT) that alleviate previous shortcomings.
  arXiv  Detail & Related papers  (2024-03-12T09:58:37Z)
• Truncation technique for variational quantum eigensolver for Molecular Hamiltonians [0.0]
  variational quantum eigensolver (VQE) is one of the most promising quantum algorithms for noisy quantum devices. We propose a physically intuitive truncation technique that starts the optimization procedure with a truncated Hamiltonian. This strategy allows us to reduce the required number of evaluations for the expectation value of Hamiltonian on a quantum computer.
  arXiv  Detail & Related papers  (2024-02-02T18:45:12Z)
• Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• CAFQA: A classical simulation bootstrap for variational quantum algorithms [8.659073885003684]
  The CAFQA ansatz is a hardware-efficient circuit built with only Clifford gates. CAFQA achieves mean accuracy improvements of 6.4x and 56.8x, over the state-of-the-art, on different metrics. With CAFQA's high-accuracy, the convergence of VQAs is shown to accelerate by 2.5x, even for small molecules.
  arXiv  Detail & Related papers  (2022-02-25T19:29:59Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Quantum Approximate Optimization Algorithm Based Maximum Likelihood Detection [80.28858481461418]
  Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices. Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices.
  arXiv  Detail & Related papers  (2021-07-11T10:56:24Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Simulated Quantum Annealing is Efficient on the Spike Hamiltonian [0.15229257192293202]
  We study the convergence of a classical algorithm called Simulated Quantum Annealing (SQA) on the Spike Hamiltonian. This toy model Hamiltonian encodes a simple bit-symmetric cost function f in the computational basis.
  arXiv  Detail & Related papers  (2020-11-30T18:30:15Z)
• Quadratic Clifford expansion for efficient benchmarking and initialization of variational quantum algorithms [0.8808007156832224]
  Variational quantum algorithms are considered to be appealing applications of near-term quantum computers. We propose a perturbative approach for efficient benchmarking of variational quantum algorithms.
  arXiv  Detail & Related papers  (2020-11-19T16:09:00Z)

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.