Reducing circuit depth with qubitwise diagonalization
- URL: http://arxiv.org/abs/2306.00170v3
- Date: Tue, 19 Dec 2023 20:42:36 GMT
- Title: Reducing circuit depth with qubitwise diagonalization
- Authors: Edison M. Murairi and Michael J. Cervia
- Abstract summary: We propose an algorithm yielding quantum circuits with depths $O(n log r)$ diagonalizing $n$-qubit operators generated by $r$ Pauli operators.
We observe that our algorithm performs favorably in producing quantum circuits diagonalizing randomly generated Hamiltonians as well as molecular Hamiltonians with short depths and low two-qubit gate counts.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: A variety of quantum algorithms employ Pauli operators as a convenient basis
for studying the spectrum or evolution of Hamiltonians or measuring multi-body
observables. One strategy to reduce circuit depth in such algorithms involves
simultaneous diagonalization of Pauli operators generating unitary evolution
operators or observables of interest. We propose an algorithm yielding quantum
circuits with depths $O(n \log r)$ diagonalizing $n$-qubit operators generated
by $r$ Pauli operators. Moreover, as our algorithm iteratively diagonalizes all
operators on at least one qubit per step, it is well suited to maintain low
circuit depth even on hardware with limited qubit connectivity. We observe that
our algorithm performs favorably in producing quantum circuits diagonalizing
randomly generated Hamiltonians as well as molecular Hamiltonians with short
depths and low two-qubit gate counts.
Related papers
- Polynomial-depth quantum algorithm for computing matrix determinant [46.13392585104221]
We propose an algorithm for calculating the determinant of a square matrix, and construct a quantum circuit realizing it.
Each row of the matrix is encoded as a pure state of some quantum system.
The admitted matrix is therefore arbitrary up to the normalization of quantum states of those systems.
arXiv Detail & Related papers (2024-01-29T23:23:27Z) - A two-circuit approach to reducing quantum resources for the quantum lattice Boltzmann method [41.66129197681683]
Current quantum algorithms for solving CFD problems use a single quantum circuit and, in some cases, lattice-based methods.
We introduce the a novel multiple circuits algorithm that makes use of a quantum lattice Boltzmann method (QLBM)
The problem is cast as a stream function--vorticity formulation of the 2D Navier-Stokes equations and verified and tested on a 2D lid-driven cavity flow.
arXiv Detail & Related papers (2024-01-20T15:32:01Z) - Learning shallow quantum circuits [7.411898489476803]
We present an algorithm for learning the description of any unknown $n$-qubit shallow quantum circuit $U$.
We also provide a classical algorithm for learning the description of any unknown $n$-qubit state $lvert psi rangle$.
Our approach uses a quantum circuit representation based on local inversions and a technique to combine these inversions.
arXiv Detail & Related papers (2024-01-18T16:05:00Z) - Tridiagonal matrix decomposition for Hamiltonian simulation on a quantum computer [0.0]
This work is the efficient procedure for representation of a tridiagonal matrix in the Pauli basis.
It allows one to construct a Hamiltonian evolution circuit without the use of oracles.
arXiv Detail & Related papers (2023-09-29T20:27:05Z) - Automatic Depth-Optimized Quantum Circuit Synthesis for Diagonal Unitary
Matrices with Asymptotically Optimal Gate Count [9.194399933498323]
It is of great importance to optimize the depth/gate-count when designing quantum circuits for specific tasks.
In this paper, we propose a depth-optimized synthesis algorithm that automatically produces a quantum circuit for any given diagonal unitary matrix.
arXiv Detail & Related papers (2022-12-02T06:58:26Z) - Linear-depth quantum circuits for multiqubit controlled gates [3.0001636668817606]
We present a systematic procedure to decompose multiqubit controlled unitary gates.
We show the advantage of our algorithm with proof-of-principle experiments on the IBM quantum cloud platform.
arXiv Detail & Related papers (2022-03-22T16:57:59Z) - Hardware-Tailored Diagonalization Circuits [0.9187159782788579]
A central building block of many quantum algorithms is the diagonalization of Pauli operators.
We introduce a theoretical framework for constructing hardware-tailored diagonalization circuits.
arXiv Detail & Related papers (2022-03-07T19:00:01Z) - Quantum algorithms for grid-based variational time evolution [36.136619420474766]
We propose a variational quantum algorithm for performing quantum dynamics in first quantization.
Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
arXiv Detail & Related papers (2022-03-04T19:00:45Z) - 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) - Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task.
Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate.
The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
arXiv Detail & Related papers (2021-06-06T13:15:25Z) - Efficient Algorithms for Causal Order Discovery in Quantum Networks [44.356294905844834]
Given black-box access to the input and output systems, we develop the first efficient quantum causal order discovery algorithm.
We model the causal order with quantum combs, and our algorithms output the order of inputs and outputs that the given process is compatible with.
Our algorithms will provide efficient ways to detect and optimize available transmission paths in quantum communication networks.
arXiv Detail & Related papers (2020-12-03T07:12:08Z)
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.