Quantum circuit model for Hamiltonian simulation via Trotter decomposition

• URL: http://arxiv.org/abs/2405.13605v1
• Date: Wed, 22 May 2024 12:57:09 GMT
• Title: Quantum circuit model for Hamiltonian simulation via Trotter decomposition
• Authors: Rohit Sarma Sarkar, Sabyasachi Chakraborty, Bibhas Adhikari,
• Abstract summary: We devise quantum circuit implementation of exponential of scaled $n$-qubit Pauli-strings using one-qubit rotation gates and CNOT gates. These circuits can be implemented in low-connected quantum hardware, in particular, star graph architecture for digital quantum computation.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: We devise quantum circuit implementation of exponential of scaled $n$-qubit Pauli-strings using one-qubit rotation gates and CNOT gates. These circuits can be implemented in low-connected quantum hardware, in particular, star graph architecture for digital quantum computation. Then these circuits are employed to simulate classes of 1D Hamiltonian operators that include $2$-sparse Hamiltonian, Ising Hamiltonian, and both time-independent and time-dependent Random Field Heisenberg Hamiltonian and Transverse Magnetic Random Quantum Ising Hamiltonian by approximating its unitary evolution with first-order Suzuki-Trotter expansion. Finally, we perform noisy Hamiltonian simulation of these circuits using different noise models to investigate Hamiltonian simulation on NISQ devices.

Related papers

• Linear Circuit Synthesis using Weighted Steiner Trees [45.11082946405984]
  CNOT circuits are a common building block of general quantum circuits. This article presents state-of-the-art algorithms for optimizing the number of CNOT gates. A simulated evaluation shows that the suggested is almost always beneficial and reduces the number of CNOT gates by up to 10%.
  arXiv  Detail & Related papers  (2024-08-07T19:51:22Z)
• Local Hamiltonian decomposition and classical simulation of parametrized quantum circuits [0.0]
  We develop a classical algorithm of complexity $O(K, 2n)$ to simulate parametrized quantum circuits (PQCs) of $n$ qubits.
  arXiv  Detail & Related papers  (2024-01-24T00:30:31Z)
• Quantum circuit model for discrete-time three-state quantum walks on Cayley graphs [0.0]
  We develop qutrit circuit models for discrete-time three-state quantum walks on Cayley graphs. We numerically simulate these circuits to mimic its performance on noisy quantum computers.
  arXiv  Detail & Related papers  (2024-01-19T20:45:26Z)
• Error-corrected Hadamard gate simulated at the circuit level [42.002147097239444]
  We simulate the logical Hadamard gate in the surface code under a circuit-level noise model. Our paper is the first to do this for a unitary gate on a quantum error-correction code.
  arXiv  Detail & Related papers  (2023-12-18T19:00:00Z)
• Classical variational optimization of PREPARE circuit for quantum phase estimation of quantum chemistry Hamiltonians [0.8009842832476994]
  We propose a method for constructing $textttPREPARE$ circuits for quantum phase estimation of a molecular Hamiltonian in quantum chemistry. The $textttPREPARE$ circuit generates a quantum state which encodes the coefficients of the terms in the Hamiltonian as probability amplitudes.
  arXiv  Detail & Related papers  (2023-08-26T05:32:38Z)
• Unimon qubit [42.83899285555746]
  Superconducting qubits are one of the most promising candidates to implement quantum computers. Here, we introduce and demonstrate a superconducting-qubit type, the unimon, which combines the desired properties of high non-linearity, full insensitivity to dc charge noise, insensitivity to flux noise, and a simple structure consisting only of a single Josephson junction in a resonator.
  arXiv  Detail & Related papers  (2022-03-11T12:57:43Z)
• Quantum simulation of $\phi^4$ theories in qudit systems [53.122045119395594]
  We discuss the implementation of quantum algorithms for lattice $Phi4$ theory on circuit quantum electrodynamics (cQED) system. The main advantage of qudit systems is that its multi-level characteristic allows the field interaction to be implemented only with diagonal single-qudit gates.
  arXiv  Detail & Related papers  (2021-08-30T16:30:33Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• 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)
• Parallel Quantum Algorithm for Hamiltonian Simulation [9.680246554758343]
  A parallel quantum algorithm is proposed for simulating the dynamics of a large class of Hamiltonians. The running time of our parallel quantum simulation algorithm measured by the quantum circuit depth has a doubly (poly-)logarithmic dependence. We show that the total gate depth of our algorithm has a $operatornamepolyloglog (1/epsilon)$ dependence in the parallel setting.
  arXiv  Detail & Related papers  (2021-05-25T12:46:33Z)
• 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)
• Universal topological quantum computation with strongly correlated Majorana edge modes [7.930410828384357]
  Majorana-based quantum gates are not complete for performing universal topological quantum computation. We show the application to Shor's integer factorization algorithm.
  arXiv  Detail & Related papers  (2020-04-07T12:03:14Z)

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.