The Bonsai algorithm: grow your own fermion-to-qubit mapping
- URL: http://arxiv.org/abs/2212.09731v2
- Date: Tue, 12 Sep 2023 17:49:45 GMT
- Title: The Bonsai algorithm: grow your own fermion-to-qubit mapping
- Authors: Aaron Miller, Zolt\'an Zimbor\'as, Stefan Knecht, Sabrina Maniscalco,
Guillermo Garc\'ia-P\'erez
- Abstract summary: We present a formalism to design flexible fermion-to-qubit mappings from ternary trees.
We introduce a recipe that guarantees Fock basis states are mapped to computational basis states in qubit space.
We illustrate the algorithm by producing mappings for the heavy-hexagon topology widely used in IBM quantum computers.
- Score: 0.7049738935364298
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Fermion-to-qubit mappings are used to represent fermionic modes on quantum
computers, an essential first step in many quantum algorithms for electronic
structure calculations. In this work, we present a formalism to design flexible
fermion-to-qubit mappings from ternary trees. We discuss in an intuitive manner
the connection between the generating trees' structure and certain properties
of the resulting mapping, such as Pauli weight and the delocalisation of mode
occupation. Moreover, we introduce a recipe that guarantees Fock basis states
are mapped to computational basis states in qubit space, a desirable property
for many applications in quantum computing. Based on this formalism, we
introduce the Bonsai algorithm, which takes as input the potentially limited
topology of the qubit connectivity of a quantum device and returns a tailored
fermion-to-qubit mapping that reduces the SWAP overhead with respect to other
paradigmatic mappings. We illustrate the algorithm by producing mappings for
the heavy-hexagon topology widely used in IBM quantum computers. The resulting
mappings have a favourable Pauli weight scaling $\mathcal{O}(\sqrt{N})$ on this
connectivity, while ensuring that no SWAP gates are necessary for single
excitation operations.
Related papers
- Treespilation: Architecture- and State-Optimised Fermion-to-Qubit
Mappings [0.8655526882770742]
We introduce "treespilation," a technique for efficiently mapping Fermionic systems.
We use this technique to minimise the number of CNOT gates required to simulate chemical groundstates.
We observe significant reductions, up to $74%$, in CNOT counts on full connectivity.
arXiv Detail & Related papers (2024-03-06T19:05:53Z) - Quantum simulation of Pauli channels and dynamical maps: algorithm and
implementation [0.0]
We propose a quantum algorithm for simulating Pauli channels and extend it to encompass Pauli dynamical maps.
A parametrized quantum circuit is employed to accommodate for dynamical maps.
arXiv Detail & Related papers (2023-07-31T22:57:29Z) - Fock-space Schrieffer--Wolff transformation: classically-assisted
rank-reduced quantum phase estimation algorithm [0.0]
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.
arXiv Detail & Related papers (2022-11-18T23:06:57Z) - Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs)
We propose a new protocol for approximating TN states using realistic quantum circuits.
Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
arXiv Detail & Related papers (2022-09-01T17:08:41Z) - Ground state preparation and energy estimation on early fault-tolerant
quantum computers via quantum eigenvalue transformation of unitary matrices [3.1952399274829775]
We develop a tool called quantum eigenvalue transformation of unitary matrices with reals (QET-U)
This leads to a simple quantum algorithm that outperforms all previous algorithms with a comparable circuit structure for estimating the ground state energy.
We demonstrate the performance of the algorithm using IBM Qiskit for the transverse field Ising model.
arXiv Detail & Related papers (2022-04-12T17:11:40Z) - 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) - 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) - Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits
at Exascale [57.84751206630535]
We present a modernized version of the Quantum Virtual Machine (TNQVM) which serves as a quantum circuit simulation backend in the e-scale ACCelerator (XACC) framework.
The new version is based on the general purpose, scalable network processing library, ExaTN, and provides multiple quantum circuit simulators.
By combining the portable XACC quantum processors and the scalable ExaTN backend we introduce an end-to-end virtual development environment which can scale from laptops to future exascale platforms.
arXiv Detail & Related papers (2021-04-21T13:26:42Z) - Compiling single-qubit braiding gate for Fibonacci anyons topological
quantum computation [0.0]
Topological quantum computation is an implementation of a quantum computer in a way that radically reduces decoherence.
Topological qubits are encoded in the topological evolution of two-dimensional quasi-particles called anyons.
arXiv Detail & Related papers (2020-08-08T15:34:03Z)
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.