Fock-space Schrieffer--Wolff transformation: classically-assisted rank-reduced quantum phase estimation algorithm

• URL: http://arxiv.org/abs/2211.10529v1
• Date: Fri, 18 Nov 2022 23:06:57 GMT
• Title: Fock-space Schrieffer--Wolff transformation: classically-assisted rank-reduced quantum phase estimation algorithm
• Authors: Karol Kowalski, Nicholas P. Bauman
• Abstract summary: In this paper, we focus on the Schrieffer--Wolff (SW) transformation of the electronic Hamiltonians for molecular systems. We demonstrate that by employing Fock-space variants of the SW transformation one can significantly increase the locality of the qubit-mapped similarity transformed Hamiltonians. The RRST formalism serves as a design principle for developing new classes of approximate schemes that reduce the complexity of quantum circuits.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present an extension of many-body downfolding methods to reduce the resources required in the quantum phase estimation (QPE) algorithm. In this paper, we focus on the Schrieffer--Wolff (SW) transformation of the electronic Hamiltonians for molecular systems that provides significant simplifications of quantum circuits for simulations of quantum dynamics. We demonstrate that by employing Fock-space variants of the SW transformation (or rank-reducing similarity transformations (RRST)) one can significantly increase the locality of the qubit-mapped similarity transformed Hamiltonians. The practical utilization of the SW-RRST formalism is associated with a series of approximations discussed in the manuscript. In particular, amplitudes that define RRST can be evaluated using conventional computers and then encoded on quantum computers. The SW-RRST QPE quantum algorithms can also be viewed as an extension of the standard state-specific coupled-cluster downfolding methods to provide a robust alternative to the traditional QPE algorithms to identify the ground and excited states for systems with various numbers of electrons using the same Fock-space representations of the downfolded Hamiltonian.The RRST formalism serves as a design principle for developing new classes of approximate schemes that reduce the complexity of quantum circuits.

Related papers

• Efficient Quantum Pseudorandomness from Hamiltonian Phase States [41.94295877935867]
  We introduce a quantum hardness assumption called the Hamiltonian Phase State (HPS) problem. We show that our assumption is plausibly fully quantum; meaning, it cannot be used to construct one-way functions. We show that our assumption and its variants allow us to efficiently construct many pseudorandom quantum primitives.
  arXiv  Detail & Related papers  (2024-10-10T16:10:10Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Unveiling quantum phase transitions from traps in variational quantum algorithms [0.0]
  We introduce a hybrid algorithm that combines quantum optimization with classical machine learning. We use LASSO for identifying conventional phase transitions and the Transformer model for topological transitions. Our protocol significantly enhances efficiency and precision, opening new avenues in the integration of quantum computing and machine learning.
  arXiv  Detail & Related papers  (2024-05-14T09:01:41Z)
• Hamiltonian Encoding for Quantum Approximate Time Evolution of Kinetic Energy Operator [2.184775414778289]
  The time evolution operator plays a crucial role in the precise computation of chemical experiments on quantum computers. We have proposed a new encoding method, namely quantum approximate time evolution (QATE) for the quantum implementation of the kinetic energy operator.
  arXiv  Detail & Related papers  (2023-10-05T05:25:38Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Reducing Unitary Coupled Cluster Circuit Depth by Classical Stochastic Amplitude Pre-Screening [0.0]
  Unitary Coupled Cluster (UCC) approaches are an appealing route to utilising quantum hardware to perform quantum chemistry calculations. We present a combined classical-quantum approach where a classical UCC pre-processing step is used to determine the important excitations in the UCC ansatz.
  arXiv  Detail & Related papers  (2021-08-24T18:34:14Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Autoregressive Transformer Neural Network for Simulating Open Quantum Systems via a Probabilistic Formulation [5.668795025564699]
  We present an approach for tackling open quantum system dynamics. We compactly represent quantum states with autoregressive transformer neural networks. Efficient algorithms have been developed to simulate the dynamics of the Liouvillian superoperator.
  arXiv  Detail & Related papers  (2020-09-11T18:00:00Z)

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.