Scalable embedding of parity constraints in quantum annealing hardware

• URL: http://arxiv.org/abs/2405.14746v1
• Date: Thu, 23 May 2024 16:14:33 GMT
• Title: Scalable embedding of parity constraints in quantum annealing hardware
• Authors: Michele Cattelan, Jemma Bennett, Sheir Yarkoni, Wolfgang Lechner,
• Abstract summary: We present fixed, modular and scalable embeddings that can be used to embed any optimization problem described as an Ising Hamiltonian. These embeddings are the result of an extension of the well-known parity mapping. We show how our new embeddings can be mapped to existing quantum annealers and that the embedded Hamiltonian physical properties match the original Hamiltonian properties.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: One of the main bottlenecks in solving combinatorial optimization problems with quantum annealers is the qubit connectivity in the hardware. A possible solution for larger connectivty is minor embedding. This techniques makes the geometrical properties of the combinatorial optimization problem, encoded as a Hamiltonian, match the properties of the quantum annealing hardware. The embedding itself is a hard computational problem and therefore heuristic algorithms are required. In this work, we present fixed, modular and scalable embeddings that can be used to embed any combinatorial optimization problem described as an Ising Hamiltonian. These embeddings are the result of an extension of the well-known parity mapping, which has been used in the past to map higher-order Ising Hamiltonians to quadratic Hamiltonians, which are suitable for existing quantum hardware. We show how our new embeddings can be mapped to existing quantum annealers and that the embedded Hamiltonian physical properties match the original Hamiltonian properties.

Related papers

• Vectorization of the density matrix and quantum simulation of the von Neumann equation of time-dependent Hamiltonians [65.268245109828]
  We develop a general framework to linearize the von-Neumann equation rendering it in a suitable form for quantum simulations. We show that one of these linearizations of the von-Neumann equation corresponds to the standard case in which the state vector becomes the column stacked elements of the density matrix. A quantum algorithm to simulate the dynamics of the density matrix is proposed.
  arXiv  Detail & Related papers  (2023-06-14T23:08:51Z)
• Extension of exactly-solvable Hamiltonians using symmetries of Lie algebras [0.0]
  We show that a linear combination of operators forming a modest size Lie algebra can be substituted by determinants of the Lie algebra symmetries. The new class of solvable Hamiltonians can be measured efficiently using quantum circuits with gates that depend on the result of a mid-circuit measurement of the symmetries.
  arXiv  Detail & Related papers  (2023-05-29T17:19:56Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• Ion native variational ansatz for quantum approximate optimization [0.0]
  We show that symmetry can be broken to solve all problem instances of the Sherrington-Kirkpatrick Hamiltonian. Specifically these findings widen the class problem instances which might be solved by ion based quantum processors.
  arXiv  Detail & Related papers  (2022-06-23T18:00:01Z)
• Quantum algorithms for Schrieffer-Wolff transformation [4.237239130164727]
  The Schrieffer-Wolff transformation aims to solve degenerate perturbation problems. It describes the low-energy dynamics of the exact Hamiltonian in the low-energy subspace of unperturbed Hamiltonian. This unitary transformation can be realized by quantum circuits.
  arXiv  Detail & Related papers  (2022-01-31T15:27:57Z)
• Variational Adiabatic Gauge Transformation on real quantum hardware for effective low-energy Hamiltonians and accurate diagonalization [68.8204255655161]
  We introduce the Variational Adiabatic Gauge Transformation (VAGT) VAGT is a non-perturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit. The accuracy of VAGT is tested trough numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.
  arXiv  Detail & Related papers  (2021-11-16T20:50:08Z)
• Solving the Hubbard model using density matrix embedding theory and the variational quantum eigensolver [0.05076419064097732]
  density matrix embedding theory (DMET) could be implemented on a quantum computer to solve the Hubbard model. We derive the exact form of the embedded Hamiltonian and use it to construct efficient ansatz circuits and measurement schemes. We conduct detailed numerical simulations up to 16 qubits, the largest to date, for a range of Hubbard model parameters.
  arXiv  Detail & Related papers  (2021-08-19T10:46:58Z)
• Adiabatic Quantum Graph Matching with Permutation Matrix Constraints [75.88678895180189]
  Matching problems on 3D shapes and images are frequently formulated as quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard. We propose several reformulations of QAPs as unconstrained problems suitable for efficient execution on quantum hardware. The proposed algorithm has the potential to scale to higher dimensions on future quantum computing architectures.
  arXiv  Detail & Related papers  (2021-07-08T17:59:55Z)
• Benchmarking Embedded Chain Breaking in Quantum Annealing [0.0]
  The embedded Hamiltonian may violate the principles of adiabatic evolution and generate excitations that correspond to errors in the computed solution. We empirically benchmark the probability of chain breaks and identify sweet spots for solving a suite of embedded Hamiltonians.
  arXiv  Detail & Related papers  (2021-04-07T17:05:57Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)

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.