Computation of Green's function by local variational quantum compilation
- URL: http://arxiv.org/abs/2303.15667v1
- Date: Tue, 28 Mar 2023 01:23:15 GMT
- Title: Computation of Green's function by local variational quantum compilation
- Authors: Shota Kanasugi, Shoichiro Tsutsui, Yuya O. Nakagawa, Kazunori
Maruyama, Hirotaka Oshima, Shintaro Sato
- Abstract summary: We propose an efficient method to compute the real-time Green's function based on the local variational quantum compilation algorithm.
Our method requires shallow quantum circuits to calculate the Green's function and can be utilized on both near-term noisy intermediate-scale and long-term fault-tolerant quantum computers.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Computation of the Green's function is crucial to study the properties of
quantum many-body systems such as strongly correlated systems. Although the
high-precision calculation of the Green's function is a notoriously challenging
task on classical computers, the development of quantum computers may enable us
to compute the Green's function with high accuracy even for
classically-intractable large-scale systems. Here, we propose an efficient
method to compute the real-time Green's function based on the local variational
quantum compilation (LVQC) algorithm, which simulates the time evolution of a
large-scale quantum system using a low-depth quantum circuit constructed
through optimization on a smaller-size subsystem. Our method requires shallow
quantum circuits to calculate the Green's function and can be utilized on both
near-term noisy intermediate-scale and long-term fault-tolerant quantum
computers depending on the computational resources we have. We perform a
numerical simulation of the Green's function for the one- and two-dimensional
Fermi-Hubbard model up to $4\times4$ sites lattice (32 qubits) and demonstrate
the validity of our protocol compared to a standard method based on the Trotter
decomposition. We finally present a detailed estimation of the gate count for
the large-scale Fermi-Hubbard model, which also illustrates the advantage of
our method over the Trotter decomposition.
Related papers
- 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) - Quantum algorithm for imaginary-time Green's functions [0.0]
We present a hybrid quantum-classical algorithm to calculate the imaginary-time one-particle Green's function.
The proposed algorithm combines variational quantum eigensolver and quantum subspace expansion to calculate Green's function.
arXiv Detail & Related papers (2023-09-18T16:28:11Z) - GRAPE optimization for open quantum systems with time-dependent
decoherence rates driven by coherent and incoherent controls [77.34726150561087]
The GRadient Ascent Pulse Engineering (GRAPE) method is widely used for optimization in quantum control.
We adopt GRAPE method for optimizing objective functionals for open quantum systems driven by both coherent and incoherent controls.
The efficiency of the algorithm is demonstrated through numerical simulations for the state-to-state transition problem.
arXiv Detail & Related papers (2023-07-17T13:37:18Z) - Computing the many-body Green's function with adaptive variational
quantum dynamics [0.0]
We present a method to compute the many-body real-time Green's function using an adaptive variational quantum dynamics simulation approach.
We demonstrate the evaluation of Green's function on an IBM Q quantum computer.
arXiv Detail & Related papers (2023-02-06T19:49:16Z) - Quantum subspace expansion algorithm for Green's functions [3.3946853660795884]
We present an algorithm to compute Green's functions on quantum computers for interacting electron systems.
It uses a continued fraction representation based on the Lanczos method, where the wave functions are expanded as linear combination of basis states.
We propose a two-level multigrid Trotter time evolution for an efficient preparation of the basis states in a quantum circuit.
arXiv Detail & Related papers (2022-04-29T22:27:26Z) - A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
We propose a hybrid quantum-classical algorithm for robust fitting.
Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs.
We present results obtained using an actual quantum computer.
arXiv Detail & Related papers (2022-01-25T05:59:24Z) - One-particle Green's functions from the quantum equation of motion
algorithm [0.0]
We introduce a novel near-term quantum algorithm for computing one-particle Green's functions via their Lehmann representation.
We demonstrate the validity of the present proposal by computing the Green's function of a two-site Fermi-Hubbard model on a IBM quantum processor.
arXiv Detail & Related papers (2022-01-05T21:13:19Z) - Hybrid quantum-classical algorithm for computing imaginary-time
correlation functions [0.0]
We propose a hybrid algorithm for computing imaginary-time Green's functions on quantum devices with limited hardware resources.
Using a quantum circuit simulator, we verified this algorithm by computing Green's functions for a dimer model and a four-site impurity model.
arXiv Detail & Related papers (2021-12-06T03:40:02Z) - Nuclear two point correlation functions on a quantum-computer [105.89228861548395]
We use current quantum hardware and error mitigation protocols to calculate response functions for a highly simplified nuclear model.
In this work we use current quantum hardware and error mitigation protocols to calculate response functions for a modified Fermi-Hubbard model in two dimensions with three distinguishable nucleons on four lattice sites.
arXiv Detail & Related papers (2021-11-04T16:25:33Z) - Bosonic field digitization for quantum computers [62.997667081978825]
We address the representation of lattice bosonic fields in a discretized field amplitude basis.
We develop methods to predict error scaling and present efficient qubit implementation strategies.
arXiv Detail & Related papers (2021-08-24T15:30:04Z) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z)
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.