Minimal qubit representations of Hamiltonians via conserved charges

• URL: http://arxiv.org/abs/2308.01986v2
• Date: Thu, 25 Jan 2024 09:25:16 GMT
• Title: Minimal qubit representations of Hamiltonians via conserved charges
• Authors: Lane G. Gunderman, Andrew J. Jena, Luca Dellantonio
• Abstract summary: We consider Hamiltonians written in terms of Pauli operators and systematically cut all qubits that are not essential to simulate the system. Our approach is universally applicable and lowers the complexity by first ensuring that the largest possible portion of the Hilbert space becomes irrelevant. We then exploit all conserved charges of the system, i.e., symmetries that can be expressed as Pauli operators.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In the last years, we have been witnessing a tremendous push to demonstrate that quantum computers can solve classically intractable problems. This effort, initially focused on the hardware, progressively included the simplification of the models to be simulated. We consider Hamiltonians written in terms of Pauli operators and systematically cut all qubits that are not essential to simulate the system. Our approach is universally applicable and lowers the complexity by first ensuring that the largest possible portion of the Hilbert space becomes irrelevant, and then by finding and exploiting all conserved charges of the system, i.e., symmetries that can be expressed as Pauli operators. Remarkably, both processes are classically efficient and optimal. To showcase our algorithm, we simplify chemical molecules, lattice gauge theories, the Hubbard and the Kitaev models.

Related papers

• Expanding Hardware-Efficiently Manipulable Hilbert Space via Hamiltonian Embedding [9.219297088819634]
  Many promising quantum applications depend on the efficient quantum simulation of an exponentially large sparse Hamiltonian. In this paper, we propose a technique named Hamiltonian embedding. This technique simulates a desired sparse Hamiltonian by embedding it into the evolution of a larger and more structured quantum system.
  arXiv  Detail & Related papers  (2024-01-16T18:19:29Z)
• An efficient and exact noncommutative quantum Gibbs sampler [0.0]
  We construct the first efficiently implementable and exactly detailed-balanced Lindbladian for Gibbs states of arbitrary noncommutative Hamiltonians. Our construction can also be regarded as a continuous-time quantum analog of the Metropolis-Hastings algorithm.
  arXiv  Detail & Related papers  (2023-11-15T18:51:24Z)
• Quantum Simulation of Boson-Related Hamiltonians: Techniques, Effective Hamiltonian Construction, and Error Analysis [6.8063130539569]
  We discuss the incorporation of bosonic degrees of freedom into optimized fermion algorithms for near-future quantum simulations. troublesome factors such as the magnitude of the bosonic degrees of freedom typically complicate the direct quantum simulation of these interacting models. This strategy should specifically include a suitable fermion/boson-to-qubit mapping scheme to encode sufficiently large yet manageable bosonic modes.
  arXiv  Detail & Related papers  (2023-07-13T06:46:25Z)
• Sparse random Hamiltonians are quantumly easy [105.6788971265845]
  A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. This paper shows that, for most random Hamiltonians, the maximally mixed state is a sufficiently good trial state. Phase estimation efficiently prepares states with energy arbitrarily close to the ground energy.
  arXiv  Detail & Related papers  (2023-02-07T10:57:36Z)
• Coarse-grained effective Hamiltonian via the Magnus Expansion for a three-level system [0.0]
  We use the Magnus expansion as a systematic tool to derive ambiguity-free effective Hamiltonians. We validate the accuracy of the obtained effective Hamiltonians with suitably tailored fidelities of quantum operations.
  arXiv  Detail & Related papers  (2022-12-16T14:41:10Z)
• Simulating Majorana zero modes on a noisy quantum processor [0.0]
  We use a noisy superconducting quantum processor to prepare Majorana zero modes as eigenstates of the Kitaev chain Hamiltonian. Our work builds on previous experiments with non-interacting fermionic systems.
  arXiv  Detail & Related papers  (2022-06-01T15:20:06Z)
• 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)
• Engineering analog quantum chemistry Hamiltonians using cold atoms in optical lattices [69.50862982117127]
  We benchmark the working conditions of the numerically analog simulator and find less demanding experimental setups. We also provide a deeper understanding of the errors of the simulation appearing due to discretization and finite size effects.
  arXiv  Detail & Related papers  (2020-11-28T11:23:06Z)
• 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)
• 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)
• Simulation of Thermal Relaxation in Spin Chemistry Systems on a Quantum Computer Using Inherent Qubit Decoherence [53.20999552522241]
  We seek to take advantage of qubit decoherence as a resource in simulating the behavior of real world quantum systems. We present three methods for implementing the thermal relaxation. We find excellent agreement between our results, experimental data, and the theoretical prediction.
  arXiv  Detail & Related papers  (2020-01-03T11:48:11Z)

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.