General, efficient, and robust Hamiltonian engineering

• URL: http://arxiv.org/abs/2410.19903v2
• Date: Thu, 17 Apr 2025 07:29:46 GMT
• Title: General, efficient, and robust Hamiltonian engineering
• Authors: Pascal Baßler, Markus Heinrich, Martin Kliesch,
• Abstract summary: We introduce an efficient and robust scheme to engineer arbitrary local many-body Hamiltonians.<n>These sequences are constructed by efficiently solving a linear program (LP) which minimizes the total evolution time.<n>In particular, we solve the Hamiltonian engineering problem for arbitrary two-body Hamiltonians on a 2D square lattice with $225$ qubits in only $60$ seconds.
• Score: 0.20482269513546453
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Implementing the time evolution under a desired target Hamiltonian is critical for various applications in quantum science. Due to the exponential increase of parameters in the system size and due to experimental imperfections this task can be challenging in quantum many-body settings. We introduce an efficient and robust scheme to engineer arbitrary local many-body Hamiltonians. This is achieved by applying simple single-qubit gates simultaneously to an always-on system Hamiltonian, which we assume to be native to a given platform. These sequences are constructed by efficiently solving a linear program (LP) which minimizes the total evolution time. In this way, we can engineer target Hamiltonians that are only limited by the locality of the Pauli terms in the system Hamiltonian. Based on average Hamiltonian theory and by using robust composite pulses, we make our schemes robust against errors including finite pulse time errors and various calibration errors. To demonstrate the performance of our scheme, we provide numerical simulations. In particular, we solve the Hamiltonian engineering problem for arbitrary two-body Hamiltonians on a 2D square lattice with $225$ qubits in only $60$ seconds. Moreover, we simulate the time evolution of Heisenberg Hamiltonians for smaller system sizes with a fidelity larger than $99.9\%$, which is orders of magnitude better than non-robust implementations.

Related papers

• Robust analog quantum simulators by quantum error-detecting codes [22.034646136056804]
  We provide a recipe for error-resilient Hamiltonian simulations, making use of an excited encoding subspace stabilized by solely $2$-local commuting Hamiltonians. Our method is scalable as it only requires penalty terms that scale to system size.
  arXiv  Detail & Related papers  (2024-12-10T18:58:05Z)
• New random compiler for Hamiltonians via Markov Chains [0.07499722271664146]
  We develop a new compiler, similar to the first order randomized Trotter, or qDRIFT, but with an arguably simpler framework. We first present the model and derive its governing equations. We then define and analyze the simulation error for a sum of two Hamiltonians, and generalize it to a sum of $Q$ Hamiltonians.
  arXiv  Detail & Related papers  (2024-11-10T14:57:25Z)
• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• Gate Efficient Composition of Hamiltonian Simulation and Block-Encoding with its Application on HUBO, Fermion Second-Quantization Operators and Finite Difference Method [0.0]
  This article proposes a simple formalism which unifies Hamiltonian simulation techniques from different fields. It leads to a gate decomposition and a scaling different from the usual strategy. It can significantly reduce the quantum circuit number of rotational gates, multi-qubit gates, and the circuit depth.
  arXiv  Detail & Related papers  (2024-10-24T12:26:50Z)
• Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
  We use FNOs to model the evolution of random quantum spin systems. We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
  arXiv  Detail & Related papers  (2024-09-05T07:18:09Z)
• Variational quantum Hamiltonian engineering [0.9002260638342727]
  We propose a variational quantum algorithm (VQA) called variational quantum Hamiltonian engineering (VQHE) to minimize the Pauli norm of Hamiltonian. First, we develop a theory to encode the Pauli norm optimization problem into the vector L1-norm minimization problem. Then we devise an appropriate cost function and utilize the parameterized quantum circuits (PQC) to minimize the cost function.
  arXiv  Detail & Related papers  (2024-06-13T10:57:35Z)
• Minimal qubit representations of Hamiltonians via conserved charges [0.0]
  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.
  arXiv  Detail & Related papers  (2023-08-03T18:47:46Z)
• 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)
• On the Impossibility of General Parallel Fast-forwarding of Hamiltonian Simulation [4.925967492198012]
  Hamiltonian simulation is one of the most important problems in the field of quantum computing. Existing simulation algorithms require running time at least linear in the evolution time $T$. It is intriguing whether we can achieve fast Hamiltonian simulation with the power of parallelism.
  arXiv  Detail & Related papers  (2023-05-21T12:30:00Z)
• 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)
• Quantum-Inspired Tempering for Ground State Approximation using Artificial Neural Networks [0.0]
  We propose a parallel tempering method that facilitates escape from local minima. We show that augmenting the training with quantum parallel tempering becomes useful to finding good approximations to the ground states of problem instances.
  arXiv  Detail & Related papers  (2022-10-20T16:50:32Z)
• Time Dependent Hamiltonian Simulation Using Discrete Clock Constructions [42.3779227963298]
  We provide a framework for encoding time dependent dynamics as time independent systems. First, we create a time dependent simulation algorithm based on performing qubitization on the augmented clock system. Second, we define a natural generalization of multiproduct formulas for time-ordered exponentials.
  arXiv  Detail & Related papers  (2022-03-21T21:29:22Z)
• Hamiltonian simulation with random inputs [74.82351543483588]
  Theory of average-case performance of Hamiltonian simulation with random initial states. Numerical evidence suggests that this theory accurately characterizes the average error for concrete models.
  arXiv  Detail & Related papers  (2021-11-08T19:08:42Z)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• 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)
• Fast and differentiable simulation of driven quantum systems [58.720142291102135]
  We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods. We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
  arXiv  Detail & Related papers  (2020-12-16T21:43:38Z)
• Quantum Zeno approach for molecular energies with maximum commuting initialHamiltonians [0.0]
  We use a quantum adiabatic and simulated-annealing framework to compute the ground state of small molecules. In addition to the ground state, the low lying excited states canbe obtained using this quantum Zeno approach with equal accuracy to that of the ground state.
  arXiv  Detail & Related papers  (2020-06-01T16:43:22Z)
• 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)
• Hamiltonian Simulation Algorithms for Near-Term Quantum Hardware [6.445605125467574]
  We develop quantum algorithms for Hamiltonian simulation "one level below" the circuit model. We analyse the impact of these techniques under the standard error model. We derive analytic circuit identities for efficiently synthesising multi-qubit evolutions from two-qubit interactions.
  arXiv  Detail & Related papers  (2020-03-15T18:22:02Z)

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.