Parallelization techniques for quantum simulation of fermionic systems
- URL: http://arxiv.org/abs/2207.12470v3
- Date: Thu, 30 Mar 2023 20:58:46 GMT
- Title: Parallelization techniques for quantum simulation of fermionic systems
- Authors: Jacob Bringewatt and Zohreh Davoudi
- Abstract summary: Mapping fermionic operators to qubit operators is an essential step for simulating fermionic systems on a quantum computer.
We investigate how the choice of such a mapping interacts with the underlying qubit connectivity of the quantum processor.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-sa/4.0/
- Abstract: Mapping fermionic operators to qubit operators is an essential step for
simulating fermionic systems on a quantum computer. We investigate how the
choice of such a mapping interacts with the underlying qubit connectivity of
the quantum processor to enable (or impede) parallelization of the resulting
Hamiltonian-simulation algorithm. It is shown that this problem can be mapped
to a path coloring problem on a graph constructed from the particular choice of
encoding fermions onto qubits and the fermionic interactions onto paths. The
basic version of this problem is called the weak coloring problem. Taking into
account the fine-grained details of the mapping yields what is called the
strong coloring problem, which leads to improved parallelization performance. A
variety of illustrative analytical and numerical examples are presented to
demonstrate the amount of improvement for both weak and strong coloring-based
parallelizations. Our results are particularly important for implementation on
near-term quantum processors where minimizing circuit depth is necessary for
algorithmic feasibility.
Related papers
- A General Framework for Gradient-Based Optimization of Superconducting Quantum Circuits using Qubit Discovery as a Case Study [0.19528996680336308]
We present a comprehensive framework for the gradient-based optimization of superconducting quantum circuits.
We apply this framework to the qubit discovery problem, demonstrating its effectiveness in identifying qubit designs with superior performance metrics.
arXiv Detail & Related papers (2024-08-22T19:46:50Z) - Graph Algorithms with Neutral Atom Quantum Processors [31.546387965618333]
We review the advancements in quantum algorithms for graph problems running on neutral atom Quantum Processing Units (QPUs)
We discuss recently introduced embedding and problem-solving techniques.
We clarify ongoing advancements in hardware, with an emphasis on enhancing the scalability, controllability and repetition rate of neutral atom QPUs.
arXiv Detail & Related papers (2024-03-18T16:30:42Z) - Interaction graph-based characterization of quantum benchmarks for
improving quantum circuit mapping techniques [1.351147045576948]
We propose to extend the characterization of quantum circuits by including qubit interaction graph properties.
Our study reveals a correlation between interaction graph-based parameters and mapping performance metrics for various existing configurations of quantum devices.
arXiv Detail & Related papers (2022-12-13T15:24:37Z) - Efficient protocol for solving combinatorial graph problems on
neutral-atom quantum processors [0.0]
We propose a novel protocol for solving hard graph problems that combines variational quantum computing and machine learning.
Our numerical simulations show that the proposed protocol can reduce dramatically the number of iterations to be run on the quantum device.
arXiv Detail & Related papers (2022-07-26T16:40:14Z) - Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most.
We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
arXiv Detail & Related papers (2022-04-12T19:39:31Z) - Numerical Simulations of Noisy Quantum Circuits for Computational
Chemistry [51.827942608832025]
Near-term quantum computers can calculate the ground-state properties of small molecules.
We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
arXiv Detail & Related papers (2021-12-31T16:33:10Z) - Simulating the Mott transition on a noisy digital quantum computer via
Cartan-based fast-forwarding circuits [62.73367618671969]
Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model.
Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models.
This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
arXiv Detail & Related papers (2021-12-10T17:32:15Z) - 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) - 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) - 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) - Quantum Optimization for the Graph Coloring Problem with Space-Efficient
Embedding [0.0]
We introduce a novel space-efficient quantum optimization algorithm for the graph coloring problem.
Our circuits are deeper than the ones of the standard approach.
To explore currently available alternatives, we perform a study of random graph coloring on a quantum annealer.
arXiv Detail & Related papers (2020-09-15T18:34:17Z)
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.