Block-Invariant Symmetry Shift: Preprocessing technique for second-quantized Hamiltonians to improve their decompositions to Linear Combination of Unitaries

• URL: http://arxiv.org/abs/2304.13772v3
• Date: Tue, 24 Oct 2023 19:27:16 GMT
• Title: Block-Invariant Symmetry Shift: Preprocessing technique for second-quantized Hamiltonians to improve their decompositions to Linear Combination of Unitaries
• Authors: Ignacio Loaiza, Artur F. Izmaylov
• Abstract summary: We propose a preprocessing procedure that reduces the norm of the Hamiltonian without changing its eigenspectrum for the target states of a particular symmetry. The new procedure, Block-Invariant Symmetry Shift (BLISS), builds an operator T such that the cost of implementing H-T is reduced compared to that of H, yet H-T acts on the subspaces of interest the same way as H does.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Computational cost of energy estimation for molecular electronic Hamiltonians via Quantum Phase Estimation (QPE) grows with the difference between the largest and smallest eigenvalues of the Hamiltonian. In this work we propose a preprocessing procedure that reduces the norm of the Hamiltonian without changing its eigenspectrum for the target states of a particular symmetry. The new procedure, Block-Invariant Symmetry Shift (BLISS), builds an operator T such that the cost of implementing H-T is reduced compared to that of H, yet H-T acts on the subspaces of interest the same way as H does. BLISS performance is demonstrated for Linear Combination of Unitaries (LCU)-based QPE approaches on a set of small molecules. Using the number of electrons as the symmetry specifying the target set of states, BLISS provided a factor of 2 reduction of 1-norm for several LCU decompositions compared to their unshifted versions.

Related papers

• Kernpiler: Compiler Optimization for Quantum Hamiltonian Simulation with Partial Trotterization [38.59115551211364]
  Existing compilation techniques for Hamiltonian simulation struggle to provide gate counts feasible on current quantum computers. We propose partial Trotterization, where sets of non-commuting Hamiltonian terms are directly compiled allowing for less error per Trotter step. We demonstrate with numerical simulations across spin and fermionic Hamiltonians that compared to state of the art methods such as Qiskit's Rustiq and Qiskit's Paulievolutiongate, our novel compiler presents up to 10x gate and depth count reductions.
  arXiv  Detail & Related papers  (2025-04-09T18:41:31Z)
• Predicting symmetries of quantum dynamics with optimal samples [41.42817348756889]
  Identifying symmetries in quantum dynamics is a crucial challenge with profound implications for quantum technologies. We introduce a unified framework combining group representation theory and subgroup hypothesis testing to predict these symmetries with optimal efficiency. We prove that parallel strategies achieve the same performance as adaptive or indefinite-causal-order protocols.
  arXiv  Detail & Related papers  (2025-02-03T15:57:50Z)
• Simultaneously optimizing symmetry shifts and tensor factorizations for cost-efficient Fault-Tolerant Quantum Simulations of electronic Hamiltonians [0.0]
  In fault-tolerant quantum computing the cost of calculating Hamiltonian eigenvalues is proportional to the constant scaling of the Hamiltonian matrix block-encoded in a unitary circuit. We present a method to reduce this scaling constant for the electronic Hamiltonians represented as a linear combination of unitaries.
  arXiv  Detail & Related papers  (2024-12-02T10:02: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)
• Simulating electronic structure on bosonic quantum computers [35.884125235274865]
  One of the most promising applications of quantum computing is the simulation of many-fermion problems. We show how an electronic structure Hamiltonian can be transformed into a system of qumodes through qubit-assisted fermion-to-qumode mapping.
  arXiv  Detail & Related papers  (2024-04-16T02:04:11Z)
• Reducing the runtime of fault-tolerant quantum simulations in chemistry through symmetry-compressed double factorization [0.0]
  We introduce the symmetry-compressed double factorization (SCDF) approach, which combines a compressed double factorization of the Hamiltonian with the symmetry shift technique, significantly reducing the 1-norm value. For the systems considered here, SCDF leads to a sizeable reduction of the Toffoli gate count in comparison to other variants of double factorization or even tensor hypercontraction.
  arXiv  Detail & Related papers  (2024-03-06T07:11:02Z)
• Quantum Algorithms for Simulating Nuclear Effective Field Theories [40.83664249192338]
  We use state-of-the-art Hamiltonian-simulation methods to estimate the qubit and gate costs to simulate low-energy effective field theories (EFTs) of nuclear physics. We demonstrate how symmetries of the low-energy nuclear Hamiltonians can be utilized to obtain tighter error bounds on the simulation algorithm.
  arXiv  Detail & Related papers  (2023-12-08T20:09:28Z)
• Growth reduction of similarity transformed electronic Hamiltonians in qubit space [0.0]
  One approach to relieving the circuit depth requirements for VQE is to "pre-process" the electronic Hamiltonian. This often comes at the price of a substantial increase in the number of terms to measure in the similarity transformed Hamiltonian. We propose an efficient approach to sampling elements from the complete Pauli group for $N$ qubits which minimize the onset of new terms in the transformed Hamiltonian.
  arXiv  Detail & Related papers  (2022-10-08T02:01:53Z)
• Reducing molecular electronic Hamiltonian simulation cost for Linear Combination of Unitaries approaches [0.18374319565577155]
  We consider different Linear Combination of Unitaries (LCU) decompositions for molecular electronic structure Hamiltonians. The main figure of merit is the 1-norm of their coefficients, which is associated with the quantum circuit complexity.
  arXiv  Detail & Related papers  (2022-08-17T13:08:05Z)
• 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)
• 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)
• SYK meets non-Hermiticity II: measurement-induced phase transition [16.533265279392772]
  We analytically derive the effective action in the large-$N$ limit and show that an entanglement transition is caused by the symmetry breaking in the enlarged replica space. We also verify the large-$N$ critical exponents by numerically solving the Schwinger-Dyson equation.
  arXiv  Detail & Related papers  (2021-04-16T17:55:08Z)
• Spectral Analysis of Product Formulas for Quantum Simulation [0.0]
  We show that the Trotter step size needed to estimate an energy eigenvalue within precision can be improved in scaling from $epsilon$ to $epsilon1/2$ for a large class of systems. Results partially generalize to diabatic processes, which remain in a narrow energy band separated from the rest of the spectrum by a gap.
  arXiv  Detail & Related papers  (2021-02-25T03:17:25Z)
• Benchmarking adaptive variational quantum eigensolvers [63.277656713454284]
  We benchmark the accuracy of VQE and ADAPT-VQE to calculate the electronic ground states and potential energy curves. We find both methods provide good estimates of the energy and ground state. gradient-based optimization is more economical and delivers superior performance than analogous simulations carried out with gradient-frees.
  arXiv  Detail & Related papers  (2020-11-02T19:52:04Z)

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.